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

About the Execution of ITS-LoLa for BusinessProcesses-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15790.250 3600000.00 3940650.00 6537.40 ?FFFT?FFFFFFTFFF 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.r182-oct2-158987913900466.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 itslola
Input is BusinessProcesses-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K 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-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1591156680439

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:58:01] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:58:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:58:01] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-03 03:58:01] [INFO ] Transformed 274 places.
[2020-06-03 03:58:01] [INFO ] Transformed 237 transitions.
[2020-06-03 03:58:01] [INFO ] Found NUPN structural information;
[2020-06-03 03:58:01] [INFO ] Parsed PT model containing 274 places and 237 transitions in 83 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1195 resets, run finished after 231 ms. (steps per millisecond=432 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-06-03 03:58:02] [INFO ] Computed 43 place invariants in 13 ms
[2020-06-03 03:58:02] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2020-06-03 03:58:02] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:02] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 03:58:02] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2020-06-03 03:58:02] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-03 03:58:02] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-06-03 03:58:02] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 11 places in 28 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 28 places in 23 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 24 places in 27 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-06-03 03:58:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 730 ms
[2020-06-03 03:58:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 54 ms returned sat
[2020-06-03 03:58:03] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:03] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-06-03 03:58:03] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 24 places in 33 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 12 places in 23 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 19 places in 24 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 23 places in 23 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 40 places in 21 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 24 places in 23 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 34 places in 22 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 14 places in 21 ms
[2020-06-03 03:58:04] [INFO ] Deduced a trap composed of 42 places in 34 ms
[2020-06-03 03:58:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 794 ms
[2020-06-03 03:58:04] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 14 ms.
[2020-06-03 03:58:05] [INFO ] Added : 154 causal constraints over 31 iterations in 563 ms. Result :sat
[2020-06-03 03:58:05] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2020-06-03 03:58:05] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:05] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2020-06-03 03:58:05] [INFO ] Deduced a trap composed of 11 places in 325 ms
[2020-06-03 03:58:05] [INFO ] Deduced a trap composed of 12 places in 138 ms
[2020-06-03 03:58:05] [INFO ] Deduced a trap composed of 15 places in 117 ms
[2020-06-03 03:58:05] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 11 places in 430 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 14 places in 29 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 33 places in 25 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 19 places in 39 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 12 places in 28 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 28 places in 42 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 24 places in 35 ms
[2020-06-03 03:58:06] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2020-06-03 03:58:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1574 ms
[2020-06-03 03:58:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 54 ms returned sat
[2020-06-03 03:58:06] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-06-03 03:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:07] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 14 places in 64 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 15 places in 21 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 24 places in 27 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 32 places in 22 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 37 places in 21 ms
[2020-06-03 03:58:07] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2020-06-03 03:58:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 614 ms
[2020-06-03 03:58:07] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 8 ms.
[2020-06-03 03:58:08] [INFO ] Added : 156 causal constraints over 32 iterations in 537 ms. Result :sat
[2020-06-03 03:58:08] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:08] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:08] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 03:58:08] [INFO ] Deduced a trap composed of 14 places in 72 ms
[2020-06-03 03:58:08] [INFO ] Deduced a trap composed of 13 places in 66 ms
[2020-06-03 03:58:08] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-06-03 03:58:08] [INFO ] Deduced a trap composed of 71 places in 73 ms
[2020-06-03 03:58:08] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 18 places in 59 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 46 places in 82 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-06-03 03:58:09] [INFO ] Deduced a trap composed of 70 places in 79 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 74 places in 97 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 70 places in 53 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 70 places in 84 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 78 places in 53 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 75 places in 49 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 74 places in 130 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 43 places in 51 ms
[2020-06-03 03:58:10] [INFO ] Deduced a trap composed of 76 places in 61 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 75 places in 49 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 86 places in 48 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 70 places in 47 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 72 places in 47 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 75 places in 48 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 73 places in 46 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 73 places in 45 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 67 places in 43 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 68 places in 44 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 73 places in 57 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 75 places in 44 ms
[2020-06-03 03:58:11] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2020-06-03 03:58:11] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 3112 ms
[2020-06-03 03:58:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:58:11] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2020-06-03 03:58:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:11] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 14 places in 64 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 13 places in 57 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 71 places in 56 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 78 places in 56 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 78 places in 55 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 32 places in 73 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 33 places in 54 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 73 places in 59 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-06-03 03:58:12] [INFO ] Deduced a trap composed of 35 places in 50 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 78 places in 49 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 51 places in 51 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 44 places in 51 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 41 places in 47 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 69 places in 44 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 71 places in 59 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 75 places in 57 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 71 places in 47 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 70 places in 60 ms
[2020-06-03 03:58:13] [INFO ] Deduced a trap composed of 71 places in 47 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 71 places in 71 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 71 places in 45 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 70 places in 46 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 71 places in 46 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 74 places in 48 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 72 places in 48 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 70 places in 45 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 74 places in 45 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 73 places in 42 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 72 places in 47 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 72 places in 43 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 70 places in 62 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 29 places in 62 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-06-03 03:58:14] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2020-06-03 03:58:14] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 2944 ms
[2020-06-03 03:58:14] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 12 ms.
[2020-06-03 03:58:15] [INFO ] Added : 139 causal constraints over 28 iterations in 452 ms. Result :sat
[2020-06-03 03:58:15] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:15] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2020-06-03 03:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:15] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 14 places in 36 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 21 places in 36 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 14 places in 36 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 27 places in 34 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 35 places in 33 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 24 places in 29 ms
[2020-06-03 03:58:15] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 41 places in 26 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 35 places in 24 ms
[2020-06-03 03:58:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 533 ms
[2020-06-03 03:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:58:16] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:16] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 14 places in 54 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 27 places in 48 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 23 places in 28 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 20 places in 29 ms
[2020-06-03 03:58:16] [INFO ] Deduced a trap composed of 41 places in 26 ms
[2020-06-03 03:58:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 559 ms
[2020-06-03 03:58:16] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 10 ms.
[2020-06-03 03:58:17] [INFO ] Added : 134 causal constraints over 28 iterations in 412 ms. Result :sat
[2020-06-03 03:58:17] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:17] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 24 places in 33 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 34 places in 37 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 03:58:17] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 37 places in 29 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 33 places in 26 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 31 places in 30 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 27 places in 29 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 36 places in 27 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 20 places in 30 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 41 places in 27 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 33 places in 19 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 39 places in 18 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 29 places in 19 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 42 places in 24 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 38 places in 19 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 44 places in 23 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 39 places in 17 ms
[2020-06-03 03:58:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1006 ms
[2020-06-03 03:58:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:58:18] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:18] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 27 places in 40 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-06-03 03:58:18] [INFO ] Deduced a trap composed of 24 places in 32 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 34 places in 34 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 37 places in 32 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 37 places in 31 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 31 places in 28 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 27 places in 33 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 36 places in 28 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 20 places in 28 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 41 places in 27 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 33 places in 19 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 39 places in 18 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 29 places in 21 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 44 places in 22 ms
[2020-06-03 03:58:19] [INFO ] Deduced a trap composed of 39 places in 17 ms
[2020-06-03 03:58:19] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1029 ms
[2020-06-03 03:58:19] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 15 ms.
[2020-06-03 03:58:20] [INFO ] Added : 137 causal constraints over 28 iterations in 411 ms. Result :sat
[2020-06-03 03:58:20] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:20] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:20] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 11 places in 37 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 19 places in 37 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 32 places in 30 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 22 places in 27 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 25 places in 30 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 28 places in 26 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 28 places in 25 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2020-06-03 03:58:20] [INFO ] Deduced a trap composed of 28 places in 23 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 34 places in 21 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 35 places in 22 ms
[2020-06-03 03:58:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 591 ms
[2020-06-03 03:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2020-06-03 03:58:21] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:21] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 11 places in 43 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 19 places in 45 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 22 places in 41 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 25 places in 43 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 20 places in 41 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 28 places in 27 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 28 places in 39 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2020-06-03 03:58:21] [INFO ] Deduced a trap composed of 35 places in 40 ms
[2020-06-03 03:58:22] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2020-06-03 03:58:22] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2020-06-03 03:58:22] [INFO ] Deduced a trap composed of 35 places in 23 ms
[2020-06-03 03:58:22] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 829 ms
[2020-06-03 03:58:22] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 12 ms.
[2020-06-03 03:58:22] [INFO ] Added : 144 causal constraints over 29 iterations in 505 ms. Result :sat
[2020-06-03 03:58:22] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2020-06-03 03:58:22] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:22] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-03 03:58:22] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 24 places in 47 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 34 places in 45 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 37 places in 37 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 37 places in 29 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 33 places in 58 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 31 places in 36 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 36 places in 34 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 41 places in 46 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2020-06-03 03:58:23] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 39 places in 28 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 42 places in 35 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 38 places in 31 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 44 places in 58 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 39 places in 17 ms
[2020-06-03 03:58:24] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1311 ms
[2020-06-03 03:58:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2020-06-03 03:58:24] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2020-06-03 03:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:24] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-06-03 03:58:24] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 37 places in 53 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 33 places in 41 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 34 places in 28 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 27 places in 34 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 20 places in 34 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 41 places in 27 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 39 places in 25 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 42 places in 30 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 38 places in 51 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 44 places in 39 ms
[2020-06-03 03:58:25] [INFO ] Deduced a trap composed of 39 places in 27 ms
[2020-06-03 03:58:25] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1310 ms
[2020-06-03 03:58:25] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2020-06-03 03:58:26] [INFO ] Added : 137 causal constraints over 28 iterations in 522 ms. Result :sat
[2020-06-03 03:58:26] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 03:58:26] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:26] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 03:58:26] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-06-03 03:58:26] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2020-06-03 03:58:26] [INFO ] Deduced a trap composed of 18 places in 56 ms
[2020-06-03 03:58:26] [INFO ] Deduced a trap composed of 66 places in 69 ms
[2020-06-03 03:58:26] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 45 places in 42 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 16 places in 35 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 26 places in 32 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 31 places in 36 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 42 places in 28 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 23 places in 38 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 38 places in 31 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 45 places in 43 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 13 places in 48 ms
[2020-06-03 03:58:27] [INFO ] Deduced a trap composed of 42 places in 50 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 36 places in 41 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 44 places in 37 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 50 places in 26 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 41 places in 33 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 43 places in 35 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 46 places in 35 ms
[2020-06-03 03:58:28] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 2073 ms
[2020-06-03 03:58:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:58:28] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:28] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-06-03 03:58:28] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 18 places in 61 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 66 places in 58 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 39 places in 62 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 33 places in 42 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 33 places in 51 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 45 places in 36 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 26 places in 52 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 31 places in 38 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 42 places in 58 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 28 places in 36 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2020-06-03 03:58:29] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 13 places in 71 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 36 places in 42 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 21 places in 41 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 34 places in 52 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 35 places in 49 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 41 places in 41 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 51 places in 52 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 43 places in 37 ms
[2020-06-03 03:58:30] [INFO ] Deduced a trap composed of 43 places in 37 ms
[2020-06-03 03:58:30] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 1847 ms
[2020-06-03 03:58:30] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 15 ms.
[2020-06-03 03:58:31] [INFO ] Added : 138 causal constraints over 28 iterations in 494 ms. Result :sat
[2020-06-03 03:58:31] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2020-06-03 03:58:31] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:31] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 14 places in 64 ms
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-06-03 03:58:31] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 74 places in 82 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 73 places in 60 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 44 places in 59 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 19 places in 59 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 72 places in 57 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 29 places in 57 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 32 places in 70 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 43 places in 56 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 71 places in 57 ms
[2020-06-03 03:58:32] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 68 places in 57 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 68 places in 73 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 51 places in 55 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 79 places in 57 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 72 places in 56 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 33 places in 49 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 72 places in 45 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 74 places in 41 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 28 places in 55 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 19 places in 54 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 69 places in 57 ms
[2020-06-03 03:58:33] [INFO ] Deduced a trap composed of 73 places in 52 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 74 places in 55 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 78 places in 53 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 72 places in 52 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 69 places in 56 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 71 places in 44 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 28 places in 56 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 73 places in 53 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 72 places in 45 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2020-06-03 03:58:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 3154 ms
[2020-06-03 03:58:34] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2020-06-03 03:58:34] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:34] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 14 places in 80 ms
[2020-06-03 03:58:34] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 23 places in 47 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 30 places in 38 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 28 places in 30 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 29 places in 27 ms
[2020-06-03 03:58:35] [INFO ] Deduced a trap composed of 35 places in 28 ms
[2020-06-03 03:58:35] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1156 ms
[2020-06-03 03:58:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2020-06-03 03:58:36] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:36] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 23 places in 56 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 37 places in 46 ms
[2020-06-03 03:58:36] [INFO ] Deduced a trap composed of 35 places in 40 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 28 places in 44 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 29 places in 48 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 31 places in 36 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 37 places in 45 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-06-03 03:58:37] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2020-06-03 03:58:37] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1340 ms
[2020-06-03 03:58:37] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 10 ms.
[2020-06-03 03:58:38] [INFO ] Added : 177 causal constraints over 36 iterations in 671 ms. Result :sat
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 73 places in 62 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 70 places in 55 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 77 places in 48 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 73 places in 53 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 79 places in 49 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 79 places in 48 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 72 places in 60 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 75 places in 45 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 77 places in 58 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 74 places in 46 ms
[2020-06-03 03:58:38] [INFO ] Deduced a trap composed of 77 places in 46 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 75 places in 46 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 79 places in 46 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 82 places in 52 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 76 places in 50 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 77 places in 45 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 81 places in 54 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 67 places in 57 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 66 places in 52 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 71 places in 54 ms
[2020-06-03 03:58:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1423 ms
[2020-06-03 03:58:39] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:39] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:39] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2020-06-03 03:58:39] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 42 places in 47 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 20 places in 39 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 23 places in 41 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 28 places in 25 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2020-06-03 03:58:40] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2020-06-03 03:58:40] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1160 ms
[2020-06-03 03:58:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 03:58:41] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-06-03 03:58:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:41] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 14 places in 73 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 36 places in 50 ms
[2020-06-03 03:58:41] [INFO ] Deduced a trap composed of 37 places in 38 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 28 places in 43 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 31 places in 43 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 34 places in 39 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 24 places in 42 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 27 places in 44 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 26 places in 37 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2020-06-03 03:58:42] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2020-06-03 03:58:42] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1403 ms
[2020-06-03 03:58:42] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 15 ms.
[2020-06-03 03:58:43] [INFO ] Added : 177 causal constraints over 36 iterations in 656 ms. Result :sat
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 73 places in 60 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 70 places in 55 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 77 places in 53 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 73 places in 46 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 79 places in 52 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 79 places in 58 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 72 places in 57 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 75 places in 56 ms
[2020-06-03 03:58:43] [INFO ] Deduced a trap composed of 77 places in 63 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 74 places in 56 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 77 places in 79 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 75 places in 75 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 79 places in 52 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 82 places in 53 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 76 places in 53 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 77 places in 45 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 81 places in 49 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 67 places in 49 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 66 places in 48 ms
[2020-06-03 03:58:44] [INFO ] Deduced a trap composed of 71 places in 49 ms
[2020-06-03 03:58:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1514 ms
[2020-06-03 03:58:44] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2020-06-03 03:58:44] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:44] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 23 places in 59 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 77 places in 58 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 68 places in 58 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 68 places in 100 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 73 places in 54 ms
[2020-06-03 03:58:45] [INFO ] Deduced a trap composed of 68 places in 50 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 69 places in 57 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 68 places in 49 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 66 places in 49 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 67 places in 54 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 68 places in 73 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 66 places in 47 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 67 places in 49 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 72 places in 54 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 68 places in 45 ms
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 66 places in 42 ms
[2020-06-03 03:58:46] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1671 ms
[2020-06-03 03:58:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-06-03 03:58:46] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:46] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 03:58:46] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 23 places in 57 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 14 places in 56 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 77 places in 65 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 22 places in 54 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 66 places in 47 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 68 places in 47 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 67 places in 50 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 70 places in 48 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 64 places in 47 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 66 places in 48 ms
[2020-06-03 03:58:47] [INFO ] Deduced a trap composed of 71 places in 45 ms
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 67 places in 43 ms
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 64 places in 43 ms
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 66 places in 45 ms
[2020-06-03 03:58:48] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1345 ms
[2020-06-03 03:58:48] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 10 ms.
[2020-06-03 03:58:48] [INFO ] Added : 174 causal constraints over 35 iterations in 573 ms. Result :sat
[2020-06-03 03:58:48] [INFO ] Deduced a trap composed of 72 places in 54 ms
[2020-06-03 03:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-06-03 03:58:48] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:58:48] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:49] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 33 places in 71 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 23 places in 64 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 30 places in 63 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-06-03 03:58:49] [INFO ] Deduced a trap composed of 76 places in 52 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 79 places in 50 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 29 places in 59 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 29 places in 64 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 72 places in 63 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 70 places in 55 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 76 places in 49 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 71 places in 59 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 47 places in 56 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 58 places in 60 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 69 places in 58 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 37 places in 59 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 48 places in 62 ms
[2020-06-03 03:58:50] [INFO ] Deduced a trap composed of 46 places in 64 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 36 places in 58 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 70 places in 58 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 74 places in 52 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 46 places in 52 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 77 places in 55 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 75 places in 54 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 70 places in 55 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 75 places in 59 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 70 places in 49 ms
[2020-06-03 03:58:51] [INFO ] Deduced a trap composed of 45 places in 93 ms
[2020-06-03 03:58:51] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 2652 ms
[2020-06-03 03:58:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 100 ms returned sat
[2020-06-03 03:58:51] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:52] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 33 places in 61 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 19 places in 56 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 19 places in 58 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 75 places in 56 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 22 places in 56 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-06-03 03:58:52] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 74 places in 56 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 20 places in 67 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 68 places in 68 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 26 places in 55 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 75 places in 57 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 78 places in 117 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 72 places in 49 ms
[2020-06-03 03:58:53] [INFO ] Deduced a trap composed of 71 places in 51 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 73 places in 53 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 23 places in 50 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 49 places in 63 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 42 places in 62 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 26 places in 50 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 18 places in 59 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 40 places in 62 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 46 places in 63 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 48 places in 61 ms
[2020-06-03 03:58:54] [INFO ] Deduced a trap composed of 53 places in 60 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 73 places in 63 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 42 places in 62 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 36 places in 63 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 77 places in 63 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 76 places in 61 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 70 places in 61 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 78 places in 60 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 23 places in 61 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 50 places in 60 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 28 places in 47 ms
[2020-06-03 03:58:55] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 52 places in 47 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 51 places in 44 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 75 places in 44 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 46 places in 41 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 79 places in 45 ms
[2020-06-03 03:58:56] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 4150 ms
[2020-06-03 03:58:56] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 14 ms.
[2020-06-03 03:58:57] [INFO ] Added : 181 causal constraints over 37 iterations in 762 ms. Result :sat
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 74 places in 79 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 75 places in 50 ms
[2020-06-03 03:58:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 03:58:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 03:58:57] [INFO ] Flatten gal took : 99 ms
FORMULA BusinessProcesses-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:58:57] [INFO ] Applying decomposition
[2020-06-03 03:58:57] [INFO ] Flatten gal took : 14 ms
[2020-06-03 03:58:57] [INFO ] Decomposing Gal with order
[2020-06-03 03:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:58:57] [INFO ] Flatten gal took : 44 ms
[2020-06-03 03:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-06-03 03:58:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2020-06-03 03:58:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-03 @ 3570 seconds

FORMULA BusinessProcesses-PT-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 13626332 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16320656 kB

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

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-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-03, 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 r182-oct2-158987913900466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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