About the Execution of ITS-LoLa for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.450 | 3600000.00 | 3646219.00 | 1174.80 | FFF?FFFTFTFFF?FT | 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-158987900000314.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-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 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.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 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 127K 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-50b-00
FORMULA_NAME DES-PT-50b-01
FORMULA_NAME DES-PT-50b-02
FORMULA_NAME DES-PT-50b-03
FORMULA_NAME DES-PT-50b-04
FORMULA_NAME DES-PT-50b-05
FORMULA_NAME DES-PT-50b-06
FORMULA_NAME DES-PT-50b-07
FORMULA_NAME DES-PT-50b-08
FORMULA_NAME DES-PT-50b-09
FORMULA_NAME DES-PT-50b-10
FORMULA_NAME DES-PT-50b-11
FORMULA_NAME DES-PT-50b-12
FORMULA_NAME DES-PT-50b-13
FORMULA_NAME DES-PT-50b-14
FORMULA_NAME DES-PT-50b-15
=== Now, execution of the tool begins
BK_START 1591197057109
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:11:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:11:00] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-06-03 15:11:00] [INFO ] Transformed 479 places.
[2020-06-03 15:11:00] [INFO ] Transformed 430 transitions.
[2020-06-03 15:11:00] [INFO ] Found NUPN structural information;
[2020-06-03 15:11:00] [INFO ] Parsed PT model containing 479 places and 430 transitions in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 842 resets, run finished after 651 ms. (steps per millisecond=153 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2020-06-03 15:11:01] [INFO ] Computed 65 place invariants in 105 ms
[2020-06-03 15:11:01] [INFO ] [Real]Absence check using 40 positive place invariants in 78 ms returned sat
[2020-06-03 15:11:01] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 15:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:02] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2020-06-03 15:11:03] [INFO ] Deduced a trap composed of 18 places in 379 ms
[2020-06-03 15:11:03] [INFO ] Deduced a trap composed of 13 places in 335 ms
[2020-06-03 15:11:04] [INFO ] Deduced a trap composed of 16 places in 286 ms
[2020-06-03 15:11:04] [INFO ] Deduced a trap composed of 18 places in 204 ms
[2020-06-03 15:11:04] [INFO ] Deduced a trap composed of 18 places in 181 ms
[2020-06-03 15:11:04] [INFO ] Deduced a trap composed of 19 places in 145 ms
[2020-06-03 15:11:05] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-06-03 15:11:05] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2020-06-03 15:11:05] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-03 15:11:05] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 15:11:05] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-06-03 15:11:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2618 ms
[2020-06-03 15:11:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:11:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 184 ms returned sat
[2020-06-03 15:11:06] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 15:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:07] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2020-06-03 15:11:07] [INFO ] Deduced a trap composed of 18 places in 309 ms
[2020-06-03 15:11:07] [INFO ] Deduced a trap composed of 13 places in 271 ms
[2020-06-03 15:11:08] [INFO ] Deduced a trap composed of 22 places in 255 ms
[2020-06-03 15:11:08] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-06-03 15:11:08] [INFO ] Deduced a trap composed of 18 places in 266 ms
[2020-06-03 15:11:08] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-06-03 15:11:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1770 ms
[2020-06-03 15:11:09] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 57 ms.
[2020-06-03 15:11:16] [INFO ] Added : 420 causal constraints over 84 iterations in 7713 ms. Result :sat
[2020-06-03 15:11:16] [INFO ] Deduced a trap composed of 47 places in 216 ms
[2020-06-03 15:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2020-06-03 15:11:17] [INFO ] [Real]Absence check using 40 positive place invariants in 61 ms returned sat
[2020-06-03 15:11:17] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 15:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:18] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2020-06-03 15:11:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:11:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 86 ms returned sat
[2020-06-03 15:11:18] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 15:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:20] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2020-06-03 15:11:20] [INFO ] Deduced a trap composed of 9 places in 252 ms
[2020-06-03 15:11:20] [INFO ] Deduced a trap composed of 14 places in 250 ms
[2020-06-03 15:11:20] [INFO ] Deduced a trap composed of 23 places in 218 ms
[2020-06-03 15:11:21] [INFO ] Deduced a trap composed of 14 places in 237 ms
[2020-06-03 15:11:21] [INFO ] Deduced a trap composed of 14 places in 215 ms
[2020-06-03 15:11:21] [INFO ] Deduced a trap composed of 16 places in 247 ms
[2020-06-03 15:11:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1729 ms
[2020-06-03 15:11:21] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 55 ms.
[2020-06-03 15:11:25] [INFO ] Added : 264 causal constraints over 53 iterations in 4212 ms. Result :sat
[2020-06-03 15:11:26] [INFO ] Deduced a trap composed of 59 places in 311 ms
[2020-06-03 15:11:26] [INFO ] Deduced a trap composed of 42 places in 292 ms
[2020-06-03 15:11:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 888 ms
[2020-06-03 15:11:27] [INFO ] [Real]Absence check using 40 positive place invariants in 56 ms returned sat
[2020-06-03 15:11:27] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 15:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:28] [INFO ] [Real]Absence check using state equation in 1374 ms returned sat
[2020-06-03 15:11:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:11:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 153 ms returned sat
[2020-06-03 15:11:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 92 ms returned sat
[2020-06-03 15:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:30] [INFO ] [Nat]Absence check using state equation in 2013 ms returned sat
[2020-06-03 15:11:31] [INFO ] Deduced a trap composed of 17 places in 212 ms
[2020-06-03 15:11:31] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-06-03 15:11:31] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-03 15:11:31] [INFO ] Deduced a trap composed of 33 places in 118 ms
[2020-06-03 15:11:31] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-06-03 15:11:32] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-06-03 15:11:32] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2020-06-03 15:11:32] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-03 15:11:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1504 ms
[2020-06-03 15:11:32] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 52 ms.
[2020-06-03 15:11:39] [INFO ] Added : 387 causal constraints over 79 iterations in 6726 ms. Result :sat
[2020-06-03 15:11:39] [INFO ] Deduced a trap composed of 42 places in 257 ms
[2020-06-03 15:11:39] [INFO ] Deduced a trap composed of 28 places in 250 ms
[2020-06-03 15:11:40] [INFO ] Deduced a trap composed of 36 places in 236 ms
[2020-06-03 15:11:40] [INFO ] Deduced a trap composed of 57 places in 203 ms
[2020-06-03 15:11:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1409 ms
[2020-06-03 15:11:40] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2020-06-03 15:11:40] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 15:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:42] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2020-06-03 15:11:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:11:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 155 ms returned sat
[2020-06-03 15:11:42] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 74 ms returned sat
[2020-06-03 15:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:44] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2020-06-03 15:11:44] [INFO ] Deduced a trap composed of 12 places in 277 ms
[2020-06-03 15:11:44] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-06-03 15:11:44] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-03 15:11:44] [INFO ] Deduced a trap composed of 24 places in 120 ms
[2020-06-03 15:11:45] [INFO ] Deduced a trap composed of 30 places in 88 ms
[2020-06-03 15:11:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1010 ms
[2020-06-03 15:11:45] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 43 ms.
[2020-06-03 15:11:52] [INFO ] Added : 361 causal constraints over 73 iterations in 7279 ms. Result :sat
[2020-06-03 15:11:52] [INFO ] Deduced a trap composed of 60 places in 217 ms
[2020-06-03 15:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2020-06-03 15:11:52] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2020-06-03 15:11:52] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 15:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:54] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2020-06-03 15:11:54] [INFO ] Deduced a trap composed of 8 places in 352 ms
[2020-06-03 15:11:54] [INFO ] Deduced a trap composed of 13 places in 265 ms
[2020-06-03 15:11:55] [INFO ] Deduced a trap composed of 14 places in 213 ms
[2020-06-03 15:11:55] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-06-03 15:11:55] [INFO ] Deduced a trap composed of 20 places in 201 ms
[2020-06-03 15:11:55] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-06-03 15:11:55] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-06-03 15:11:56] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-06-03 15:11:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2120 ms
[2020-06-03 15:11:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:11:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 152 ms returned sat
[2020-06-03 15:11:56] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 15:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:11:57] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2020-06-03 15:11:58] [INFO ] Deduced a trap composed of 8 places in 391 ms
[2020-06-03 15:11:58] [INFO ] Deduced a trap composed of 20 places in 316 ms
[2020-06-03 15:11:58] [INFO ] Deduced a trap composed of 12 places in 285 ms
[2020-06-03 15:11:59] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2020-06-03 15:11:59] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 15:11:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1494 ms
[2020-06-03 15:11:59] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 52 ms.
[2020-06-03 15:12:06] [INFO ] Added : 406 causal constraints over 82 iterations in 6905 ms. Result :sat
[2020-06-03 15:12:06] [INFO ] Deduced a trap composed of 28 places in 272 ms
[2020-06-03 15:12:06] [INFO ] Deduced a trap composed of 58 places in 248 ms
[2020-06-03 15:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1304 ms
[2020-06-03 15:12:07] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2020-06-03 15:12:07] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 15:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:08] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2020-06-03 15:12:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:12:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2020-06-03 15:12:09] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 87 ms returned sat
[2020-06-03 15:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:10] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2020-06-03 15:12:10] [INFO ] Deduced a trap composed of 8 places in 276 ms
[2020-06-03 15:12:11] [INFO ] Deduced a trap composed of 12 places in 217 ms
[2020-06-03 15:12:11] [INFO ] Deduced a trap composed of 36 places in 224 ms
[2020-06-03 15:12:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 923 ms
[2020-06-03 15:12:11] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 53 ms.
[2020-06-03 15:12:16] [INFO ] Added : 302 causal constraints over 62 iterations in 5100 ms. Result :sat
[2020-06-03 15:12:16] [INFO ] Deduced a trap composed of 31 places in 191 ms
[2020-06-03 15:12:17] [INFO ] Deduced a trap composed of 43 places in 195 ms
[2020-06-03 15:12:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2020-06-03 15:12:17] [INFO ] [Real]Absence check using 40 positive place invariants in 85 ms returned sat
[2020-06-03 15:12:17] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 61 ms returned sat
[2020-06-03 15:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:18] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2020-06-03 15:12:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:12:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 15:12:19] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 66 ms returned sat
[2020-06-03 15:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:20] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2020-06-03 15:12:20] [INFO ] Deduced a trap composed of 8 places in 265 ms
[2020-06-03 15:12:20] [INFO ] Deduced a trap composed of 20 places in 206 ms
[2020-06-03 15:12:21] [INFO ] Deduced a trap composed of 12 places in 204 ms
[2020-06-03 15:12:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 844 ms
[2020-06-03 15:12:21] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 43 ms.
[2020-06-03 15:12:26] [INFO ] Added : 331 causal constraints over 67 iterations in 5217 ms. Result :sat
[2020-06-03 15:12:26] [INFO ] Deduced a trap composed of 52 places in 234 ms
[2020-06-03 15:12:26] [INFO ] Deduced a trap composed of 45 places in 187 ms
[2020-06-03 15:12:27] [INFO ] Deduced a trap composed of 58 places in 216 ms
[2020-06-03 15:12:27] [INFO ] Deduced a trap composed of 61 places in 216 ms
[2020-06-03 15:12:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1219 ms
[2020-06-03 15:12:27] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-06-03 15:12:27] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 15:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:29] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2020-06-03 15:12:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:12:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 92 ms returned sat
[2020-06-03 15:12:29] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 83 ms returned sat
[2020-06-03 15:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:30] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2020-06-03 15:12:31] [INFO ] Deduced a trap composed of 8 places in 359 ms
[2020-06-03 15:12:31] [INFO ] Deduced a trap composed of 12 places in 354 ms
[2020-06-03 15:12:31] [INFO ] Deduced a trap composed of 33 places in 254 ms
[2020-06-03 15:12:32] [INFO ] Deduced a trap composed of 27 places in 285 ms
[2020-06-03 15:12:32] [INFO ] Deduced a trap composed of 29 places in 207 ms
[2020-06-03 15:12:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1765 ms
[2020-06-03 15:12:32] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-06-03 15:12:37] [INFO ] Added : 274 causal constraints over 56 iterations in 5159 ms. Result :sat
[2020-06-03 15:12:38] [INFO ] Deduced a trap composed of 62 places in 244 ms
[2020-06-03 15:12:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2020-06-03 15:12:38] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-06-03 15:12:38] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 15:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:39] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2020-06-03 15:12:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:12:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 160 ms returned sat
[2020-06-03 15:12:39] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 87 ms returned sat
[2020-06-03 15:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:41] [INFO ] [Nat]Absence check using state equation in 1809 ms returned sat
[2020-06-03 15:12:42] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-06-03 15:12:42] [INFO ] Deduced a trap composed of 17 places in 175 ms
[2020-06-03 15:12:42] [INFO ] Deduced a trap composed of 10 places in 139 ms
[2020-06-03 15:12:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 748 ms
[2020-06-03 15:12:42] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-06-03 15:12:49] [INFO ] Added : 377 causal constraints over 76 iterations in 6575 ms. Result :sat
[2020-06-03 15:12:49] [INFO ] [Real]Absence check using 40 positive place invariants in 66 ms returned sat
[2020-06-03 15:12:49] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 15:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:50] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2020-06-03 15:12:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:12:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 91 ms returned sat
[2020-06-03 15:12:50] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 15:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:12:52] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2020-06-03 15:12:52] [INFO ] Deduced a trap composed of 16 places in 220 ms
[2020-06-03 15:12:52] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2020-06-03 15:12:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2020-06-03 15:12:52] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 39 ms.
[2020-06-03 15:12:59] [INFO ] Added : 407 causal constraints over 83 iterations in 6982 ms. Result :sat
[2020-06-03 15:12:59] [INFO ] [Real]Absence check using 40 positive place invariants in 58 ms returned sat
[2020-06-03 15:12:59] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 15:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:01] [INFO ] [Real]Absence check using state equation in 1207 ms returned sat
[2020-06-03 15:13:01] [INFO ] Deduced a trap composed of 16 places in 258 ms
[2020-06-03 15:13:01] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-06-03 15:13:01] [INFO ] Deduced a trap composed of 16 places in 189 ms
[2020-06-03 15:13:02] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-06-03 15:13:02] [INFO ] Deduced a trap composed of 20 places in 182 ms
[2020-06-03 15:13:02] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-06-03 15:13:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1505 ms
[2020-06-03 15:13:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:13:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 15:13:02] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 84 ms returned sat
[2020-06-03 15:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:04] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2020-06-03 15:13:04] [INFO ] Deduced a trap composed of 10 places in 265 ms
[2020-06-03 15:13:04] [INFO ] Deduced a trap composed of 30 places in 240 ms
[2020-06-03 15:13:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2020-06-03 15:13:05] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 38 ms.
[2020-06-03 15:13:11] [INFO ] Added : 399 causal constraints over 81 iterations in 6551 ms. Result :sat
[2020-06-03 15:13:11] [INFO ] Deduced a trap composed of 55 places in 307 ms
[2020-06-03 15:13:12] [INFO ] Deduced a trap composed of 32 places in 305 ms
[2020-06-03 15:13:12] [INFO ] Deduced a trap composed of 24 places in 308 ms
[2020-06-03 15:13:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1381 ms
[2020-06-03 15:13:13] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2020-06-03 15:13:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:14] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2020-06-03 15:13:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:13:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 163 ms returned sat
[2020-06-03 15:13:14] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 88 ms returned sat
[2020-06-03 15:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:16] [INFO ] [Nat]Absence check using state equation in 1422 ms returned sat
[2020-06-03 15:13:16] [INFO ] Deduced a trap composed of 43 places in 319 ms
[2020-06-03 15:13:16] [INFO ] Deduced a trap composed of 8 places in 245 ms
[2020-06-03 15:13:17] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-06-03 15:13:17] [INFO ] Deduced a trap composed of 24 places in 208 ms
[2020-06-03 15:13:17] [INFO ] Deduced a trap composed of 32 places in 174 ms
[2020-06-03 15:13:17] [INFO ] Deduced a trap composed of 33 places in 172 ms
[2020-06-03 15:13:18] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-06-03 15:13:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1894 ms
[2020-06-03 15:13:18] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 42 ms.
[2020-06-03 15:13:22] [INFO ] Added : 230 causal constraints over 46 iterations in 4914 ms. Result :sat
[2020-06-03 15:13:23] [INFO ] Deduced a trap composed of 50 places in 255 ms
[2020-06-03 15:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2020-06-03 15:13:23] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-06-03 15:13:23] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 15:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:25] [INFO ] [Real]Absence check using state equation in 1398 ms returned sat
[2020-06-03 15:13:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:13:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 163 ms returned sat
[2020-06-03 15:13:25] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 15:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:26] [INFO ] [Nat]Absence check using state equation in 1551 ms returned sat
[2020-06-03 15:13:27] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-06-03 15:13:27] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-06-03 15:13:27] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-06-03 15:13:27] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-06-03 15:13:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 879 ms
[2020-06-03 15:13:27] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 31 ms.
[2020-06-03 15:13:33] [INFO ] Added : 295 causal constraints over 60 iterations in 5400 ms. Result :sat
[2020-06-03 15:13:33] [INFO ] Deduced a trap composed of 45 places in 298 ms
[2020-06-03 15:13:33] [INFO ] Deduced a trap composed of 55 places in 273 ms
[2020-06-03 15:13:34] [INFO ] Deduced a trap composed of 49 places in 229 ms
[2020-06-03 15:13:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1190 ms
[2020-06-03 15:13:34] [INFO ] [Real]Absence check using 40 positive place invariants in 66 ms returned sat
[2020-06-03 15:13:34] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 60 ms returned sat
[2020-06-03 15:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:35] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2020-06-03 15:13:36] [INFO ] Deduced a trap composed of 17 places in 331 ms
[2020-06-03 15:13:36] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-06-03 15:13:36] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-06-03 15:13:37] [INFO ] Deduced a trap composed of 21 places in 176 ms
[2020-06-03 15:13:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1213 ms
[2020-06-03 15:13:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:13:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 154 ms returned sat
[2020-06-03 15:13:37] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 15:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:38] [INFO ] [Nat]Absence check using state equation in 1169 ms returned sat
[2020-06-03 15:13:38] [INFO ] Deduced a trap composed of 17 places in 262 ms
[2020-06-03 15:13:39] [INFO ] Deduced a trap composed of 13 places in 249 ms
[2020-06-03 15:13:39] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-06-03 15:13:39] [INFO ] Deduced a trap composed of 19 places in 150 ms
[2020-06-03 15:13:39] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-06-03 15:13:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1237 ms
[2020-06-03 15:13:39] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 44 ms.
[2020-06-03 15:13:47] [INFO ] Added : 378 causal constraints over 76 iterations in 7714 ms. Result :sat
[2020-06-03 15:13:47] [INFO ] [Real]Absence check using 40 positive place invariants in 61 ms returned sat
[2020-06-03 15:13:47] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 15:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:49] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2020-06-03 15:13:49] [INFO ] Deduced a trap composed of 17 places in 312 ms
[2020-06-03 15:13:49] [INFO ] Deduced a trap composed of 14 places in 253 ms
[2020-06-03 15:13:50] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 15:13:50] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-06-03 15:13:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1160 ms
[2020-06-03 15:13:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:13:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 158 ms returned sat
[2020-06-03 15:13:50] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 15:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:13:51] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2020-06-03 15:13:52] [INFO ] Deduced a trap composed of 17 places in 354 ms
[2020-06-03 15:13:52] [INFO ] Deduced a trap composed of 13 places in 280 ms
[2020-06-03 15:13:52] [INFO ] Deduced a trap composed of 18 places in 181 ms
[2020-06-03 15:13:52] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-06-03 15:13:53] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 15:13:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1427 ms
[2020-06-03 15:13:53] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 53 ms.
[2020-06-03 15:14:01] [INFO ] Added : 378 causal constraints over 76 iterations in 8203 ms. Result :sat
[2020-06-03 15:14:01] [INFO ] [Real]Absence check using 40 positive place invariants in 53 ms returned sat
[2020-06-03 15:14:01] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:03] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2020-06-03 15:14:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:14:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 15:14:03] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 87 ms returned sat
[2020-06-03 15:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:04] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2020-06-03 15:14:04] [INFO ] Deduced a trap composed of 14 places in 258 ms
[2020-06-03 15:14:05] [INFO ] Deduced a trap composed of 9 places in 205 ms
[2020-06-03 15:14:05] [INFO ] Deduced a trap composed of 21 places in 208 ms
[2020-06-03 15:14:05] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-06-03 15:14:05] [INFO ] Deduced a trap composed of 10 places in 186 ms
[2020-06-03 15:14:06] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-06-03 15:14:06] [INFO ] Deduced a trap composed of 28 places in 187 ms
[2020-06-03 15:14:06] [INFO ] Deduced a trap composed of 30 places in 199 ms
[2020-06-03 15:14:06] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-06-03 15:14:06] [INFO ] Deduced a trap composed of 33 places in 157 ms
[2020-06-03 15:14:07] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-06-03 15:14:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2564 ms
[2020-06-03 15:14:07] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 42 ms.
[2020-06-03 15:14:11] [INFO ] Added : 293 causal constraints over 59 iterations in 4525 ms. Result :sat
[2020-06-03 15:14:12] [INFO ] Deduced a trap composed of 54 places in 278 ms
[2020-06-03 15:14:12] [INFO ] Deduced a trap composed of 34 places in 248 ms
[2020-06-03 15:14:12] [INFO ] Deduced a trap composed of 45 places in 264 ms
[2020-06-03 15:14:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1253 ms
[2020-06-03 15:14:13] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-06-03 15:14:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 15:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:14] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2020-06-03 15:14:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:14:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 171 ms returned sat
[2020-06-03 15:14:14] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 92 ms returned sat
[2020-06-03 15:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:16] [INFO ] [Nat]Absence check using state equation in 1750 ms returned sat
[2020-06-03 15:14:16] [INFO ] Deduced a trap composed of 20 places in 343 ms
[2020-06-03 15:14:17] [INFO ] Deduced a trap composed of 31 places in 290 ms
[2020-06-03 15:14:17] [INFO ] Deduced a trap composed of 39 places in 176 ms
[2020-06-03 15:14:17] [INFO ] Deduced a trap composed of 23 places in 164 ms
[2020-06-03 15:14:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1293 ms
[2020-06-03 15:14:17] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 46 ms.
[2020-06-03 15:14:23] [INFO ] Added : 265 causal constraints over 54 iterations in 5443 ms. Result :sat
[2020-06-03 15:14:23] [INFO ] Deduced a trap composed of 72 places in 267 ms
[2020-06-03 15:14:23] [INFO ] Deduced a trap composed of 38 places in 196 ms
[2020-06-03 15:14:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 807 ms
[2020-06-03 15:14:24] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-06-03 15:14:24] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 60 ms returned sat
[2020-06-03 15:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:26] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2020-06-03 15:14:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:14:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 111 ms returned sat
[2020-06-03 15:14:26] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 111 ms returned sat
[2020-06-03 15:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:14:28] [INFO ] [Nat]Absence check using state equation in 1803 ms returned sat
[2020-06-03 15:14:28] [INFO ] Deduced a trap composed of 22 places in 277 ms
[2020-06-03 15:14:29] [INFO ] Deduced a trap composed of 16 places in 237 ms
[2020-06-03 15:14:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2020-06-03 15:14:29] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-06-03 15:14:34] [INFO ] Added : 256 causal constraints over 52 iterations in 5312 ms. Result :sat
[2020-06-03 15:14:34] [INFO ] Deduced a trap composed of 62 places in 289 ms
[2020-06-03 15:14:35] [INFO ] Deduced a trap composed of 60 places in 248 ms
[2020-06-03 15:14:35] [INFO ] Deduced a trap composed of 68 places in 240 ms
[2020-06-03 15:14:35] [INFO ] Deduced a trap composed of 66 places in 260 ms
[2020-06-03 15:14:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1834 ms
[2020-06-03 15:14:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 15:14:36] [INFO ] Flatten gal took : 148 ms
FORMULA DES-PT-50b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:14:36] [INFO ] Applying decomposition
[2020-06-03 15:14:36] [INFO ] Flatten gal took : 70 ms
[2020-06-03 15:14:36] [INFO ] Decomposing Gal with order
[2020-06-03 15:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 15:14:37] [INFO ] Removed a total of 217 redundant transitions.
[2020-06-03 15:14:37] [INFO ] Flatten gal took : 210 ms
[2020-06-03 15:14:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 78 ms.
[2020-06-03 15:14:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2020-06-03 15:14:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-50b @ 3570 seconds
FORMULA DES-PT-50b-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 9319888 kB
After kill :
MemTotal: 16427488 kB
MemFree: 9321552 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-50b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-50b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;