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.r066-tajo-158922814200337.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 itstools
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 r066-tajo-158922814200337
=====================================================================

--------------------
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 1590111122372

[2020-05-22 01:32:03] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 01:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:32:04] [INFO ] Load time of PNML (sax parser for PT used): 416 ms
[2020-05-22 01:32:04] [INFO ] Transformed 500 places.
[2020-05-22 01:32:04] [INFO ] Transformed 10200 transitions.
[2020-05-22 01:32:04] [INFO ] Found NUPN structural information;
[2020-05-22 01:32:04] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 524 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1579 ms. (steps per millisecond=63 ) 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-05-22 01:32:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:32:06] [INFO ] Computed 300 place invariants in 45 ms
[2020-05-22 01:32:06] [INFO ] [Real]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-05-22 01:32:06] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 35 ms returned sat
[2020-05-22 01:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:07] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2020-05-22 01:32:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 101 ms returned sat
[2020-05-22 01:32:07] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:08] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2020-05-22 01:32:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:32:08] [INFO ] [Nat]Added 100 Read/Feed constraints in 60 ms returned sat
[2020-05-22 01:32:08] [INFO ] Deduced a trap composed of 4 places in 346 ms
[2020-05-22 01:32:08] [INFO ] Deduced a trap composed of 4 places in 170 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:32:09] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:32:10] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:32:11] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:11] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:32:11] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:11] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:11] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3043 ms
[2020-05-22 01:32:11] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 202 ms.
[2020-05-22 01:32:13] [INFO ] Added : 101 causal constraints over 21 iterations in 2525 ms. Result :sat
[2020-05-22 01:32:14] [INFO ] [Real]Absence check using 200 positive place invariants in 97 ms returned sat
[2020-05-22 01:32:14] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:14] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-05-22 01:32:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 16 ms returned unsat
[2020-05-22 01:32:15] [INFO ] [Real]Absence check using 200 positive place invariants in 89 ms returned sat
[2020-05-22 01:32:15] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 53 ms returned sat
[2020-05-22 01:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:15] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-05-22 01:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 109 ms returned sat
[2020-05-22 01:32:16] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-05-22 01:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:16] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2020-05-22 01:32:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:32:17] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:18] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:19] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:32:20] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2020-05-22 01:32:21] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-05-22 01:32:22] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:32:23] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:32:24] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:25] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:26] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:27] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:28] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:32:29] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:32:30] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:32:31] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:32:31] [INFO ] Trap strengthening (SAT) tested/added 147/146 trap constraints in 14903 ms
[2020-05-22 01:32:31] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 173 ms.
[2020-05-22 01:32:34] [INFO ] Added : 101 causal constraints over 21 iterations in 2542 ms. Result :sat
[2020-05-22 01:32:34] [INFO ] [Real]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-05-22 01:32:34] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-05-22 01:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:35] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-22 01:32:35] [INFO ] [Real]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-05-22 01:32:35] [INFO ] Deduced a trap composed of 4 places in 176 ms
[2020-05-22 01:32:35] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-05-22 01:32:35] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-22 01:32:35] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 4 places in 146 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:32:36] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:32:37] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-05-22 01:32:38] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:32:39] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-05-22 01:32:40] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:41] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:42] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-05-22 01:32:43] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:32:43] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:32:43] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:32:43] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 7932 ms
[2020-05-22 01:32:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-05-22 01:32:43] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 57 ms returned sat
[2020-05-22 01:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:44] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2020-05-22 01:32:44] [INFO ] [Nat]Added 100 Read/Feed constraints in 39 ms returned sat
[2020-05-22 01:32:44] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-05-22 01:32:44] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-22 01:32:44] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-05-22 01:32:44] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:32:45] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:32:46] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:32:47] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:32:48] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-22 01:32:49] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-05-22 01:32:50] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 5 places in 86 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:32:51] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:32:52] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:32:53] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:32:54] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:32:54] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 9808 ms
[2020-05-22 01:32:54] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 165 ms.
[2020-05-22 01:32:56] [INFO ] Added : 101 causal constraints over 21 iterations in 2065 ms. Result :sat
[2020-05-22 01:32:56] [INFO ] [Real]Absence check using 200 positive place invariants in 100 ms returned sat
[2020-05-22 01:32:56] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 55 ms returned sat
[2020-05-22 01:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:57] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2020-05-22 01:32:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:32:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 96 ms returned sat
[2020-05-22 01:32:57] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-05-22 01:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:32:58] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-22 01:32:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 34 ms returned sat
[2020-05-22 01:32:58] [INFO ] Deduced a trap composed of 4 places in 178 ms
[2020-05-22 01:32:58] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2020-05-22 01:32:58] [INFO ] Deduced a trap composed of 4 places in 156 ms
[2020-05-22 01:32:58] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:32:58] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-05-22 01:32:59] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:33:00] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:33:01] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-22 01:33:02] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:33:03] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:33:04] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:33:05] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:33:06] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:07] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:33:08] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:33:09] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:10] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:33:10] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:33:10] [INFO ] Trap strengthening (SAT) tested/added 120/119 trap constraints in 11998 ms
[2020-05-22 01:33:10] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 213 ms.
[2020-05-22 01:33:12] [INFO ] Added : 101 causal constraints over 21 iterations in 2381 ms. Result :sat
[2020-05-22 01:33:12] [INFO ] [Real]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-05-22 01:33:12] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:13] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2020-05-22 01:33:13] [INFO ] [Real]Added 100 Read/Feed constraints in 34 ms returned sat
[2020-05-22 01:33:13] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2020-05-22 01:33:13] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-05-22 01:33:14] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 5 places in 96 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 5 places in 119 ms
[2020-05-22 01:33:15] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:33:16] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:33:17] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:17] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 4200 ms
[2020-05-22 01:33:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:33:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-05-22 01:33:18] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:18] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2020-05-22 01:33:18] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-05-22 01:33:18] [INFO ] Deduced a trap composed of 4 places in 162 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 6 places in 114 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-22 01:33:19] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:33:20] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:33:21] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:33:22] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-05-22 01:33:22] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3337 ms
[2020-05-22 01:33:22] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 203 ms.
[2020-05-22 01:33:24] [INFO ] Added : 101 causal constraints over 21 iterations in 2112 ms. Result :sat
[2020-05-22 01:33:24] [INFO ] [Real]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-05-22 01:33:24] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:25] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2020-05-22 01:33:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:33:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-05-22 01:33:25] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 63 ms returned sat
[2020-05-22 01:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:26] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2020-05-22 01:33:26] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2020-05-22 01:33:26] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-05-22 01:33:26] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2020-05-22 01:33:26] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:33:26] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:33:26] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:33:27] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-05-22 01:33:28] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:33:29] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:33:29] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3726 ms
[2020-05-22 01:33:30] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 267 ms.
[2020-05-22 01:33:32] [INFO ] Added : 101 causal constraints over 21 iterations in 2135 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-22 01:33:33] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-05-22 01:33:33] [INFO ] Flatten gal took : 988 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-05-22 01:33:34] [INFO ] Flatten gal took : 624 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:33:35] [INFO ] Applying decomposition
[2020-05-22 01:33:36] [INFO ] Input system was already deterministic with 10200 transitions.
[2020-05-22 01:33:36] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:33:36] [INFO ] Flatten gal took : 772 ms
[2020-05-22 01:33:36] [INFO ] Built C files in 1819ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18227527664457281322.txt, -o, /tmp/graph18227527664457281322.bin, -w, /tmp/graph18227527664457281322.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18227527664457281322.bin, -l, -1, -v, -w, /tmp/graph18227527664457281322.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:33:37] [INFO ] Decomposing Gal with order
[2020-05-22 01:33:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:33:38] [INFO ] Removed a total of 32865 redundant transitions.
[2020-05-22 01:33:39] [INFO ] Flatten gal took : 1145 ms
[2020-05-22 01:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 231 ms.
[2020-05-22 01:33:39] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 70 ms
[2020-05-22 01:33:39] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((X((G("(((u130.flag_1_89!=0)&&(u69.p3_72!=1))||((i60.u123.p3_78!=0)&&(i86.u53.flag_1_53!=1)))"))&&(F("((i84.u45.flag_0_45==0)||(i68.u88.flag_0_92==1))")))))
Formula 0 simplified : !X(G"(((u130.flag_1_89!=0)&&(u69.p3_72!=1))||((i60.u123.p3_78!=0)&&(i86.u53.flag_1_53!=1)))" & F"((i84.u45.flag_0_45==0)||(i68.u88.flag_0_92==1))")
built 4951 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u1.exit_1, u2.exit_2, u3.exit_3, u4.exit_4, u5.exit_5, u11.exit_11, u12.exit_12, u13.exit_14, u16.exit_17, u18.exit_19, u21.exit_21, u22.exit_22, u23.exit_23, u24.exit_24, u25.exit_25, u26.exit_26, u28.exit_28, u29.exit_29, u30.exit_30, u31.exit_32, u32.exit_33, u33.exit_34, u35.exit_36, u42.exit_42, u44.exit_44, u46.exit_46, u48.exit_48, u50.exit_50, u51.exit_51, u54.exit_55, u57.exit_58, u58.exit_59, u59.exit_60, u60.exit_62, u62.exit_64, u63.exit_65, u64.exit_67, u65.exit_68, u67.exit_70, u68.exit_71, u69.exit_72, u70.exit_73, u73.exit_75, u74.exit_76, u77.exit_79, u81.exit_84, u82.exit_86, u86.exit_90, u87.exit_91, u89.exit_94, u92.exit_96, u93.exit_97, u97.exit_7, u100.exit_13, u101.exit_16, u104.exit_31, u116.exit_54, u117.exit_56, u118.exit_61, u120.exit_66, u124.exit_80, u128.exit_85, u130.exit_89, u132.exit_93, i6.exit_6, i7.exit_9, i11.exit_15, i13.exit_18, i15.exit_20, i29.exit_37, i30.exit_38, i31.exit_39, i33.exit_43, i36.exit_47, i40.exit_52, i42.exit_57, i47.exit_63, i56.exit_74, i59.exit_77, i60.exit_78, i62.exit_83, i65.exit_87, i68.exit_92, i70.exit_95, i73.exit_98, i75.exit_8, i76.exit_10, i79.exit_27, i81.exit_35, i82.exit_40, i83.exit_41, i84.exit_45, i85.exit_49, i86.exit_53, i91.exit_69, i93.exit_81, i94.exit_82, i96.exit_88, i99.exit_99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/10100/100/10200
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1573 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.6853,442992,1,0,1.20829e+06,5186,79570,543439,445,7044,1472267
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-100-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((((i7.u9.p0_9==0)||(u54.p0_55==1))||(u16.flag_0_17==0))||(u21.p1_21==1))")U(X(!(F("((i7.u9.p0_9==0)||(u54.p0_55==1))"))))))
Formula 1 simplified : !("((((i7.u9.p0_9==0)||(u54.p0_55==1))||(u16.flag_0_17==0))||(u21.p1_21==1))" U X!F"((i7.u9.p0_9==0)||(u54.p0_55==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
356 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.2523,489664,1,0,1.23428e+06,5186,82517,572893,448,7044,1525443
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(((G(X((((G("((u132.flag_0_93!=0)&&(u60.flag_1_62!=1))"))&&(X("(u89.flag_0_94==1)")))||("(u23.flag_0_23==0)"))||("(u23.flag_0_23==1)"))))||("(u116.p1_54==0)"))||("(i99.u134.p0_99==1)"))))
Formula 2 simplified : !X("(i99.u134.p0_99==1)" | "(u116.p1_54==0)" | GX("(u23.flag_0_23==0)" | "(u23.flag_0_23==1)" | (G"((u132.flag_0_93!=0)&&(u60.flag_1_62!=1))" & X"(u89.flag_0_94==1)")))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.2639,491156,1,0,1.23428e+06,5186,82530,572893,451,7044,1525470
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Dekker-PT-100-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X((F("((((i31.u107.p0_39==0)||(u93.p1_97==1))||(u104.p3_31==0))||(i81.u34.flag_0_35==1))"))||(G(!(G("((u130.p0_89==0)||(u50.flag_1_50==1))")))))))))
Formula 3 simplified : !FGX(F"((((i31.u107.p0_39==0)||(u93.p1_97==1))||(u104.p3_31==0))||(i81.u34.flag_0_35==1))" | G!G"((u130.p0_89==0)||(u50.flag_1_50==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
92 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,21.1794,511452,1,0,1.23637e+06,5186,83685,576605,454,7044,1530756
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-100-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(((!(X("((i40.u114.p0_52==0)||(u69.p1_72==1))")))U("(i7.u8.flag_0_9==1)"))&&("((i40.u114.p0_52==0)||(u69.p1_72==1))")))&&(F("(i7.u8.flag_0_9==1)"))))
Formula 4 simplified : !(F("((i40.u114.p0_52==0)||(u69.p1_72==1))" & (!X"((i40.u114.p0_52==0)||(u69.p1_72==1))" U "(i7.u8.flag_0_9==1)")) & F"(i7.u8.flag_0_9==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
181 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,22.9917,550260,1,0,1.24376e+06,5186,85624,586816,454,7044,1549130
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-100-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590111245977

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r066-tajo-158922814200337"
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 ;