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-158897699100458.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100458
=====================================================================

--------------------
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-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1589249993252

[2020-05-12 02:19:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:19:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:19:55] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-05-12 02:19:55] [INFO ] Transformed 262 places.
[2020-05-12 02:19:55] [INFO ] Transformed 219 transitions.
[2020-05-12 02:19:55] [INFO ] Found NUPN structural information;
[2020-05-12 02:19:55] [INFO ] Parsed PT model containing 262 places and 219 transitions in 97 ms.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1358 resets, run finished after 274 ms. (steps per millisecond=364 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:19:56] [INFO ] Computed 43 place invariants in 11 ms
[2020-05-12 02:19:56] [INFO ] [Real]Absence check using 30 positive place invariants in 31 ms returned sat
[2020-05-12 02:19:56] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2020-05-12 02:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:56] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-05-12 02:19:56] [INFO ] Deduced a trap composed of 8 places in 168 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 11 places in 85 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 55 places in 69 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 19 places in 165 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 10 places in 132 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2020-05-12 02:19:57] [INFO ] Deduced a trap composed of 30 places in 68 ms
[2020-05-12 02:19:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1360 ms
[2020-05-12 02:19:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-05-12 02:19:58] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 10 places in 97 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 35 places in 40 ms
[2020-05-12 02:19:59] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-05-12 02:19:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1024 ms
[2020-05-12 02:19:59] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 142 ms.
[2020-05-12 02:20:00] [INFO ] Added : 146 causal constraints over 30 iterations in 801 ms. Result :sat
[2020-05-12 02:20:00] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 8 places in 44 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 55 places in 45 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2020-05-12 02:20:00] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-05-12 02:20:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 643 ms
[2020-05-12 02:20:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 31 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:01] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 19 places in 55 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 16 places in 65 ms
[2020-05-12 02:20:01] [INFO ] Deduced a trap composed of 19 places in 174 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 23 places in 4007 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2020-05-12 02:20:05] [INFO ] Deduced a trap composed of 12 places in 60 ms
[2020-05-12 02:20:07] [INFO ] Deduced a trap composed of 34 places in 1998 ms
[2020-05-12 02:20:07] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2020-05-12 02:20:07] [INFO ] Deduced a trap composed of 35 places in 45 ms
[2020-05-12 02:20:08] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2020-05-12 02:20:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6905 ms
[2020-05-12 02:20:08] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-05-12 02:20:08] [INFO ] Added : 146 causal constraints over 30 iterations in 519 ms. Result :sat
[2020-05-12 02:20:08] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:20:08] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:08] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-05-12 02:20:08] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2020-05-12 02:20:08] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-05-12 02:20:08] [INFO ] Deduced a trap composed of 16 places in 25 ms
[2020-05-12 02:20:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 159 ms
[2020-05-12 02:20:08] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:20:08] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:09] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 19 places in 55 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 20 places in 42 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 34 places in 48 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 61 places in 41 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 67 places in 36 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 65 places in 38 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 65 places in 37 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 64 places in 46 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 65 places in 41 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-05-12 02:20:09] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 60 places in 79 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 59 places in 35 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 60 places in 45 ms
[2020-05-12 02:20:10] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1080 ms
[2020-05-12 02:20:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:20:10] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:10] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 34 places in 48 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 61 places in 38 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 57 places in 40 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 58 places in 38 ms
[2020-05-12 02:20:10] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 64 places in 86 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 35 places in 44 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 57 places in 84 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 70 places in 123 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 67 places in 57 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 60 places in 107 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 65 places in 102 ms
[2020-05-12 02:20:11] [INFO ] Deduced a trap composed of 61 places in 99 ms
[2020-05-12 02:20:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1414 ms
[2020-05-12 02:20:11] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:20:12] [INFO ] Added : 135 causal constraints over 28 iterations in 473 ms. Result :sat
[2020-05-12 02:20:12] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-12 02:20:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-05-12 02:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:12] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 55 places in 47 ms
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 57 places in 48 ms
[2020-05-12 02:20:12] [INFO ] Deduced a trap composed of 16 places in 26 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 16 places in 24 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 19 places in 26 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 12 places in 36 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-12 02:20:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 523 ms
[2020-05-12 02:20:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2020-05-12 02:20:13] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:13] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 55 places in 44 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 14 places in 41 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-05-12 02:20:13] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-05-12 02:20:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 435 ms
[2020-05-12 02:20:13] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-05-12 02:20:14] [INFO ] Added : 137 causal constraints over 28 iterations in 443 ms. Result :sat
[2020-05-12 02:20:14] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:14] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:14] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 61 places in 41 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 56 places in 42 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 14 places in 41 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-05-12 02:20:14] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 19 places in 43 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 11 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 60 places in 41 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 64 places in 42 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 63 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 69 places in 44 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 62 places in 42 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 68 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 68 places in 41 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 59 places in 40 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 63 places in 40 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 67 places in 41 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 58 places in 40 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 59 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 60 places in 40 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 62 places in 40 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 58 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-05-12 02:20:15] [INFO ] Deduced a trap composed of 59 places in 39 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-05-12 02:20:16] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1674 ms
[2020-05-12 02:20:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-05-12 02:20:16] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:16] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 17 places in 42 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 63 places in 40 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 60 places in 40 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 10 places in 38 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 58 places in 39 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 61 places in 51 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 62 places in 50 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 17 places in 31 ms
[2020-05-12 02:20:16] [INFO ] Deduced a trap composed of 22 places in 41 ms
[2020-05-12 02:20:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 652 ms
[2020-05-12 02:20:16] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-05-12 02:20:17] [INFO ] Added : 162 causal constraints over 33 iterations in 535 ms. Result :sat
[2020-05-12 02:20:17] [INFO ] Deduced a trap composed of 61 places in 60 ms
[2020-05-12 02:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-12 02:20:17] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-05-12 02:20:17] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2020-05-12 02:20:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:17] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-12 02:20:17] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2020-05-12 02:20:17] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-05-12 02:20:17] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 16 places in 64 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 35 places in 57 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 65 places in 51 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 68 places in 50 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 60 places in 59 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 67 places in 70 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 61 places in 48 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 62 places in 41 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 65 places in 63 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 64 places in 43 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 64 places in 45 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 71 places in 44 ms
[2020-05-12 02:20:18] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 75 places in 40 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 69 places in 35 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 59 places in 36 ms
[2020-05-12 02:20:19] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1333 ms
[2020-05-12 02:20:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:20:19] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2020-05-12 02:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:19] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 64 places in 49 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 62 places in 45 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 14 places in 43 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 16 places in 45 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 58 places in 40 ms
[2020-05-12 02:20:19] [INFO ] Deduced a trap composed of 60 places in 40 ms
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 63 places in 41 ms
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 57 places in 77 ms
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 57 places in 40 ms
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 58 places in 49 ms
[2020-05-12 02:20:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 927 ms
[2020-05-12 02:20:20] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-05-12 02:20:20] [INFO ] Added : 170 causal constraints over 35 iterations in 570 ms. Result :sat
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 58 places in 49 ms
[2020-05-12 02:20:20] [INFO ] Deduced a trap composed of 61 places in 47 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 60 places in 44 ms
[2020-05-12 02:20:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2020-05-12 02:20:21] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:21] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:21] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 62 places in 61 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 19 places in 59 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2020-05-12 02:20:21] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-05-12 02:20:22] [INFO ] Deduced a trap composed of 64 places in 322 ms
[2020-05-12 02:20:22] [INFO ] Deduced a trap composed of 67 places in 57 ms
[2020-05-12 02:20:22] [INFO ] Deduced a trap composed of 58 places in 618 ms
[2020-05-12 02:20:22] [INFO ] Deduced a trap composed of 23 places in 46 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 12 places in 20 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 18 places in 17 ms
[2020-05-12 02:20:23] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1886 ms
[2020-05-12 02:20:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:20:23] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:23] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 13 places in 46 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 54 places in 56 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 22 places in 51 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 23 places in 48 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 39 places in 48 ms
[2020-05-12 02:20:23] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 37 places in 46 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 58 places in 53 ms
[2020-05-12 02:20:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 855 ms
[2020-05-12 02:20:24] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-05-12 02:20:24] [INFO ] Added : 165 causal constraints over 34 iterations in 536 ms. Result :sat
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 62 places in 48 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 66 places in 46 ms
[2020-05-12 02:20:24] [INFO ] Deduced a trap composed of 58 places in 47 ms
[2020-05-12 02:20:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2020-05-12 02:20:25] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:25] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:25] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 67 places in 47 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 20 places in 35 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 20 places in 33 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 33 places in 34 ms
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 25 places in 31 ms
[2020-05-12 02:20:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 521 ms
[2020-05-12 02:20:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:20:25] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:25] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-05-12 02:20:25] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 13 places in 49 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 59 places in 49 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 31 places in 48 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 24 places in 50 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 17 places in 56 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 32 places in 52 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 41 places in 52 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 25 places in 40 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 39 places in 48 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 19 places in 46 ms
[2020-05-12 02:20:26] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 40 places in 45 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 64 places in 47 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 61 places in 49 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 65 places in 47 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 21 places in 46 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 60 places in 47 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-05-12 02:20:27] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-05-12 02:20:27] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 1729 ms
[2020-05-12 02:20:27] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:20:28] [INFO ] Added : 162 causal constraints over 33 iterations in 767 ms. Result :sat
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 56 places in 73 ms
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 59 places in 55 ms
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 59 places in 59 ms
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 58 places in 53 ms
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 61 places in 59 ms
[2020-05-12 02:20:28] [INFO ] Deduced a trap composed of 62 places in 62 ms
[2020-05-12 02:20:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 494 ms
[2020-05-12 02:20:28] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:20:28] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:29] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 14 places in 41 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 15 places in 40 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 60 places in 42 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-05-12 02:20:29] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 59 places in 47 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 57 places in 46 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 63 places in 41 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 60 places in 41 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 58 places in 53 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 58 places in 52 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 58 places in 50 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 61 places in 44 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 62 places in 42 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 65 places in 43 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 65 places in 49 ms
[2020-05-12 02:20:30] [INFO ] Deduced a trap composed of 56 places in 44 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 58 places in 50 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 55 places in 45 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 59 places in 48 ms
[2020-05-12 02:20:31] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2059 ms
[2020-05-12 02:20:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2020-05-12 02:20:31] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:31] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 56 places in 44 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 31 places in 46 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 59 places in 61 ms
[2020-05-12 02:20:31] [INFO ] Deduced a trap composed of 20 places in 44 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 61 places in 41 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 64 places in 41 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 66 places in 42 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 60 places in 40 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 66 places in 40 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 19 places in 40 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 61 places in 38 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-05-12 02:20:32] [INFO ] Deduced a trap composed of 19 places in 56 ms
[2020-05-12 02:20:32] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1370 ms
[2020-05-12 02:20:32] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 6 ms.
[2020-05-12 02:20:33] [INFO ] Added : 161 causal constraints over 33 iterations in 512 ms. Result :sat
[2020-05-12 02:20:33] [INFO ] Deduced a trap composed of 57 places in 46 ms
[2020-05-12 02:20:33] [INFO ] Deduced a trap composed of 54 places in 44 ms
[2020-05-12 02:20:33] [INFO ] Deduced a trap composed of 58 places in 43 ms
[2020-05-12 02:20:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 02:20:33] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:20:33] [INFO ] Flatten gal took : 40 ms
FORMULA BusinessProcesses-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:20:33] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:20:33] [INFO ] Applying decomposition
[2020-05-12 02:20:33] [INFO ] Flatten gal took : 14 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/graph12719366075360671008.txt, -o, /tmp/graph12719366075360671008.bin, -w, /tmp/graph12719366075360671008.weights], workingDir=null]
[2020-05-12 02:20:33] [INFO ] Input system was already deterministic with 204 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12719366075360671008.bin, -l, -1, -v, -w, /tmp/graph12719366075360671008.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:20:33] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-12 02:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:20:33] [INFO ] Computed 43 place invariants in 5 ms
inv : p47 + p48 + p49 - p231 - p232 - p256 = 0
inv : p84 + p85 + p86 - p247 - p248 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p79 + p82 + p83 + p247 + p248 = 1
inv : p40 + p41 - p43 - p44 - p104 - p106 - p166 - p167 - p169 - p170 + p171 + p172 + p174 + p175 - p176 - p177 - p179 - p180 + p181 + p182 + p184 + p185 + p239 + p240 - p251 - p252 + p256 - p259 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p21 + p22 + p23 + p24 + p25 + p218 + p219 = 1
inv : p26 + p27 - p218 - p219 = 0
inv : p0 + p18 + p19 + p20 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p259 + p260 + p261 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p1 + p101 + p191 + p192 + p193 + p194 + p195 = 1
inv : p60 + p61 + p62 - p235 - p236 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p136 + p138 + p139 + p140 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p55 + p58 + p59 + p235 + p236 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p46 + p50 + p51 + p231 + p232 + p256 = 1
inv : p47 + p48 + p52 - p231 - p232 - p259 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p35 + p36 + p37 + p38 + p42 + p43 + p44 = 1
inv : p90 + p91 + p92 - p251 - p252 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p166 + p167 + p168 + p169 + p170 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p28 + p29 + p30 + p31 + p32 + p224 + p225 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p119 + p120 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p141 + p143 + p144 + p145 = 1
inv : p0 + p1 + p2 + p3 + p4 + p87 + p88 + p89 + p251 + p252 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p121 + p124 + p125 = 1
inv : p33 + p34 - p224 - p225 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p171 + p172 + p173 + p174 + p175 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p16 + p17 - p196 - p197 - p198 - p199 - p200 - p201 - p202 - p203 - p205 - p206 - p207 - p208 - p209 - p210 - p211 - p214 - p215 - p216 - p217 - p218 - p219 - p220 - p221 - p222 - p223 - p224 - p225 - p226 - p227 - p228 - p229 - p230 - p231 - p232 - p233 - p234 - p235 - p236 - p237 - p238 - p239 - p240 - p241 - p242 - p243 - p244 - p245 - p246 - p247 - p248 - p249 - p250 - p251 - p252 - p253 - p254 - p255 - p259 - p260 - p261 = 0
inv : p0 + p1 + p2 + p3 + p93 + p94 + p95 + p96 = 1
inv : p0 + p1 + p101 + p102 + p186 + p187 + p188 + p189 + p190 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p146 + p147 + p148 + p149 + p150 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p69 + p74 + p75 + p243 + p244 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p151 + p152 + p153 + p154 + p155 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p46 + p53 + p54 + p231 + p232 + p259 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p35 + p36 + p37 + p38 + p39 + p43 + p44 + p104 + p106 + p166 + p167 + p169 + p170 - p171 - p172 - p174 - p175 + p176 + p177 + p179 + p180 - p181 - p182 - p184 - p185 - p239 - p240 + p251 + p252 - p256 + p259 = 1
inv : p76 + p77 + p78 - p243 - p244 = 0
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p1 + p2 + p97 + p98 + p99 + p100 = 1
inv : p0 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p259 + p260 + p261 = 1
inv : p0 + p1 + p101 + p102 + p103 + p181 + p182 + p183 + p184 + p185 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p63 + p64 + p65 + p239 + p240 = 1
inv : p0 + p1 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p131 + p132 + p133 + p134 + p135 = 1
inv : p66 + p67 + p68 - p239 - p240 = 0
inv : p256 + p257 + p258 - p259 - p260 - p261 = 0
Total of 43 invariants.
[2020-05-12 02:20:33] [INFO ] Computed 43 place invariants in 6 ms
[2020-05-12 02:20:33] [INFO ] Removed a total of 37 redundant transitions.
[2020-05-12 02:20:33] [INFO ] Flatten gal took : 63 ms
[2020-05-12 02:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-12 02:20:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
[2020-05-12 02:20:34] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !(((F(((F("(i1.u29.p86==1)"))&&("(i15.u72.p202!=1)"))&&("(i6.i1.u61.p172==1)")))||(X(G("(i1.u29.p86!=1)")))))
Formula 0 simplified : !(F("(i6.i1.u61.p172==1)" & "(i15.u72.p202!=1)" & F"(i1.u29.p86==1)") | XG"(i1.u29.p86!=1)")
built 37 ordering constraints for composite.
built 14 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 36 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 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.
[2020-05-12 02:20:34] [INFO ] Proved 245 variables to be positive in 257 ms
[2020-05-12 02:20:34] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2020-05-12 02:20:34] [INFO ] Computation of disable matrix completed :0/204 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:20:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:20:34] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2020-05-12 02:20:34] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t156, t162, t168, t174, i0.i0.u30.t131, i0.i1.u32.t127, i1.u28.t135, i2.t150, i2.u22.t153, i2.u24.t149, i3.i0.t167, i4.u18.t161, i5.u26.t141, i6.i1.t78, i6.i1.u61.t79, i6.i2.t74, i6.i2.u63.t75, i6.i3.t70, i6.i3.u65.t71, i7.t82, i7.u58.t83, i9.i1.t114, i9.i1.u44.t115, i9.i2.t110, i9.i2.u47.t111, i10.u6.t182, i11.i0.t177, i11.i0.u8.t179, i11.i1.t90, i11.i1.u55.t91, i12.i0.t98, i12.i0.u51.t99, i12.i1.t94, i12.i1.u53.t95, i13.i0.t171, i13.i0.u11.t173, i13.i1.t86, i13.i1.u57.t87, i14.i1.t66, i14.i1.u67.t67, i14.i2.t62, i14.i2.u68.t63, i15.t56, i15.t45, i15.t43, i15.t40, i15.t38, i15.t35, i15.t33, i15.t30, i15.t28, i15.t21, i15.t18, i15.t15, i15.t12, i15.t9, i15.t6, i15.u70.t4, i15.u70.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/145/59/204
Computing Next relation with stutter on 41 deadlock states
[2020-05-12 02:20:34] [INFO ] Computing symmetric co enabling matrix : 204 transitions.
117 unique states visited
0 strongly connected components in search stack
180 transitions explored
64 items max in DFS search stack
191 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.94529,84580,1,0,151991,240,3361,211020,206,787,355257
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(i14.i1.u67.p187!=1)")U(X("(i6.i3.u64.p181==1)"))))
Formula 1 simplified : !("(i14.i1.u67.p187!=1)" U X"(i6.i3.u64.p181==1)")
Computing Next relation with stutter on 41 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.98345,86672,1,0,156281,246,3428,214532,206,827,369048
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(X(X((("(((i3.i1.u16.p38==1)&&(i13.i1.u57.p164==1))&&(i15.u72.p200==1))")U(X(F("(((i3.i1.u16.p38==1)&&(i13.i1.u57.p164==1))&&(i15.u72.p200==1))"))))&&(X("(i4.u20.p51==1)"))))))))
Formula 2 simplified : !GFXX(("(((i3.i1.u16.p38==1)&&(i13.i1.u57.p164==1))&&(i15.u72.p200==1))" U XF"(((i3.i1.u16.p38==1)&&(i13.i1.u57.p164==1))&&(i15.u72.p200==1))") & X"(i4.u20.p51==1)")
Computing Next relation with stutter on 41 deadlock states
68 unique states visited
68 strongly connected components in search stack
69 transitions explored
68 items max in DFS search stack
80 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.78945,109916,1,0,202537,250,3491,277510,207,865,444548
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G("(i15.u81.p223!=1)")))U(G(F(G(!(X(X(G(("(i6.i1.u61.p172==1)")U("(i14.i2.u68.p192==1)")))))))))))
Formula 3 simplified : !(!G"(i15.u81.p223!=1)" U GFG!XXG("(i6.i1.u61.p172==1)" U "(i14.i2.u68.p192==1)"))
Computing Next relation with stutter on 41 deadlock states
[2020-05-12 02:20:37] [INFO ] Computation of co-enabling matrix(24/204) took 2369 ms. Total solver calls (SAT/UNSAT): 2153(336/1817)
67 unique states visited
67 strongly connected components in search stack
68 transitions explored
67 items max in DFS search stack
61 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.40568,129248,1,0,245263,250,3516,316077,207,865,514329
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X(F(X(G("(i2.u22.p59==1)"))))))))
Formula 4 simplified : !XFXFXG"(i2.u22.p59==1)"
Computing Next relation with stutter on 41 deadlock states
[2020-05-12 02:20:40] [INFO ] Computation of co-enabling matrix(42/204) took 5375 ms. Total solver calls (SAT/UNSAT): 3237(541/2696)
[2020-05-12 02:20:43] [INFO ] Computation of co-enabling matrix(48/204) took 8401 ms. Total solver calls (SAT/UNSAT): 3552(640/2912)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
724 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6342,367376,1,0,869129,252,3541,743528,207,882,1323085
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X("(i6.i2.u62.p176==1)"))||(!(X(("(i11.i0.u10.p27==1)")U(X("(i6.i2.u62.p176==1)"))))))U("(i14.i2.u69.p195==1)")))
Formula 5 simplified : !((X"(i6.i2.u62.p176==1)" | !X("(i11.i0.u10.p27==1)" U X"(i6.i2.u62.p176==1)")) U "(i14.i2.u69.p195==1)")
Computing Next relation with stutter on 41 deadlock states
63 unique states visited
63 strongly connected components in search stack
63 transitions explored
63 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.8706,375552,1,0,893167,252,3584,759803,208,882,1364304
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G("(i9.i2.u46.p135==1)"))&&("(i11.i0.u9.p24!=1)"))))
Formula 6 simplified : !X("(i11.i0.u9.p24!=1)" & G"(i9.i2.u46.p135==1)")
Computing Next relation with stutter on 41 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.876,375816,1,0,893334,252,3604,760040,208,882,1364801
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((!(X(!(X((X("(i11.i1.u55.p157==1)"))&&("(((i5.u26.p69!=1)||(i12.i1.u53.p153!=1))||(i15.u70.p255!=1))"))))))||(!(X("(i13.i1.u56.p165==1)"))))))
Formula 7 simplified : !G(!X!X("(((i5.u26.p69!=1)||(i12.i1.u53.p153!=1))||(i15.u70.p255!=1))" & X"(i11.i1.u55.p157==1)") | !X"(i13.i1.u56.p165==1)")
Computing Next relation with stutter on 41 deadlock states
69 unique states visited
69 strongly connected components in search stack
70 transitions explored
69 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.8852,376328,1,0,893828,252,3624,760503,208,882,1366315
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(("(i15.u72.p201==1)")U(X(F(("(i9.i2.u47.p132==1)")U(F("(i5.u26.p75==1)"))))))))
Formula 8 simplified : !G("(i15.u72.p201==1)" U XF("(i9.i2.u47.p132==1)" U F"(i5.u26.p75==1)"))
Computing Next relation with stutter on 41 deadlock states
66 unique states visited
66 strongly connected components in search stack
67 transitions explored
66 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0816,382664,1,0,908614,252,3664,771095,208,882,1387356
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((F("(i10.u6.p16==1)"))||("(((i3.i0.u14.p39==1)&&(i7.u58.p168==1))&&(i15.u70.p255==1))"))))
Formula 9 simplified : !F("(((i3.i0.u14.p39==1)&&(i7.u58.p168==1))&&(i15.u70.p255==1))" | F"(i10.u6.p16==1)")
Computing Next relation with stutter on 41 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.2655,390320,1,0,927509,252,3723,786350,208,884,1430623
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 02:20:46] [INFO ] Computation of co-enabling matrix(67/204) took 11475 ms. Total solver calls (SAT/UNSAT): 4337(782/3555)
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-12 02:20:47] [WARNING] Script execution failed on command (assert (>= (select s0 33) 1)) with error (error "Failed to assert expression: java.io.IOException: Stream closed (>= (select s0 33) 1)")
[(assert (>= (select s0 33) 1))]
Skipping mayMatrices nes/nds SMT solver raised an exception.
java.lang.RuntimeException: SMT solver raised an exception.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:477)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 02:20:47] [INFO ] Built C files in 13687ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589250047887

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-158897699100458"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;