About the Execution of ITS-LoLa for DES-PT-60b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.500 | 3600000.00 | 3668168.00 | 1421.90 | FFFF??FTTF????FF | 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.r180-ebro-158987900100332.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 DES-PT-60b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900100332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 139K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60b-CTLFireability-00
FORMULA_NAME DES-PT-60b-CTLFireability-01
FORMULA_NAME DES-PT-60b-CTLFireability-02
FORMULA_NAME DES-PT-60b-CTLFireability-03
FORMULA_NAME DES-PT-60b-CTLFireability-04
FORMULA_NAME DES-PT-60b-CTLFireability-05
FORMULA_NAME DES-PT-60b-CTLFireability-06
FORMULA_NAME DES-PT-60b-CTLFireability-07
FORMULA_NAME DES-PT-60b-CTLFireability-08
FORMULA_NAME DES-PT-60b-CTLFireability-09
FORMULA_NAME DES-PT-60b-CTLFireability-10
FORMULA_NAME DES-PT-60b-CTLFireability-11
FORMULA_NAME DES-PT-60b-CTLFireability-12
FORMULA_NAME DES-PT-60b-CTLFireability-13
FORMULA_NAME DES-PT-60b-CTLFireability-14
FORMULA_NAME DES-PT-60b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591202220555
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:37:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 16:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:37:04] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2020-06-03 16:37:04] [INFO ] Transformed 519 places.
[2020-06-03 16:37:04] [INFO ] Transformed 470 transitions.
[2020-06-03 16:37:04] [INFO ] Found NUPN structural information;
[2020-06-03 16:37:04] [INFO ] Parsed PT model containing 519 places and 470 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 88 ms.
Incomplete random walk after 100000 steps, including 846 resets, run finished after 786 ms. (steps per millisecond=127 ) properties seen :[0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0]
// Phase 1: matrix 470 rows 519 cols
[2020-06-03 16:37:05] [INFO ] Computed 65 place invariants in 87 ms
[2020-06-03 16:37:05] [INFO ] [Real]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 16:37:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 71 ms returned sat
[2020-06-03 16:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:07] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2020-06-03 16:37:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:37:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 95 ms returned sat
[2020-06-03 16:37:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 180 ms returned sat
[2020-06-03 16:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:10] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2020-06-03 16:37:10] [INFO ] Deduced a trap composed of 16 places in 301 ms
[2020-06-03 16:37:10] [INFO ] Deduced a trap composed of 24 places in 304 ms
[2020-06-03 16:37:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 791 ms
[2020-06-03 16:37:11] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 164 ms.
[2020-06-03 16:37:17] [INFO ] Added : 350 causal constraints over 70 iterations in 6634 ms. Result :sat
[2020-06-03 16:37:17] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 16:37:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:19] [INFO ] [Real]Absence check using state equation in 1591 ms returned sat
[2020-06-03 16:37:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:37:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 73 ms returned sat
[2020-06-03 16:37:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-06-03 16:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:21] [INFO ] [Nat]Absence check using state equation in 1822 ms returned sat
[2020-06-03 16:37:22] [INFO ] Deduced a trap composed of 19 places in 323 ms
[2020-06-03 16:37:22] [INFO ] Deduced a trap composed of 20 places in 283 ms
[2020-06-03 16:37:22] [INFO ] Deduced a trap composed of 19 places in 244 ms
[2020-06-03 16:37:23] [INFO ] Deduced a trap composed of 40 places in 228 ms
[2020-06-03 16:37:23] [INFO ] Deduced a trap composed of 49 places in 220 ms
[2020-06-03 16:37:23] [INFO ] Deduced a trap composed of 20 places in 315 ms
[2020-06-03 16:37:23] [INFO ] Deduced a trap composed of 51 places in 209 ms
[2020-06-03 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2279 ms
[2020-06-03 16:37:24] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 74 ms.
[2020-06-03 16:37:32] [INFO ] Added : 335 causal constraints over 68 iterations in 8331 ms. Result :sat
[2020-06-03 16:37:32] [INFO ] Deduced a trap composed of 41 places in 399 ms
[2020-06-03 16:37:33] [INFO ] Deduced a trap composed of 54 places in 300 ms
[2020-06-03 16:37:33] [INFO ] Deduced a trap composed of 46 places in 281 ms
[2020-06-03 16:37:33] [INFO ] Deduced a trap composed of 22 places in 223 ms
[2020-06-03 16:37:34] [INFO ] Deduced a trap composed of 33 places in 229 ms
[2020-06-03 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2008 ms
[2020-06-03 16:37:34] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:37:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-06-03 16:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:36] [INFO ] [Real]Absence check using state equation in 1504 ms returned sat
[2020-06-03 16:37:36] [INFO ] Deduced a trap composed of 15 places in 335 ms
[2020-06-03 16:37:36] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-06-03 16:37:37] [INFO ] Deduced a trap composed of 8 places in 215 ms
[2020-06-03 16:37:37] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-06-03 16:37:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1196 ms
[2020-06-03 16:37:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:37:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:37:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:39] [INFO ] [Nat]Absence check using state equation in 1618 ms returned sat
[2020-06-03 16:37:39] [INFO ] Deduced a trap composed of 8 places in 310 ms
[2020-06-03 16:37:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2020-06-03 16:37:39] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 67 ms.
[2020-06-03 16:37:48] [INFO ] Added : 414 causal constraints over 84 iterations in 8608 ms. Result :sat
[2020-06-03 16:37:48] [INFO ] Deduced a trap composed of 41 places in 268 ms
[2020-06-03 16:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2020-06-03 16:37:48] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 16:37:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:50] [INFO ] [Real]Absence check using state equation in 1503 ms returned sat
[2020-06-03 16:37:50] [INFO ] Deduced a trap composed of 8 places in 305 ms
[2020-06-03 16:37:51] [INFO ] Deduced a trap composed of 12 places in 259 ms
[2020-06-03 16:37:51] [INFO ] Deduced a trap composed of 27 places in 237 ms
[2020-06-03 16:37:51] [INFO ] Deduced a trap composed of 18 places in 89 ms
[2020-06-03 16:37:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1125 ms
[2020-06-03 16:37:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:37:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:37:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:37:53] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2020-06-03 16:37:53] [INFO ] Deduced a trap composed of 8 places in 320 ms
[2020-06-03 16:37:54] [INFO ] Deduced a trap composed of 44 places in 289 ms
[2020-06-03 16:37:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 769 ms
[2020-06-03 16:37:54] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 54 ms.
[2020-06-03 16:38:04] [INFO ] Added : 454 causal constraints over 91 iterations in 10388 ms. Result :sat
[2020-06-03 16:38:05] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:38:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:06] [INFO ] [Real]Absence check using state equation in 1573 ms returned sat
[2020-06-03 16:38:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:38:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-06-03 16:38:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 85 ms returned sat
[2020-06-03 16:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:09] [INFO ] [Nat]Absence check using state equation in 2337 ms returned sat
[2020-06-03 16:38:09] [INFO ] Deduced a trap composed of 21 places in 356 ms
[2020-06-03 16:38:10] [INFO ] Deduced a trap composed of 30 places in 253 ms
[2020-06-03 16:38:10] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2020-06-03 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1070 ms
[2020-06-03 16:38:10] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 53 ms.
[2020-06-03 16:38:16] [INFO ] Added : 269 causal constraints over 54 iterations in 6290 ms. Result :sat
[2020-06-03 16:38:17] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:38:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 76 ms returned sat
[2020-06-03 16:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:18] [INFO ] [Real]Absence check using state equation in 1850 ms returned sat
[2020-06-03 16:38:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:38:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 96 ms returned sat
[2020-06-03 16:38:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 172 ms returned sat
[2020-06-03 16:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:21] [INFO ] [Nat]Absence check using state equation in 2323 ms returned sat
[2020-06-03 16:38:21] [INFO ] Deduced a trap composed of 20 places in 235 ms
[2020-06-03 16:38:22] [INFO ] Deduced a trap composed of 19 places in 199 ms
[2020-06-03 16:38:22] [INFO ] Deduced a trap composed of 21 places in 209 ms
[2020-06-03 16:38:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 907 ms
[2020-06-03 16:38:22] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 37 ms.
[2020-06-03 16:38:29] [INFO ] Added : 332 causal constraints over 68 iterations in 6608 ms. Result :sat
[2020-06-03 16:38:29] [INFO ] Deduced a trap composed of 31 places in 199 ms
[2020-06-03 16:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2020-06-03 16:38:29] [INFO ] [Real]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-06-03 16:38:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:31] [INFO ] [Real]Absence check using state equation in 1588 ms returned sat
[2020-06-03 16:38:31] [INFO ] Deduced a trap composed of 10 places in 328 ms
[2020-06-03 16:38:32] [INFO ] Deduced a trap composed of 14 places in 297 ms
[2020-06-03 16:38:32] [INFO ] Deduced a trap composed of 18 places in 255 ms
[2020-06-03 16:38:32] [INFO ] Deduced a trap composed of 8 places in 181 ms
[2020-06-03 16:38:32] [INFO ] Deduced a trap composed of 12 places in 170 ms
[2020-06-03 16:38:33] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2020-06-03 16:38:33] [INFO ] Deduced a trap composed of 27 places in 259 ms
[2020-06-03 16:38:33] [INFO ] Deduced a trap composed of 19 places in 109 ms
[2020-06-03 16:38:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2185 ms
[2020-06-03 16:38:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:38:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 16:38:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:35] [INFO ] [Nat]Absence check using state equation in 1704 ms returned sat
[2020-06-03 16:38:36] [INFO ] Deduced a trap composed of 8 places in 374 ms
[2020-06-03 16:38:36] [INFO ] Deduced a trap composed of 12 places in 314 ms
[2020-06-03 16:38:36] [INFO ] Deduced a trap composed of 16 places in 263 ms
[2020-06-03 16:38:37] [INFO ] Deduced a trap composed of 20 places in 284 ms
[2020-06-03 16:38:37] [INFO ] Deduced a trap composed of 16 places in 214 ms
[2020-06-03 16:38:37] [INFO ] Deduced a trap composed of 15 places in 199 ms
[2020-06-03 16:38:37] [INFO ] Deduced a trap composed of 18 places in 177 ms
[2020-06-03 16:38:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2319 ms
[2020-06-03 16:38:38] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 59 ms.
[2020-06-03 16:38:47] [INFO ] Added : 455 causal constraints over 91 iterations in 9300 ms. Result :sat
[2020-06-03 16:38:47] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 16:38:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:49] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2020-06-03 16:38:49] [INFO ] Deduced a trap composed of 18 places in 342 ms
[2020-06-03 16:38:49] [INFO ] Deduced a trap composed of 21 places in 306 ms
[2020-06-03 16:38:50] [INFO ] Deduced a trap composed of 8 places in 373 ms
[2020-06-03 16:38:50] [INFO ] Deduced a trap composed of 20 places in 264 ms
[2020-06-03 16:38:50] [INFO ] Deduced a trap composed of 87 places in 221 ms
[2020-06-03 16:38:51] [INFO ] Deduced a trap composed of 32 places in 218 ms
[2020-06-03 16:38:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2059 ms
[2020-06-03 16:38:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:38:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:38:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-06-03 16:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:52] [INFO ] [Nat]Absence check using state equation in 1575 ms returned sat
[2020-06-03 16:38:53] [INFO ] Deduced a trap composed of 8 places in 297 ms
[2020-06-03 16:38:53] [INFO ] Deduced a trap composed of 22 places in 273 ms
[2020-06-03 16:38:53] [INFO ] Deduced a trap composed of 91 places in 249 ms
[2020-06-03 16:38:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1006 ms
[2020-06-03 16:38:54] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 50 ms.
[2020-06-03 16:39:03] [INFO ] Added : 409 causal constraints over 82 iterations in 9606 ms. Result :sat
[2020-06-03 16:39:04] [INFO ] Deduced a trap composed of 46 places in 359 ms
[2020-06-03 16:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 854 ms
[2020-06-03 16:39:04] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 16:39:04] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-06-03 16:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:06] [INFO ] [Real]Absence check using state equation in 1636 ms returned sat
[2020-06-03 16:39:06] [INFO ] Deduced a trap composed of 8 places in 333 ms
[2020-06-03 16:39:07] [INFO ] Deduced a trap composed of 12 places in 250 ms
[2020-06-03 16:39:07] [INFO ] Deduced a trap composed of 41 places in 218 ms
[2020-06-03 16:39:07] [INFO ] Deduced a trap composed of 32 places in 94 ms
[2020-06-03 16:39:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1122 ms
[2020-06-03 16:39:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:39:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 16:39:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 137 ms returned sat
[2020-06-03 16:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:09] [INFO ] [Nat]Absence check using state equation in 1914 ms returned sat
[2020-06-03 16:39:10] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-06-03 16:39:10] [INFO ] Deduced a trap composed of 8 places in 187 ms
[2020-06-03 16:39:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2020-06-03 16:39:10] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 44 ms.
[2020-06-03 16:39:17] [INFO ] Added : 390 causal constraints over 80 iterations in 7600 ms. Result :sat
[2020-06-03 16:39:18] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned unsat
[2020-06-03 16:39:18] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:39:18] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:19] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2020-06-03 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:39:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 84 ms returned sat
[2020-06-03 16:39:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-06-03 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:22] [INFO ] [Nat]Absence check using state equation in 2325 ms returned sat
[2020-06-03 16:39:23] [INFO ] Deduced a trap composed of 21 places in 370 ms
[2020-06-03 16:39:23] [INFO ] Deduced a trap composed of 30 places in 342 ms
[2020-06-03 16:39:23] [INFO ] Deduced a trap composed of 32 places in 314 ms
[2020-06-03 16:39:24] [INFO ] Deduced a trap composed of 20 places in 105 ms
[2020-06-03 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1457 ms
[2020-06-03 16:39:24] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 51 ms.
[2020-06-03 16:39:33] [INFO ] Added : 445 causal constraints over 89 iterations in 9051 ms. Result :sat
[2020-06-03 16:39:33] [INFO ] Deduced a trap composed of 55 places in 254 ms
[2020-06-03 16:39:33] [INFO ] Deduced a trap composed of 52 places in 201 ms
[2020-06-03 16:39:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 687 ms
[2020-06-03 16:39:34] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 16:39:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:35] [INFO ] [Real]Absence check using state equation in 1863 ms returned sat
[2020-06-03 16:39:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:39:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:39:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 112 ms returned sat
[2020-06-03 16:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:38] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2020-06-03 16:39:39] [INFO ] Deduced a trap composed of 20 places in 308 ms
[2020-06-03 16:39:39] [INFO ] Deduced a trap composed of 12 places in 299 ms
[2020-06-03 16:39:39] [INFO ] Deduced a trap composed of 31 places in 191 ms
[2020-06-03 16:39:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 966 ms
[2020-06-03 16:39:39] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 43 ms.
[2020-06-03 16:39:46] [INFO ] Added : 352 causal constraints over 71 iterations in 6948 ms. Result :sat
[2020-06-03 16:39:46] [INFO ] Deduced a trap composed of 48 places in 297 ms
[2020-06-03 16:39:47] [INFO ] Deduced a trap composed of 56 places in 300 ms
[2020-06-03 16:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 825 ms
[2020-06-03 16:39:47] [INFO ] [Real]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 16:39:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:49] [INFO ] [Real]Absence check using state equation in 1458 ms returned sat
[2020-06-03 16:39:49] [INFO ] Deduced a trap composed of 15 places in 298 ms
[2020-06-03 16:39:49] [INFO ] Deduced a trap composed of 12 places in 291 ms
[2020-06-03 16:39:50] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-06-03 16:39:50] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-06-03 16:39:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1176 ms
[2020-06-03 16:39:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:39:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 73 ms returned sat
[2020-06-03 16:39:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:52] [INFO ] [Nat]Absence check using state equation in 1871 ms returned sat
[2020-06-03 16:39:52] [INFO ] Deduced a trap composed of 8 places in 406 ms
[2020-06-03 16:39:53] [INFO ] Deduced a trap composed of 35 places in 310 ms
[2020-06-03 16:39:53] [INFO ] Deduced a trap composed of 24 places in 194 ms
[2020-06-03 16:39:53] [INFO ] Deduced a trap composed of 37 places in 329 ms
[2020-06-03 16:39:54] [INFO ] Deduced a trap composed of 40 places in 174 ms
[2020-06-03 16:39:54] [INFO ] Deduced a trap composed of 33 places in 324 ms
[2020-06-03 16:39:54] [INFO ] Deduced a trap composed of 30 places in 189 ms
[2020-06-03 16:39:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2311 ms
[2020-06-03 16:39:54] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 43 ms.
[2020-06-03 16:40:06] [INFO ] Added : 423 causal constraints over 85 iterations in 11415 ms. Result :sat
[2020-06-03 16:40:06] [INFO ] Deduced a trap composed of 22 places in 360 ms
[2020-06-03 16:40:07] [INFO ] Deduced a trap composed of 44 places in 378 ms
[2020-06-03 16:40:07] [INFO ] Deduced a trap composed of 45 places in 426 ms
[2020-06-03 16:40:08] [INFO ] Deduced a trap composed of 56 places in 319 ms
[2020-06-03 16:40:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2145 ms
[2020-06-03 16:40:08] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:40:08] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 16:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:10] [INFO ] [Real]Absence check using state equation in 1787 ms returned sat
[2020-06-03 16:40:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:40:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 16:40:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 79 ms returned sat
[2020-06-03 16:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:12] [INFO ] [Nat]Absence check using state equation in 1484 ms returned sat
[2020-06-03 16:40:12] [INFO ] Deduced a trap composed of 43 places in 196 ms
[2020-06-03 16:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2020-06-03 16:40:12] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 44 ms.
[2020-06-03 16:40:19] [INFO ] Added : 415 causal constraints over 84 iterations in 6561 ms. Result :sat
[2020-06-03 16:40:19] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:40:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:21] [INFO ] [Real]Absence check using state equation in 2251 ms returned sat
[2020-06-03 16:40:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:40:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:40:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 89 ms returned sat
[2020-06-03 16:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:23] [INFO ] [Nat]Absence check using state equation in 1895 ms returned sat
[2020-06-03 16:40:24] [INFO ] Deduced a trap composed of 14 places in 387 ms
[2020-06-03 16:40:24] [INFO ] Deduced a trap composed of 56 places in 354 ms
[2020-06-03 16:40:24] [INFO ] Deduced a trap composed of 53 places in 320 ms
[2020-06-03 16:40:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1295 ms
[2020-06-03 16:40:25] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:40:32] [INFO ] Added : 338 causal constraints over 68 iterations in 7018 ms. Result :sat
[2020-06-03 16:40:32] [INFO ] Deduced a trap composed of 41 places in 305 ms
[2020-06-03 16:40:32] [INFO ] Deduced a trap composed of 48 places in 304 ms
[2020-06-03 16:40:33] [INFO ] Deduced a trap composed of 65 places in 281 ms
[2020-06-03 16:40:33] [INFO ] Deduced a trap composed of 62 places in 279 ms
[2020-06-03 16:40:34] [INFO ] Deduced a trap composed of 33 places in 338 ms
[2020-06-03 16:40:34] [INFO ] Deduced a trap composed of 27 places in 352 ms
[2020-06-03 16:40:35] [INFO ] Deduced a trap composed of 50 places in 244 ms
[2020-06-03 16:40:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3198 ms
[2020-06-03 16:40:35] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:40:35] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:36] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2020-06-03 16:40:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:40:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 87 ms returned sat
[2020-06-03 16:40:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 107 ms returned sat
[2020-06-03 16:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:39] [INFO ] [Nat]Absence check using state equation in 1790 ms returned sat
[2020-06-03 16:40:39] [INFO ] Deduced a trap composed of 14 places in 346 ms
[2020-06-03 16:40:39] [INFO ] Deduced a trap composed of 21 places in 285 ms
[2020-06-03 16:40:40] [INFO ] Deduced a trap composed of 25 places in 259 ms
[2020-06-03 16:40:40] [INFO ] Deduced a trap composed of 37 places in 310 ms
[2020-06-03 16:40:40] [INFO ] Deduced a trap composed of 41 places in 317 ms
[2020-06-03 16:40:41] [INFO ] Deduced a trap composed of 39 places in 229 ms
[2020-06-03 16:40:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2065 ms
[2020-06-03 16:40:41] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:40:45] [INFO ] Added : 262 causal constraints over 53 iterations in 4770 ms. Result :sat
[2020-06-03 16:40:46] [INFO ] Deduced a trap composed of 40 places in 292 ms
[2020-06-03 16:40:46] [INFO ] Deduced a trap composed of 25 places in 261 ms
[2020-06-03 16:40:47] [INFO ] Deduced a trap composed of 33 places in 249 ms
[2020-06-03 16:40:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1327 ms
[2020-06-03 16:40:47] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-06-03 16:40:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2020-06-03 16:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:52] [INFO ] [Real]Absence check using state equation in 5246 ms returned sat
[2020-06-03 16:40:53] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2020-06-03 16:40:53] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-06-03 16:40:53] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2020-06-03 16:40:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 817 ms
[2020-06-03 16:40:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:40:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 87 ms returned sat
[2020-06-03 16:40:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-06-03 16:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:56] [INFO ] [Nat]Absence check using state equation in 2622 ms returned sat
[2020-06-03 16:40:56] [INFO ] Deduced a trap composed of 34 places in 406 ms
[2020-06-03 16:40:57] [INFO ] Deduced a trap composed of 47 places in 359 ms
[2020-06-03 16:40:57] [INFO ] Deduced a trap composed of 19 places in 363 ms
[2020-06-03 16:40:58] [INFO ] Deduced a trap composed of 21 places in 274 ms
[2020-06-03 16:40:58] [INFO ] Deduced a trap composed of 19 places in 295 ms
[2020-06-03 16:40:59] [INFO ] Deduced a trap composed of 54 places in 311 ms
[2020-06-03 16:40:59] [INFO ] Deduced a trap composed of 20 places in 285 ms
[2020-06-03 16:40:59] [INFO ] Deduced a trap composed of 22 places in 293 ms
[2020-06-03 16:41:00] [INFO ] Deduced a trap composed of 34 places in 261 ms
[2020-06-03 16:41:00] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-06-03 16:41:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3894 ms
[2020-06-03 16:41:00] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 46 ms.
[2020-06-03 16:41:09] [INFO ] Added : 385 causal constraints over 77 iterations in 8860 ms. Result :sat
[2020-06-03 16:41:09] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:41:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 16:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:10] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2020-06-03 16:41:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:41:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:41:11] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-06-03 16:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:12] [INFO ] [Nat]Absence check using state equation in 1708 ms returned sat
[2020-06-03 16:41:13] [INFO ] Deduced a trap composed of 12 places in 171 ms
[2020-06-03 16:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2020-06-03 16:41:13] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 49 ms.
[2020-06-03 16:41:19] [INFO ] Added : 315 causal constraints over 64 iterations in 6192 ms. Result :sat
[2020-06-03 16:41:19] [INFO ] Deduced a trap composed of 40 places in 348 ms
[2020-06-03 16:41:20] [INFO ] Deduced a trap composed of 57 places in 300 ms
[2020-06-03 16:41:20] [INFO ] Deduced a trap composed of 33 places in 327 ms
[2020-06-03 16:41:21] [INFO ] Deduced a trap composed of 32 places in 351 ms
[2020-06-03 16:41:21] [INFO ] Deduced a trap composed of 25 places in 405 ms
[2020-06-03 16:41:22] [INFO ] Deduced a trap composed of 55 places in 336 ms
[2020-06-03 16:41:22] [INFO ] Deduced a trap composed of 45 places in 308 ms
[2020-06-03 16:41:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3047 ms
[2020-06-03 16:41:22] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:41:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:24] [INFO ] [Real]Absence check using state equation in 1418 ms returned sat
[2020-06-03 16:41:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:41:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-06-03 16:41:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 131 ms returned sat
[2020-06-03 16:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:28] [INFO ] [Nat]Absence check using state equation in 4177 ms returned sat
[2020-06-03 16:41:29] [INFO ] Deduced a trap composed of 10 places in 350 ms
[2020-06-03 16:41:29] [INFO ] Deduced a trap composed of 14 places in 335 ms
[2020-06-03 16:41:29] [INFO ] Deduced a trap composed of 7 places in 209 ms
[2020-06-03 16:41:30] [INFO ] Deduced a trap composed of 17 places in 218 ms
[2020-06-03 16:41:30] [INFO ] Deduced a trap composed of 24 places in 137 ms
[2020-06-03 16:41:30] [INFO ] Deduced a trap composed of 20 places in 148 ms
[2020-06-03 16:41:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1797 ms
[2020-06-03 16:41:30] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 46 ms.
[2020-06-03 16:41:39] [INFO ] Added : 389 causal constraints over 78 iterations in 9144 ms. Result :sat
[2020-06-03 16:41:39] [INFO ] Deduced a trap composed of 32 places in 276 ms
[2020-06-03 16:41:40] [INFO ] Deduced a trap composed of 32 places in 255 ms
[2020-06-03 16:41:40] [INFO ] Deduced a trap composed of 39 places in 276 ms
[2020-06-03 16:41:41] [INFO ] Deduced a trap composed of 54 places in 254 ms
[2020-06-03 16:41:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1628 ms
[2020-06-03 16:41:41] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:41:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:42] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2020-06-03 16:41:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:41:43] [INFO ] [Nat]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-06-03 16:41:43] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 103 ms returned sat
[2020-06-03 16:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:44] [INFO ] [Nat]Absence check using state equation in 1616 ms returned sat
[2020-06-03 16:41:45] [INFO ] Deduced a trap composed of 23 places in 423 ms
[2020-06-03 16:41:45] [INFO ] Deduced a trap composed of 33 places in 349 ms
[2020-06-03 16:41:46] [INFO ] Deduced a trap composed of 33 places in 552 ms
[2020-06-03 16:41:46] [INFO ] Deduced a trap composed of 35 places in 371 ms
[2020-06-03 16:41:47] [INFO ] Deduced a trap composed of 35 places in 332 ms
[2020-06-03 16:41:47] [INFO ] Deduced a trap composed of 26 places in 328 ms
[2020-06-03 16:41:48] [INFO ] Deduced a trap composed of 23 places in 321 ms
[2020-06-03 16:41:48] [INFO ] Deduced a trap composed of 24 places in 345 ms
[2020-06-03 16:41:48] [INFO ] Deduced a trap composed of 40 places in 362 ms
[2020-06-03 16:41:49] [INFO ] Deduced a trap composed of 31 places in 320 ms
[2020-06-03 16:41:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4269 ms
[2020-06-03 16:41:49] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 46 ms.
[2020-06-03 16:41:54] [INFO ] Added : 232 causal constraints over 47 iterations in 4810 ms. Result :sat
[2020-06-03 16:41:54] [INFO ] Deduced a trap composed of 54 places in 287 ms
[2020-06-03 16:41:54] [INFO ] Deduced a trap composed of 57 places in 284 ms
[2020-06-03 16:41:55] [INFO ] Deduced a trap composed of 60 places in 274 ms
[2020-06-03 16:41:55] [INFO ] Deduced a trap composed of 67 places in 318 ms
[2020-06-03 16:41:55] [INFO ] Deduced a trap composed of 67 places in 289 ms
[2020-06-03 16:41:56] [INFO ] Deduced a trap composed of 31 places in 286 ms
[2020-06-03 16:41:56] [INFO ] Deduced a trap composed of 36 places in 278 ms
[2020-06-03 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2696 ms
[2020-06-03 16:41:56] [INFO ] [Real]Absence check using 39 positive place invariants in 50 ms returned sat
[2020-06-03 16:41:56] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:58] [INFO ] [Real]Absence check using state equation in 1624 ms returned sat
[2020-06-03 16:41:58] [INFO ] Deduced a trap composed of 22 places in 311 ms
[2020-06-03 16:41:59] [INFO ] Deduced a trap composed of 22 places in 304 ms
[2020-06-03 16:41:59] [INFO ] Deduced a trap composed of 24 places in 280 ms
[2020-06-03 16:41:59] [INFO ] Deduced a trap composed of 30 places in 275 ms
[2020-06-03 16:42:00] [INFO ] Deduced a trap composed of 51 places in 276 ms
[2020-06-03 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1715 ms
[2020-06-03 16:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:42:00] [INFO ] [Nat]Absence check using 39 positive place invariants in 73 ms returned sat
[2020-06-03 16:42:00] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 95 ms returned sat
[2020-06-03 16:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:02] [INFO ] [Nat]Absence check using state equation in 1499 ms returned sat
[2020-06-03 16:42:02] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 51 ms.
[2020-06-03 16:42:08] [INFO ] Added : 328 causal constraints over 67 iterations in 6529 ms. Result :sat
[2020-06-03 16:42:09] [INFO ] Deduced a trap composed of 42 places in 317 ms
[2020-06-03 16:42:09] [INFO ] Deduced a trap composed of 55 places in 334 ms
[2020-06-03 16:42:09] [INFO ] Deduced a trap composed of 58 places in 322 ms
[2020-06-03 16:42:10] [INFO ] Deduced a trap composed of 54 places in 356 ms
[2020-06-03 16:42:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1745 ms
[2020-06-03 16:42:10] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:42:10] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 16:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:12] [INFO ] [Real]Absence check using state equation in 1605 ms returned sat
[2020-06-03 16:42:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:42:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 16:42:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 91 ms returned sat
[2020-06-03 16:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:14] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2020-06-03 16:42:14] [INFO ] Deduced a trap composed of 14 places in 335 ms
[2020-06-03 16:42:14] [INFO ] Deduced a trap composed of 10 places in 329 ms
[2020-06-03 16:42:15] [INFO ] Deduced a trap composed of 21 places in 362 ms
[2020-06-03 16:42:15] [INFO ] Deduced a trap composed of 33 places in 369 ms
[2020-06-03 16:42:16] [INFO ] Deduced a trap composed of 20 places in 347 ms
[2020-06-03 16:42:16] [INFO ] Deduced a trap composed of 33 places in 317 ms
[2020-06-03 16:42:16] [INFO ] Deduced a trap composed of 33 places in 327 ms
[2020-06-03 16:42:17] [INFO ] Deduced a trap composed of 44 places in 379 ms
[2020-06-03 16:42:17] [INFO ] Deduced a trap composed of 24 places in 127 ms
[2020-06-03 16:42:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3397 ms
[2020-06-03 16:42:17] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 46 ms.
[2020-06-03 16:42:28] [INFO ] Added : 428 causal constraints over 86 iterations in 11121 ms. Result :sat
[2020-06-03 16:42:28] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2020-06-03 16:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2020-06-03 16:42:29] [INFO ] [Real]Absence check using 39 positive place invariants in 50 ms returned sat
[2020-06-03 16:42:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:30] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2020-06-03 16:42:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:42:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:42:31] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-06-03 16:42:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:33] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2020-06-03 16:42:33] [INFO ] Deduced a trap composed of 21 places in 291 ms
[2020-06-03 16:42:33] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-06-03 16:42:34] [INFO ] Deduced a trap composed of 25 places in 281 ms
[2020-06-03 16:42:34] [INFO ] Deduced a trap composed of 19 places in 233 ms
[2020-06-03 16:42:34] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-06-03 16:42:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1744 ms
[2020-06-03 16:42:34] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:42:41] [INFO ] Added : 364 causal constraints over 73 iterations in 6965 ms. Result :sat
[2020-06-03 16:42:42] [INFO ] Deduced a trap composed of 36 places in 290 ms
[2020-06-03 16:42:42] [INFO ] Deduced a trap composed of 33 places in 267 ms
[2020-06-03 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 843 ms
[2020-06-03 16:42:42] [INFO ] [Real]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-06-03 16:42:42] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:44] [INFO ] [Real]Absence check using state equation in 1782 ms returned sat
[2020-06-03 16:42:44] [INFO ] Deduced a trap composed of 12 places in 271 ms
[2020-06-03 16:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2020-06-03 16:42:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:42:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:42:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 204 ms returned sat
[2020-06-03 16:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:47] [INFO ] [Nat]Absence check using state equation in 1814 ms returned sat
[2020-06-03 16:42:47] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-06-03 16:42:47] [INFO ] Deduced a trap composed of 17 places in 259 ms
[2020-06-03 16:42:48] [INFO ] Deduced a trap composed of 31 places in 211 ms
[2020-06-03 16:42:48] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-06-03 16:42:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1158 ms
[2020-06-03 16:42:48] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 47 ms.
[2020-06-03 16:42:56] [INFO ] Added : 343 causal constraints over 69 iterations in 7550 ms. Result :sat
[2020-06-03 16:42:56] [INFO ] Deduced a trap composed of 50 places in 322 ms
[2020-06-03 16:42:56] [INFO ] Deduced a trap composed of 55 places in 325 ms
[2020-06-03 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1013 ms
[2020-06-03 16:42:57] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:42:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:42:58] [INFO ] [Real]Absence check using state equation in 1559 ms returned sat
[2020-06-03 16:42:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:42:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-06-03 16:42:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2020-06-03 16:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:00] [INFO ] [Nat]Absence check using state equation in 1804 ms returned sat
[2020-06-03 16:43:01] [INFO ] Deduced a trap composed of 23 places in 319 ms
[2020-06-03 16:43:01] [INFO ] Deduced a trap composed of 22 places in 315 ms
[2020-06-03 16:43:02] [INFO ] Deduced a trap composed of 33 places in 308 ms
[2020-06-03 16:43:02] [INFO ] Deduced a trap composed of 24 places in 188 ms
[2020-06-03 16:43:02] [INFO ] Deduced a trap composed of 28 places in 146 ms
[2020-06-03 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1568 ms
[2020-06-03 16:43:02] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 45 ms.
[2020-06-03 16:43:10] [INFO ] Added : 361 causal constraints over 73 iterations in 8089 ms. Result :sat
[2020-06-03 16:43:11] [INFO ] Deduced a trap composed of 49 places in 319 ms
[2020-06-03 16:43:11] [INFO ] Deduced a trap composed of 54 places in 314 ms
[2020-06-03 16:43:11] [INFO ] Deduced a trap composed of 39 places in 297 ms
[2020-06-03 16:43:12] [INFO ] Deduced a trap composed of 49 places in 272 ms
[2020-06-03 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1919 ms
[2020-06-03 16:43:12] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:43:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-06-03 16:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:14] [INFO ] [Real]Absence check using state equation in 1451 ms returned sat
[2020-06-03 16:43:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:43:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:43:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-06-03 16:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:16] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2020-06-03 16:43:16] [INFO ] Deduced a trap composed of 12 places in 335 ms
[2020-06-03 16:43:16] [INFO ] Deduced a trap composed of 8 places in 293 ms
[2020-06-03 16:43:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 761 ms
[2020-06-03 16:43:16] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 44 ms.
[2020-06-03 16:43:22] [INFO ] Added : 295 causal constraints over 60 iterations in 6020 ms. Result :sat
[2020-06-03 16:43:23] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 16:43:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 16:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:25] [INFO ] [Real]Absence check using state equation in 1793 ms returned sat
[2020-06-03 16:43:25] [INFO ] Deduced a trap composed of 15 places in 383 ms
[2020-06-03 16:43:25] [INFO ] Deduced a trap composed of 15 places in 405 ms
[2020-06-03 16:43:26] [INFO ] Deduced a trap composed of 22 places in 302 ms
[2020-06-03 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1301 ms
[2020-06-03 16:43:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:43:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 16:43:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 102 ms returned sat
[2020-06-03 16:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:28] [INFO ] [Nat]Absence check using state equation in 2212 ms returned sat
[2020-06-03 16:43:29] [INFO ] Deduced a trap composed of 9 places in 356 ms
[2020-06-03 16:43:29] [INFO ] Deduced a trap composed of 17 places in 389 ms
[2020-06-03 16:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 910 ms
[2020-06-03 16:43:29] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 61 ms.
[2020-06-03 16:43:36] [INFO ] Added : 260 causal constraints over 53 iterations in 6530 ms. Result :sat
[2020-06-03 16:43:36] [INFO ] Deduced a trap composed of 53 places in 316 ms
[2020-06-03 16:43:37] [INFO ] Deduced a trap composed of 55 places in 299 ms
[2020-06-03 16:43:37] [INFO ] Deduced a trap composed of 51 places in 310 ms
[2020-06-03 16:43:37] [INFO ] Deduced a trap composed of 53 places in 254 ms
[2020-06-03 16:43:38] [INFO ] Deduced a trap composed of 45 places in 267 ms
[2020-06-03 16:43:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1959 ms
[2020-06-03 16:43:38] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 16:43:38] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:40] [INFO ] [Real]Absence check using state equation in 1642 ms returned sat
[2020-06-03 16:43:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:43:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:43:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 150 ms returned sat
[2020-06-03 16:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:42] [INFO ] [Nat]Absence check using state equation in 2000 ms returned sat
[2020-06-03 16:43:42] [INFO ] Deduced a trap composed of 19 places in 351 ms
[2020-06-03 16:43:43] [INFO ] Deduced a trap composed of 23 places in 325 ms
[2020-06-03 16:43:43] [INFO ] Deduced a trap composed of 21 places in 344 ms
[2020-06-03 16:43:44] [INFO ] Deduced a trap composed of 23 places in 345 ms
[2020-06-03 16:43:44] [INFO ] Deduced a trap composed of 27 places in 389 ms
[2020-06-03 16:43:45] [INFO ] Deduced a trap composed of 7 places in 348 ms
[2020-06-03 16:43:45] [INFO ] Deduced a trap composed of 24 places in 327 ms
[2020-06-03 16:43:45] [INFO ] Deduced a trap composed of 18 places in 322 ms
[2020-06-03 16:43:46] [INFO ] Deduced a trap composed of 56 places in 322 ms
[2020-06-03 16:43:46] [INFO ] Deduced a trap composed of 38 places in 120 ms
[2020-06-03 16:43:46] [INFO ] Deduced a trap composed of 41 places in 136 ms
[2020-06-03 16:43:46] [INFO ] Deduced a trap composed of 38 places in 143 ms
[2020-06-03 16:43:47] [INFO ] Deduced a trap composed of 20 places in 292 ms
[2020-06-03 16:43:47] [INFO ] Deduced a trap composed of 33 places in 315 ms
[2020-06-03 16:43:47] [INFO ] Deduced a trap composed of 40 places in 337 ms
[2020-06-03 16:43:47] [INFO ] Deduced a trap composed of 39 places in 105 ms
[2020-06-03 16:43:48] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-06-03 16:43:48] [INFO ] Deduced a trap composed of 40 places in 199 ms
[2020-06-03 16:43:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5936 ms
[2020-06-03 16:43:48] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 47 ms.
[2020-06-03 16:43:59] [INFO ] Added : 446 causal constraints over 90 iterations in 10699 ms. Result :sat
[2020-06-03 16:43:59] [INFO ] Deduced a trap composed of 37 places in 260 ms
[2020-06-03 16:43:59] [INFO ] Deduced a trap composed of 65 places in 221 ms
[2020-06-03 16:44:00] [INFO ] Deduced a trap composed of 52 places in 199 ms
[2020-06-03 16:44:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:44:00] [INFO ] Deduced a trap composed of 9 places in 373 ms
[2020-06-03 16:44:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s248 s366 s367 s368 s369 s370 s373 s374) 0)") while checking expression at index 27
[2020-06-03 16:44:00] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:44:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:44:02] [INFO ] [Real]Absence check using state equation in 1381 ms returned sat
[2020-06-03 16:44:02] [INFO ] Deduced a trap composed of 14 places in 267 ms
[2020-06-03 16:44:02] [INFO ] Deduced a trap composed of 15 places in 242 ms
[2020-06-03 16:44:03] [INFO ] Deduced a trap composed of 22 places in 262 ms
[2020-06-03 16:44:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 995 ms
[2020-06-03 16:44:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:44:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 87 ms returned sat
[2020-06-03 16:44:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:44:04] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2020-06-03 16:44:05] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-06-03 16:44:05] [INFO ] Deduced a trap composed of 15 places in 120 ms
[2020-06-03 16:44:05] [INFO ] Deduced a trap composed of 14 places in 122 ms
[2020-06-03 16:44:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2020-06-03 16:44:05] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 53 ms.
[2020-06-03 16:44:13] [INFO ] Added : 462 causal constraints over 94 iterations in 7705 ms. Result :sat
[2020-06-03 16:44:13] [INFO ] Deduced a trap composed of 33 places in 266 ms
[2020-06-03 16:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2020-06-03 16:44:13] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:44:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-06-03 16:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:44:16] [INFO ] [Real]Absence check using state equation in 2904 ms returned sat
[2020-06-03 16:44:17] [INFO ] Deduced a trap composed of 15 places in 358 ms
[2020-06-03 16:44:17] [INFO ] Deduced a trap composed of 12 places in 303 ms
[2020-06-03 16:44:17] [INFO ] Deduced a trap composed of 8 places in 222 ms
[2020-06-03 16:44:18] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2020-06-03 16:44:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1286 ms
[2020-06-03 16:44:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:44:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-06-03 16:44:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2020-06-03 16:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:44:20] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2020-06-03 16:44:20] [INFO ] Deduced a trap composed of 12 places in 271 ms
[2020-06-03 16:44:20] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2020-06-03 16:44:21] [INFO ] Deduced a trap composed of 8 places in 246 ms
[2020-06-03 16:44:21] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 16:44:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1229 ms
[2020-06-03 16:44:21] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 45 ms.
[2020-06-03 16:44:29] [INFO ] Added : 423 causal constraints over 86 iterations in 8488 ms. Result :sat
[2020-06-03 16:44:30] [INFO ] Deduced a trap composed of 36 places in 220 ms
[2020-06-03 16:44:30] [INFO ] Deduced a trap composed of 34 places in 187 ms
[2020-06-03 16:44:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 671 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 16:44:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 16:44:30] [INFO ] Flatten gal took : 162 ms
[2020-06-03 16:44:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 16:44:31] [INFO ] Flatten gal took : 77 ms
FORMULA DES-PT-60b-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:44:31] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2020-06-03 16:44:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DES-PT-60b @ 3570 seconds
FORMULA DES-PT-60b-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-CTLFireability-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: 16427480 kB
MemFree: 15302572 kB
After kill :
MemTotal: 16427480 kB
MemFree: 16137408 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="DES-PT-60b"
export BK_EXAMINATION="CTLFireability"
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 DES-PT-60b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;