fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100506
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.980 192386.00 261874.00 109.20 FFFFTFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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 25K 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 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 91K 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-08-00
FORMULA_NAME BusinessProcesses-PT-08-01
FORMULA_NAME BusinessProcesses-PT-08-02
FORMULA_NAME BusinessProcesses-PT-08-03
FORMULA_NAME BusinessProcesses-PT-08-04
FORMULA_NAME BusinessProcesses-PT-08-05
FORMULA_NAME BusinessProcesses-PT-08-06
FORMULA_NAME BusinessProcesses-PT-08-07
FORMULA_NAME BusinessProcesses-PT-08-08
FORMULA_NAME BusinessProcesses-PT-08-09
FORMULA_NAME BusinessProcesses-PT-08-10
FORMULA_NAME BusinessProcesses-PT-08-11
FORMULA_NAME BusinessProcesses-PT-08-12
FORMULA_NAME BusinessProcesses-PT-08-13
FORMULA_NAME BusinessProcesses-PT-08-14
FORMULA_NAME BusinessProcesses-PT-08-15

=== Now, execution of the tool begins

BK_START 1589251312182

[2020-05-12 02:41:53] [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:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:41:53] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-12 02:41:53] [INFO ] Transformed 393 places.
[2020-05-12 02:41:53] [INFO ] Transformed 344 transitions.
[2020-05-12 02:41:53] [INFO ] Found NUPN structural information;
[2020-05-12 02:41:53] [INFO ] Parsed PT model containing 393 places and 344 transitions in 107 ms.
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 858 resets, run finished after 197 ms. (steps per millisecond=507 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:41:54] [INFO ] Computed 58 place invariants in 11 ms
[2020-05-12 02:41:54] [INFO ] [Real]Absence check using 44 positive place invariants in 62 ms returned sat
[2020-05-12 02:41:54] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2020-05-12 02:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:54] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 17 places in 194 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 28 places in 166 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 16 places in 134 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2020-05-12 02:41:55] [INFO ] Deduced a trap composed of 35 places in 88 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 16 places in 118 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 33 places in 52 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 38 places in 50 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 31 places in 32 ms
[2020-05-12 02:41:56] [INFO ] Deduced a trap composed of 44 places in 45 ms
[2020-05-12 02:41:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1874 ms
[2020-05-12 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 46 ms returned sat
[2020-05-12 02:41:56] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2020-05-12 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:57] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 14 places in 80 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 25 places in 134 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 17 places in 42 ms
[2020-05-12 02:41:57] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 24 places in 51 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 28 places in 203 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 30 places in 63 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 23 places in 276 ms
[2020-05-12 02:41:58] [INFO ] Deduced a trap composed of 26 places in 39 ms
[2020-05-12 02:41:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1906 ms
[2020-05-12 02:41:59] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 24 ms.
[2020-05-12 02:42:00] [INFO ] Added : 226 causal constraints over 46 iterations in 1432 ms. Result :sat
[2020-05-12 02:42:00] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2020-05-12 02:42:00] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:00] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-05-12 02:42:00] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 86 places in 87 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 54 places in 93 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 37 places in 76 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2020-05-12 02:42:01] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 47 places in 85 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 87 places in 79 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 90 places in 89 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2020-05-12 02:42:02] [INFO ] Deduced a trap composed of 30 places in 104 ms
[2020-05-12 02:42:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1736 ms
[2020-05-12 02:42:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:02] [INFO ] [Nat]Absence check using 44 positive place invariants in 43 ms returned sat
[2020-05-12 02:42:02] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:02] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 11 places in 83 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 90 places in 118 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 88 places in 108 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-05-12 02:42:03] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 87 places in 197 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 22 places in 222 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 26 places in 81 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 86 places in 99 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 87 places in 82 ms
[2020-05-12 02:42:04] [INFO ] Deduced a trap composed of 27 places in 103 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 96 places in 77 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 31 places in 87 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 24 places in 90 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 87 places in 263 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 97 places in 80 ms
[2020-05-12 02:42:05] [INFO ] Deduced a trap composed of 44 places in 94 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 63 places in 71 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 94 places in 104 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 95 places in 72 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 46 places in 65 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 96 places in 188 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 65 places in 67 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2020-05-12 02:42:06] [INFO ] Deduced a trap composed of 89 places in 89 ms
[2020-05-12 02:42:07] [INFO ] Deduced a trap composed of 65 places in 74 ms
[2020-05-12 02:42:07] [INFO ] Deduced a trap composed of 94 places in 78 ms
[2020-05-12 02:42:07] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 4179 ms
[2020-05-12 02:42:07] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 13 ms.
[2020-05-12 02:42:08] [INFO ] Added : 233 causal constraints over 47 iterations in 1171 ms. Result :sat
[2020-05-12 02:42:08] [INFO ] [Real]Absence check using 44 positive place invariants in 27 ms returned sat
[2020-05-12 02:42:08] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:08] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2020-05-12 02:42:08] [INFO ] Deduced a trap composed of 11 places in 77 ms
[2020-05-12 02:42:08] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-05-12 02:42:08] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 19 places in 92 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 86 places in 91 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 37 places in 91 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 19 places in 70 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2020-05-12 02:42:09] [INFO ] Deduced a trap composed of 47 places in 70 ms
[2020-05-12 02:42:10] [INFO ] Deduced a trap composed of 87 places in 85 ms
[2020-05-12 02:42:10] [INFO ] Deduced a trap composed of 90 places in 124 ms
[2020-05-12 02:42:10] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-05-12 02:42:10] [INFO ] Deduced a trap composed of 34 places in 114 ms
[2020-05-12 02:42:10] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-05-12 02:42:10] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1724 ms
[2020-05-12 02:42:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 60 ms returned sat
[2020-05-12 02:42:10] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:10] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 30 places in 64 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 16 places in 36 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2020-05-12 02:42:11] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-05-12 02:42:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 522 ms
[2020-05-12 02:42:11] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 38 ms.
[2020-05-12 02:42:13] [INFO ] Added : 223 causal constraints over 45 iterations in 2212 ms. Result :sat
[2020-05-12 02:42:13] [INFO ] [Real]Absence check using 44 positive place invariants in 49 ms returned sat
[2020-05-12 02:42:13] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:14] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 11 places in 74 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 22 places in 66 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-05-12 02:42:14] [INFO ] Deduced a trap composed of 13 places in 48 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 26 places in 46 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 32 places in 48 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 23 places in 56 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 23 places in 40 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 25 places in 27 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 59 places in 63 ms
[2020-05-12 02:42:15] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 58 places in 60 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 55 places in 46 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 43 places in 34 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 49 places in 45 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 37 places in 43 ms
[2020-05-12 02:42:16] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2018 ms
[2020-05-12 02:42:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:16] [INFO ] [Nat]Absence check using 44 positive place invariants in 30 ms returned sat
[2020-05-12 02:42:16] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2020-05-12 02:42:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:16] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-05-12 02:42:16] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 22 places in 51 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 23 places in 57 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 38 places in 47 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 40 places in 61 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 39 places in 56 ms
[2020-05-12 02:42:17] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2020-05-12 02:42:20] [INFO ] Deduced a trap composed of 40 places in 2136 ms
[2020-05-12 02:42:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3464 ms
[2020-05-12 02:42:20] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 20 ms.
[2020-05-12 02:42:21] [INFO ] Added : 206 causal constraints over 42 iterations in 1679 ms. Result :sat
[2020-05-12 02:42:21] [INFO ] Deduced a trap composed of 59 places in 65 ms
[2020-05-12 02:42:22] [INFO ] Deduced a trap composed of 55 places in 64 ms
[2020-05-12 02:42:22] [INFO ] Deduced a trap composed of 62 places in 90 ms
[2020-05-12 02:42:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 391 ms
[2020-05-12 02:42:22] [INFO ] [Real]Absence check using 44 positive place invariants in 92 ms returned sat
[2020-05-12 02:42:22] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:22] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2020-05-12 02:42:23] [INFO ] Deduced a trap composed of 13 places in 929 ms
[2020-05-12 02:42:24] [INFO ] Deduced a trap composed of 8 places in 593 ms
[2020-05-12 02:42:24] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2020-05-12 02:42:24] [INFO ] Deduced a trap composed of 14 places in 237 ms
[2020-05-12 02:42:24] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-05-12 02:42:24] [INFO ] Deduced a trap composed of 88 places in 77 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 85 places in 138 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 95 places in 361 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 24 places in 68 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 84 places in 95 ms
[2020-05-12 02:42:25] [INFO ] Deduced a trap composed of 24 places in 183 ms
[2020-05-12 02:42:26] [INFO ] Deduced a trap composed of 40 places in 284 ms
[2020-05-12 02:42:27] [INFO ] Deduced a trap composed of 97 places in 909 ms
[2020-05-12 02:42:27] [INFO ] Deduced a trap composed of 93 places in 136 ms
[2020-05-12 02:42:27] [INFO ] Deduced a trap composed of 46 places in 164 ms
[2020-05-12 02:42:27] [INFO ] Deduced a trap composed of 94 places in 87 ms
[2020-05-12 02:42:28] [INFO ] Deduced a trap composed of 91 places in 451 ms
[2020-05-12 02:42:28] [INFO ] Deduced a trap composed of 90 places in 90 ms
[2020-05-12 02:42:29] [INFO ] Deduced a trap composed of 95 places in 1062 ms
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 95 places in 2834 ms
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 16 places in 29 ms
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2020-05-12 02:42:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9565 ms
[2020-05-12 02:42:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:42:32] [INFO ] [Nat]Absence check using 44 positive place invariants in 28 ms returned sat
[2020-05-12 02:42:32] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:42:32] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 8 places in 86 ms
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 17 places in 69 ms
[2020-05-12 02:42:32] [INFO ] Deduced a trap composed of 34 places in 190 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 47 places in 73 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 88 places in 66 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 45 places in 63 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 48 places in 77 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 33 places in 78 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 91 places in 76 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 92 places in 75 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 43 places in 72 ms
[2020-05-12 02:42:33] [INFO ] Deduced a trap composed of 85 places in 92 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 95 places in 117 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 51 places in 83 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 28 places in 50 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 11 places in 39 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 28 places in 52 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 54 places in 45 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2020-05-12 02:42:34] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2020-05-12 02:42:34] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2215 ms
[2020-05-12 02:42:34] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 13 ms.
[2020-05-12 02:42:35] [INFO ] Added : 205 causal constraints over 42 iterations in 935 ms. Result :sat
[2020-05-12 02:42:36] [INFO ] Flatten gal took : 74 ms
[2020-05-12 02:42:36] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:42:36] [INFO ] Applying decomposition
[2020-05-12 02:42:36] [INFO ] Flatten gal took : 44 ms
[2020-05-12 02:42:36] [INFO ] Input system was already deterministic with 331 transitions.
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/graph7430411007788239255.txt, -o, /tmp/graph7430411007788239255.bin, -w, /tmp/graph7430411007788239255.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:42:36] [INFO ] Computed 58 place invariants in 8 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p25 + p26 + p301 + p302 + p303 + p304 + p307 + p308 + p309 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p93 + p94 + p95 + p368 + p369 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p41 + p42 + p43 + p323 + p324 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p99 + p100 + p101 + p372 + p373 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p384 + p385 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p234 + p235 + p236 + p237 + p238 = 1
inv : p21 + p22 + p23 + p24 + p27 + p28 - p301 - p302 - p303 - p304 - p307 - p308 - p309 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p364 + p365 = 1
inv : p102 + p103 + p104 - p372 - p373 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p184 + p186 + p187 + p188 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p346 + p347 = 1
inv : p0 + p1 + p2 + p3 + p4 + p134 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p264 + p265 + p266 + p267 + p268 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p244 + p245 + p246 + p247 + p248 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p254 + p255 + p256 + p257 + p258 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p199 + p200 + p201 + p202 + p203 = 1
inv : p35 + p36 + p39 + p40 - p314 - p315 - p318 - p319 - p320 = 0
inv : p91 + p92 - p364 - p365 = 0
inv : p44 + p45 + p46 - p323 - p324 = 0
inv : p0 + p289 + p290 + p291 + p292 + p293 + p294 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p179 + p181 + p182 + p183 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p120 + p121 + p122 + p388 + p389 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p29 + p30 + p31 + p312 + p313 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p354 + p355 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p130 = 1
inv : p0 + p1 + p146 + p147 + p148 + p274 + p275 + p276 + p277 + p278 = 1
inv : p71 + p72 - p346 - p347 = 0
inv : p0 + p1 + p2 + p142 + p143 + p144 + p145 = 1
inv : p61 + p62 + p63 - p338 - p339 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p209 + p210 + p211 + p212 + p213 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p34 + p37 + p38 + p314 + p315 + p318 + p319 + p320 = 1
inv : p0 + p48 + p49 + p50 + p51 + p52 + p53 + p56 + p57 + p289 + p290 + p291 + p292 + p293 + p294 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p331 + p332 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 = 1
inv : p0 + p1 + p146 + p147 + p279 + p280 + p281 + p282 + p283 = 1
inv : p108 + p109 + p110 - p376 - p377 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p105 + p106 + p107 + p376 + p377 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p224 + p225 + p226 + p227 + p228 = 1
inv : p80 + p81 - p354 - p355 = 0
inv : p0 + p1 + p146 + p284 + p285 + p286 + p287 + p288 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p194 + p195 + p196 + p197 + p198 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p204 + p205 + p206 + p207 + p208 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p126 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p259 + p260 + p261 + p262 + p263 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p174 + p175 + p176 + p177 + p178 = 1
inv : p96 + p97 + p98 - p368 - p369 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p47 + p54 + p55 - p289 - p290 - p291 - p292 - p293 - p294 - p296 - p297 - p298 - p299 - p300 - p301 - p302 - p303 - p304 - p305 - p306 - p307 - p308 - p309 - p310 - p311 - p312 - p313 - p314 - p315 - p316 - p317 - p318 - p319 - p320 - p321 - p322 - p323 - p324 - p331 - p332 - p336 - p337 - p338 - p339 - p340 - p341 - p342 - p343 - p344 - p345 - p346 - p347 - p348 - p349 - p350 - p351 - p352 - p353 - p354 - p355 - p356 - p357 - p358 - p359 - p360 - p361 - p362 - p363 - p364 - p365 - p366 - p367 - p368 - p369 - p370 - p371 - p372 - p373 - p374 - p375 - p376 - p377 - p378 - p379 - p380 - p381 - p382 - p383 - p384 - p385 - p386 - p387 - p388 - p389 - p390 - p391 - p392 = 0
inv : p123 + p124 + p125 - p388 - p389 = 0
inv : p118 + p119 - p384 - p385 = 0
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p219 + p220 + p221 + p222 + p223 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p229 + p230 + p231 + p232 + p233 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p269 + p270 + p271 + p272 + p273 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p239 + p240 + p241 + p242 + p243 = 1
inv : p32 + p33 - p312 - p313 = 0
inv : p0 + p1 + p2 + p3 + p138 + p139 + p140 + p141 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p58 + p59 + p60 + p338 + p339 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p214 + p215 + p216 + p217 + p218 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p189 + p191 + p192 + p193 = 1
inv : p0 + p1 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p249 + p250 + p251 + p252 + p253 = 1
Total of 58 invariants.
[2020-05-12 02:42:36] [INFO ] Computed 58 place invariants in 9 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7430411007788239255.bin, -l, -1, -v, -w, /tmp/graph7430411007788239255.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:42:36] [INFO ] Decomposing Gal with order
[2020-05-12 02:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:42:36] [INFO ] Removed a total of 83 redundant transitions.
[2020-05-12 02:42:36] [INFO ] Flatten gal took : 101 ms
[2020-05-12 02:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-12 02:42:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
[2020-05-12 02:42:36] [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 16 LTL properties
Checking formula 0 : !(((X(!(X("(i17.u119.p311==1)"))))&&(G("(((i15.i1.u50.p118!=1)||(i15.i2.u103.p267!=1))||(i15.i1.u155.p384!=1))"))))
Formula 0 simplified : !(X!X"(i17.u119.p311==1)" & G"(((i15.i1.u50.p118!=1)||(i15.i2.u103.p267!=1))||(i15.i1.u155.p384!=1))")
built 53 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 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 14 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 53 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 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 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-12 02:42:37] [INFO ] Proved 380 variables to be positive in 875 ms
[2020-05-12 02:42:37] [INFO ] Computing symmetric may disable matrix : 331 transitions.
[2020-05-12 02:42:37] [INFO ] Computation of disable matrix completed :0/331 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:37] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:37] [INFO ] Computing symmetric may enable matrix : 331 transitions.
[2020-05-12 02:42:37] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:42:41] [INFO ] Computing symmetric co enabling matrix : 331 transitions.
[2020-05-12 02:42:42] [INFO ] Computation of co-enabling matrix(0/331) took 102 ms. Total solver calls (SAT/UNSAT): 303(0/303)
[2020-05-12 02:42:45] [INFO ] Computation of co-enabling matrix(22/331) took 3209 ms. Total solver calls (SAT/UNSAT): 3615(360/3255)
Reverse transition relation is NOT exact ! Due to transitions t203, t277, i0.i1.u53.t193, i0.i2.t96, i0.i2.u111.t97, i1.i0.u51.t206, i1.i1.t100, i1.i1.u109.t101, i2.u41.t226, i2.u43.t222, i3.i0.u17.t274, i3.i0.u19.t270, i3.i1.t276, i3.i1.u18.t272, i3.i2.t160, i3.i2.u78.t161, i4.t266, i4.t264, i4.t262, i4.u24.t260, i4.u25.t258, i5.u26.t256, i6.i0.t248, i6.i0.t250, i6.i0.u28.t252, i6.i1.t144, i6.i1.u86.t145, i7.t234, i7.t232, i7.t230, i7.u36.t236, i8.i1.t140, i8.i1.u89.t141, i8.i2.t136, i8.i2.u91.t137, i8.i3.t132, i8.i3.u93.t133, i8.i4.t128, i8.i4.u95.t129, i9.i1.t164, i9.i1.u77.t165, i9.i2.t156, i9.i2.u81.t157, i9.i3.t152, i9.i3.u82.t153, i10.i0.t187, i10.i0.u67.t188, i10.i2.t184, i10.i2.u69.t185, i11.i1.t168, i11.i1.u75.t169, i12.i0.u14.t280, i12.i1.t148, i12.i1.u85.t149, i12.i2.t108, i12.i2.u104.t109, i13.t242, i13.t240, i13.u32.t244, i14.i1.t124, i14.i1.u97.t125, i14.i2.t120, i14.i2.u98.t121, i14.i3.t116, i14.i3.u100.t117, i14.i4.t104, i14.i4.u107.t105, i15.i0.u45.t218, i15.i1.t210, i15.i1.t212, i15.i1.u47.t214, i15.i2.t112, i15.i2.u103.t113, i16.t63, i16.u121.t67, i17.t80, i17.t74, i17.t70, i17.t65, i17.t61, i17.t52, i17.t48, i17.t45, i17.t43, i17.t41, i17.t38, i17.t36, i17.t34, i17.t31, i17.t29, i17.t27, i17.t25, i17.t22, i17.t19, i17.t16, i17.t13, i17.t11, i17.t9, i17.t6, i17.t3, i17.u112.t1, i18.i0.t285, i18.i0.t287, i18.i0.u12.t283, i18.i0.u13.t281, i18.i1.t72, i18.i1.t76, i18.i1.u115.t78, i19.t56, i19.t54, i19.t50, i19.u126.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/219/112/331
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:42:48] [INFO ] Computation of co-enabling matrix(37/331) took 6266 ms. Total solver calls (SAT/UNSAT): 5596(607/4989)
[2020-05-12 02:42:51] [INFO ] Computation of co-enabling matrix(62/331) took 9283 ms. Total solver calls (SAT/UNSAT): 8194(860/7334)
96 unique states visited
96 strongly connected components in search stack
97 transitions explored
96 items max in DFS search stack
1711 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,17.1554,477672,1,0,885833,599,5138,1.62747e+06,256,1296,1991006
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("(i7.u40.p92==1)"))||((X(!(G(X("(i15.i0.u46.p110==1)")))))&&(F(("(i17.u112.p293==1)")U("(i19.u126.p325==1)"))))))
Formula 1 simplified : !(G"(i7.u40.p92==1)" | (X!GX"(i15.i0.u46.p110==1)" & F("(i17.u112.p293==1)" U "(i19.u126.p325==1)")))
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:42:54] [INFO ] Computation of co-enabling matrix(97/331) took 12310 ms. Total solver calls (SAT/UNSAT): 11198(1311/9887)
[2020-05-12 02:42:57] [INFO ] Computation of co-enabling matrix(191/331) took 15341 ms. Total solver calls (SAT/UNSAT): 13180(1340/11840)
5 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
370 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,20.8459,553444,1,0,982816,601,5197,1.88176e+06,258,1307,2185138
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(("(i0.i0.u2.p4==1)")U(G(X(G(("(i17.u154.p382==1)")U("(i0.i2.u110.p284==1)"))))))))))
Formula 2 simplified : !FGX("(i0.i0.u2.p4==1)" U GXG("(i17.u154.p382==1)" U "(i0.i2.u110.p284==1)"))
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:43:00] [INFO ] Computation of co-enabling matrix(279/331) took 18353 ms. Total solver calls (SAT/UNSAT): 14849(1694/13155)
96 unique states visited
94 strongly connected components in search stack
98 transitions explored
96 items max in DFS search stack
513 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,25.9858,646344,1,0,1.09426e+06,601,5319,2.23559e+06,258,1311,2404339
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X((F("(i17.u113.p298==1)"))U(G(F("(i17.u113.p298==1)")))))U((("(i17.u142.p359==1)")U("(i15.i1.u49.p116==1)"))||(F("(((i0.i1.u53.p138==1)&&(i11.i1.u75.p196==1))&&(i17.u112.p392==1))")))))
Formula 3 simplified : !(X(F"(i17.u113.p298==1)" U GF"(i17.u113.p298==1)") U (("(i17.u142.p359==1)" U "(i15.i1.u49.p116==1)") | F"(((i0.i1.u53.p138==1)&&(i11.i1.u75.p196==1))&&(i17.u112.p392==1))"))
Computing Next relation with stutter on 26 deadlock states
[2020-05-12 02:43:03] [INFO ] Computation of co-enabling matrix(326/331) took 21382 ms. Total solver calls (SAT/UNSAT): 15839(1940/13899)
[2020-05-12 02:43:03] [INFO ] Computation of Finished co-enabling matrix. took 21565 ms. Total solver calls (SAT/UNSAT): 15845(1943/13902)
[2020-05-12 02:43:03] [INFO ] Computing Do-Not-Accords matrix : 331 transitions.
[2020-05-12 02:43:03] [INFO ] Computation of Completed DNA matrix. took 106 ms. Total solver calls (SAT/UNSAT): 65(0/65)
[2020-05-12 02:43:03] [INFO ] Built C files in 27463ms 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]
Compilation finished in 3259 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (X((<>((LTLAP9==true)))U([](<>((LTLAP9==true))))))U(( ((LTLAP10==true))U((LTLAP11==true))) || ( <>((LTLAP12==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (X((<>((LTLAP9==true)))U([](<>((LTLAP9==true))))))U(( ((LTLAP10==true))U((LTLAP11==true))) || ( <>((LTLAP12==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (X((<>((LTLAP9==true)))U([](<>((LTLAP9==true))))))U(( ((LTLAP10==true))U((LTLAP11==true))) || ( <>((LTLAP12==true))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
94 unique states visited
94 strongly connected components in search stack
94 transitions explored
94 items max in DFS search stack
5598 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,81.9608,1706972,1,0,2.45038e+06,650,5395,3.85933e+06,259,1675,5649385
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X((("(i11.i0.u65.p166==1)")U("(i17.u119.p310==1)"))||(!(F((F(G("(i17.u135.p344==1)")))&&("(i11.i0.u65.p166==1)")))))))))
Formula 4 simplified : !XFX(("(i11.i0.u65.p166==1)" U "(i17.u119.p310==1)") | !F("(i11.i0.u65.p166==1)" & FG"(i17.u135.p344==1)"))
Computing Next relation with stutter on 26 deadlock states
94 unique states visited
0 strongly connected components in search stack
94 transitions explored
94 items max in DFS search stack
149 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,83.4565,1756076,1,0,2.53957e+06,659,5449,3.9499e+06,259,1717,5901719
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-08-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(X((X(X(!(G("(((i15.i1.u50.p118==1)&&(i15.i2.u103.p267==1))&&(i15.i1.u155.p384==1))")))))||("(((i15.i1.u50.p118==1)&&(i15.i2.u103.p267==1))&&(i15.i1.u155.p384==1))"))))))
Formula 5 simplified : GX("(((i15.i1.u50.p118==1)&&(i15.i2.u103.p267==1))&&(i15.i1.u155.p384==1))" | XX!G"(((i15.i1.u50.p118==1)&&(i15.i2.u103.p267==1))&&(i15.i1.u155.p384==1))")
Computing Next relation with stutter on 26 deadlock states
10 unique states visited
8 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
29 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,83.7542,1765052,1,0,2.55776e+06,659,5485,3.97931e+06,259,1724,5950873
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G(("(((i15.i0.u46.p108!=1)||(i14.i2.u98.p257!=1))||(i15.i0.u151.p376!=1))")U(G(("(i0.i2.u110.p288==1)")U(F("(((i15.i0.u46.p108==1)&&(i14.i2.u98.p257==1))&&(i15.i0.u151.p376==1))"))))))U((G("(((i15.i0.u46.p108==1)&&(i14.i2.u98.p257==1))&&(i15.i0.u151.p376==1))"))&&("(i4.u22.p51==1)")))))
Formula 6 simplified : !X(G("(((i15.i0.u46.p108!=1)||(i14.i2.u98.p257!=1))||(i15.i0.u151.p376!=1))" U G("(i0.i2.u110.p288==1)" U F"(((i15.i0.u46.p108==1)&&(i14.i2.u98.p257==1))&&(i15.i0.u151.p376==1))")) U ("(i4.u22.p51==1)" & G"(((i15.i0.u46.p108==1)&&(i14.i2.u98.p257==1))&&(i15.i0.u151.p376==1))"))
Computing Next relation with stutter on 26 deadlock states
94 unique states visited
94 strongly connected components in search stack
94 transitions explored
94 items max in DFS search stack
576 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,89.5082,1903384,1,0,2.75324e+06,659,5553,4.39599e+06,259,1724,6468603
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((G("(i9.i2.u80.p209==1)"))&&(("(i6.i1.u86.p225==1)")U("(i18.i0.u11.p24==1)")))))
Formula 7 simplified : !X(G"(i9.i2.u80.p209==1)" & ("(i6.i1.u86.p225==1)" U "(i18.i0.u11.p24==1)"))
Computing Next relation with stutter on 26 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 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,89.5128,1903648,1,0,2.75326e+06,659,5586,4.39604e+06,259,1724,6468808
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F("(((i19.u127.p328==1)&&(i3.i0.u125.p324==1))||(i19.u127.p328!=1))"))&&(G(X(G(!(X("(i19.u127.p328==1)")))))))))
Formula 8 simplified : !X(F"(((i19.u127.p328==1)&&(i3.i0.u125.p324==1))||(i19.u127.p328!=1))" & GXG!X"(i19.u127.p328==1)")
Computing Next relation with stutter on 26 deadlock states
97 unique states visited
97 strongly connected components in search stack
98 transitions explored
97 items max in DFS search stack
28 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,89.7936,1914208,1,0,2.78604e+06,659,5599,4.41325e+06,259,1724,6532069
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((F(X(("(i9.i0.u63.p161==1)")U(F("(i7.u37.p85==1)")))))U((!(("(i9.i0.u63.p161==1)")U("(((i3.i0.u19.p41==1)&&(i9.i2.u81.p211==1))&&(i17.u112.p392==1))")))U("(((i3.i0.u19.p41==1)&&(i9.i2.u81.p211==1))&&(i17.u112.p392==1))")))))
Formula 9 simplified : FX("(i9.i0.u63.p161==1)" U F"(i7.u37.p85==1)") U (!("(i9.i0.u63.p161==1)" U "(((i3.i0.u19.p41==1)&&(i9.i2.u81.p211==1))&&(i17.u112.p392==1))") U "(((i3.i0.u19.p41==1)&&(i9.i2.u81.p211==1))&&(i17.u112.p392==1))")
Computing Next relation with stutter on 26 deadlock states
70 unique states visited
70 strongly connected components in search stack
71 transitions explored
70 items max in DFS search stack
639 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,96.1895,2122548,1,0,3.16702e+06,664,5684,4.7713e+06,259,1802,7473201
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((("((i18.i1.u115.p302==1)||(((i15.i1.u47.p111==1)&&(i10.i2.u69.p176==1))&&(i17.u112.p392==1)))")U(X("(((i15.i1.u47.p111==1)&&(i10.i2.u69.p176==1))&&(i17.u112.p392==1))")))U("(i3.i0.u20.p45==1)"))))
Formula 10 simplified : !F(("((i18.i1.u115.p302==1)||(((i15.i1.u47.p111==1)&&(i10.i2.u69.p176==1))&&(i17.u112.p392==1)))" U X"(((i15.i1.u47.p111==1)&&(i10.i2.u69.p176==1))&&(i17.u112.p392==1))") U "(i3.i0.u20.p45==1)")
Computing Next relation with stutter on 26 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
350 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,99.6858,2190924,1,0,3.25751e+06,664,5739,4.94702e+06,259,1802,7704028
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("(i19.u130.p334==1)"))&&(X("((i19.u130.p334==1)||(i17.u142.p359!=1))"))))
Formula 11 simplified : !(F"(i19.u130.p334==1)" & X"((i19.u130.p334==1)||(i17.u142.p359!=1))")
Computing Next relation with stutter on 26 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1294 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,112.63,2200164,1,0,3.27022e+06,664,1715,4.96754e+06,112,1802,277458
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F(G(X("(i10.i1.u71.p183==1)")))))))
Formula 12 simplified : !XGFGX"(i10.i1.u71.p183==1)"
Computing Next relation with stutter on 26 deadlock states
95 unique states visited
94 strongly connected components in search stack
96 transitions explored
95 items max in DFS search stack
900 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,121.631,2200164,1,0,3.27022e+06,664,3032,4.96754e+06,156,1802,1012153
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((G(F("(i18.i0.u11.p23==1)")))&&("(i5.u7.p13==1)"))))
Formula 13 simplified : !X("(i5.u7.p13==1)" & GF"(i18.i0.u11.p23==1)")
Computing Next relation with stutter on 26 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,121.635,2200164,1,0,3.27022e+06,664,3050,4.96754e+06,157,1802,1013055
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(!(X(F("(i0.i1.u53.p139==1)")))))U(!(X("(i3.i0.u17.p38!=1)")))))
Formula 14 simplified : !(X!XF"(i0.i1.u53.p139==1)" U !X"(i3.i0.u17.p38!=1)")
Computing Next relation with stutter on 26 deadlock states
94 unique states visited
94 strongly connected components in search stack
94 transitions explored
94 items max in DFS search stack
2167 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,143.311,2200164,1,0,3.27022e+06,664,3170,4.96754e+06,159,1802,1868925
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(F((X("(i17.u112.p289==1)"))U("(i15.i0.u46.p110==1)")))))
Formula 15 simplified : !XF(X"(i17.u112.p289==1)" U "(i15.i0.u46.p110==1)")
Computing Next relation with stutter on 26 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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,143.477,2200164,1,0,3.27022e+06,664,3192,4.96754e+06,159,1802,1891356
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589251504568

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

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