fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882200337
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Dekker-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15791.160 3600000.00 3682845.00 48078.20 FFFFTFTTTTTFF?TF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200337.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 5.9M Apr 27 14:36 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 Dekker-PT-100-00
FORMULA_NAME Dekker-PT-100-01
FORMULA_NAME Dekker-PT-100-02
FORMULA_NAME Dekker-PT-100-03
FORMULA_NAME Dekker-PT-100-04
FORMULA_NAME Dekker-PT-100-05
FORMULA_NAME Dekker-PT-100-06
FORMULA_NAME Dekker-PT-100-07
FORMULA_NAME Dekker-PT-100-08
FORMULA_NAME Dekker-PT-100-09
FORMULA_NAME Dekker-PT-100-10
FORMULA_NAME Dekker-PT-100-11
FORMULA_NAME Dekker-PT-100-12
FORMULA_NAME Dekker-PT-100-13
FORMULA_NAME Dekker-PT-100-14
FORMULA_NAME Dekker-PT-100-15

=== Now, execution of the tool begins

BK_START 1591217509591

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:51:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:51:51] [INFO ] Load time of PNML (sax parser for PT used): 372 ms
[2020-06-03 20:51:51] [INFO ] Transformed 500 places.
[2020-06-03 20:51:51] [INFO ] Transformed 10200 transitions.
[2020-06-03 20:51:51] [INFO ] Found NUPN structural information;
[2020-06-03 20:51:51] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 482 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1796 ms. (steps per millisecond=55 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 20:51:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:51:53] [INFO ] Computed 300 place invariants in 40 ms
[2020-06-03 20:51:53] [INFO ] [Real]Absence check using 200 positive place invariants in 122 ms returned sat
[2020-06-03 20:51:53] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 70 ms returned sat
[2020-06-03 20:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:51:54] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2020-06-03 20:51:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:51:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 97 ms returned sat
[2020-06-03 20:51:54] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:51:55] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-06-03 20:51:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 20:51:55] [INFO ] [Nat]Added 100 Read/Feed constraints in 43 ms returned sat
[2020-06-03 20:51:56] [INFO ] Deduced a trap composed of 4 places in 796 ms
[2020-06-03 20:51:56] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-06-03 20:51:56] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 5 places in 125 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:51:57] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:51:58] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:51:59] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:51:59] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3406 ms
[2020-06-03 20:51:59] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 200 ms.
[2020-06-03 20:52:01] [INFO ] Added : 101 causal constraints over 21 iterations in 2304 ms. Result :sat
[2020-06-03 20:52:01] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2020-06-03 20:52:01] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-06-03 20:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:02] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-06-03 20:52:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 16 ms returned unsat
[2020-06-03 20:52:02] [INFO ] [Real]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-06-03 20:52:02] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 53 ms returned sat
[2020-06-03 20:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:03] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2020-06-03 20:52:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 104 ms returned sat
[2020-06-03 20:52:03] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:04] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2020-06-03 20:52:04] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2020-06-03 20:52:04] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 20:52:04] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-06-03 20:52:04] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 6 places in 62 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:07] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:52:08] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 20:52:09] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:10] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:52:11] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 20:52:12] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:13] [INFO ] Deduced a trap composed of 6 places in 483 ms
[2020-06-03 20:52:13] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:52:13] [INFO ] Deduced a trap composed of 4 places in 407 ms
[2020-06-03 20:52:13] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:52:13] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 4 places in 194 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 4 places in 200 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-06-03 20:52:14] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:52:15] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 6 places in 129 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:16] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-03 20:52:17] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:18] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:52:19] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:52:20] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:52:21] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:21] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:52:21] [INFO ] Trap strengthening (SAT) tested/added 147/146 trap constraints in 16712 ms
[2020-06-03 20:52:21] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 310 ms.
[2020-06-03 20:52:23] [INFO ] Added : 101 causal constraints over 21 iterations in 2260 ms. Result :sat
[2020-06-03 20:52:23] [INFO ] [Real]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-06-03 20:52:23] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 101 ms returned sat
[2020-06-03 20:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:26] [INFO ] [Real]Absence check using state equation in 3080 ms returned sat
[2020-06-03 20:52:26] [INFO ] [Real]Added 100 Read/Feed constraints in 43 ms returned sat
[2020-06-03 20:52:27] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-06-03 20:52:27] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 20:52:27] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-06-03 20:52:27] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-03 20:52:28] [INFO ] Deduced a trap composed of 4 places in 865 ms
[2020-06-03 20:52:29] [INFO ] Deduced a trap composed of 4 places in 934 ms
[2020-06-03 20:52:29] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-06-03 20:52:29] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:52:30] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-06-03 20:52:31] [INFO ] Deduced a trap composed of 4 places in 361 ms
[2020-06-03 20:52:31] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:52:31] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-03 20:52:31] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 20:52:32] [INFO ] Deduced a trap composed of 6 places in 100 ms
[2020-06-03 20:52:32] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:32] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:32] [INFO ] Deduced a trap composed of 4 places in 527 ms
[2020-06-03 20:52:32] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:52:33] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-06-03 20:52:33] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 6 places in 771 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 20:52:34] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:35] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 5 places in 90 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-06-03 20:52:36] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:37] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:52:38] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-06-03 20:52:38] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 12056 ms
[2020-06-03 20:52:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-06-03 20:52:39] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:39] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2020-06-03 20:52:39] [INFO ] [Nat]Added 100 Read/Feed constraints in 43 ms returned sat
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 20:52:40] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:52:41] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:52:42] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-03 20:52:43] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:52:44] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:45] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:46] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:52:47] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:52:48] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:52:49] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 9761 ms
[2020-06-03 20:52:49] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 206 ms.
[2020-06-03 20:52:52] [INFO ] Added : 101 causal constraints over 21 iterations in 2614 ms. Result :sat
[2020-06-03 20:52:52] [INFO ] [Real]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-06-03 20:52:52] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 53 ms returned sat
[2020-06-03 20:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:53] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2020-06-03 20:52:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-06-03 20:52:53] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 66 ms returned sat
[2020-06-03 20:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:54] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2020-06-03 20:52:54] [INFO ] [Nat]Added 100 Read/Feed constraints in 38 ms returned sat
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 162 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:52:57] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:52:58] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:52:59] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:53:00] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:53:05] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:06] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:53:06] [INFO ] Trap strengthening (SAT) tested/added 120/119 trap constraints in 11842 ms
[2020-06-03 20:53:06] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 222 ms.
[2020-06-03 20:53:08] [INFO ] Added : 101 causal constraints over 21 iterations in 2259 ms. Result :sat
[2020-06-03 20:53:08] [INFO ] [Real]Absence check using 200 positive place invariants in 95 ms returned sat
[2020-06-03 20:53:08] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:09] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2020-06-03 20:53:09] [INFO ] [Real]Added 100 Read/Feed constraints in 31 ms returned sat
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 152 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 148 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 5 places in 105 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:53:13] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:53:13] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 4226 ms
[2020-06-03 20:53:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 98 ms returned sat
[2020-06-03 20:53:13] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:53:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:14] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-06-03 20:53:14] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2020-06-03 20:53:14] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-06-03 20:53:14] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 6 places in 114 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-06-03 20:53:15] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:53:18] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3716 ms
[2020-06-03 20:53:18] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 224 ms.
[2020-06-03 20:53:20] [INFO ] Added : 101 causal constraints over 21 iterations in 2447 ms. Result :sat
[2020-06-03 20:53:21] [INFO ] [Real]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-06-03 20:53:21] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:21] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2020-06-03 20:53:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-06-03 20:53:22] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:22] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-06-03 20:53:22] [INFO ] [Nat]Added 100 Read/Feed constraints in 34 ms returned sat
[2020-06-03 20:53:22] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 5 places in 103 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:53:26] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4105 ms
[2020-06-03 20:53:27] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 224 ms.
[2020-06-03 20:53:29] [INFO ] Added : 101 causal constraints over 21 iterations in 2185 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 20:53:30] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-03 20:53:30] [INFO ] Flatten gal took : 867 ms
FORMULA Dekker-PT-100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:53:30] [INFO ] Applying decomposition
[2020-06-03 20:53:30] [INFO ] Flatten gal took : 498 ms
[2020-06-03 20:53:31] [INFO ] Decomposing Gal with order
[2020-06-03 20:53:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 20:53:32] [INFO ] Removed a total of 39300 redundant transitions.
[2020-06-03 20:53:32] [INFO ] Flatten gal took : 992 ms
[2020-06-03 20:53:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 339 ms.
[2020-06-03 20:53:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 20:53:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 147 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-100 @ 3570 seconds

FORMULA Dekker-PT-100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 151436 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16330896 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="Dekker-PT-100"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;