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.r051-ebro-158902546000300.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-40b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 115K 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-40b-CTLFireability-00
FORMULA_NAME DES-PT-40b-CTLFireability-01
FORMULA_NAME DES-PT-40b-CTLFireability-02
FORMULA_NAME DES-PT-40b-CTLFireability-03
FORMULA_NAME DES-PT-40b-CTLFireability-04
FORMULA_NAME DES-PT-40b-CTLFireability-05
FORMULA_NAME DES-PT-40b-CTLFireability-06
FORMULA_NAME DES-PT-40b-CTLFireability-07
FORMULA_NAME DES-PT-40b-CTLFireability-08
FORMULA_NAME DES-PT-40b-CTLFireability-09
FORMULA_NAME DES-PT-40b-CTLFireability-10
FORMULA_NAME DES-PT-40b-CTLFireability-11
FORMULA_NAME DES-PT-40b-CTLFireability-12
FORMULA_NAME DES-PT-40b-CTLFireability-13
FORMULA_NAME DES-PT-40b-CTLFireability-14
FORMULA_NAME DES-PT-40b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589552674568

[2020-05-15 14:24:37] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 14:24:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 14:24:37] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2020-05-15 14:24:37] [INFO ] Transformed 439 places.
[2020-05-15 14:24:37] [INFO ] Transformed 390 transitions.
[2020-05-15 14:24:37] [INFO ] Found NUPN structural information;
[2020-05-15 14:24:37] [INFO ] Parsed PT model containing 439 places and 390 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 58 ms.
Incomplete random walk after 100000 steps, including 862 resets, run finished after 792 ms. (steps per millisecond=126 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0]
// Phase 1: matrix 390 rows 439 cols
[2020-05-15 14:24:38] [INFO ] Computed 65 place invariants in 73 ms
[2020-05-15 14:24:39] [INFO ] [Real]Absence check using 39 positive place invariants in 73 ms returned sat
[2020-05-15 14:24:39] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-05-15 14:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:24:40] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2020-05-15 14:24:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:24:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 99 ms returned sat
[2020-05-15 14:24:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-05-15 14:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:24:42] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2020-05-15 14:24:42] [INFO ] Deduced a trap composed of 10 places in 528 ms
[2020-05-15 14:24:43] [INFO ] Deduced a trap composed of 32 places in 325 ms
[2020-05-15 14:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1020 ms
[2020-05-15 14:24:43] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 49 ms.
[2020-05-15 14:24:47] [INFO ] Added : 245 causal constraints over 50 iterations in 4366 ms. Result :sat
[2020-05-15 14:24:47] [INFO ] Deduced a trap composed of 38 places in 355 ms
[2020-05-15 14:24:48] [INFO ] Deduced a trap composed of 41 places in 282 ms
[2020-05-15 14:24:48] [INFO ] Deduced a trap composed of 54 places in 301 ms
[2020-05-15 14:24:48] [INFO ] Deduced a trap composed of 41 places in 295 ms
[2020-05-15 14:24:49] [INFO ] Deduced a trap composed of 44 places in 278 ms
[2020-05-15 14:24:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1973 ms
[2020-05-15 14:24:49] [INFO ] [Real]Absence check using 39 positive place invariants in 60 ms returned sat
[2020-05-15 14:24:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 67 ms returned sat
[2020-05-15 14:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:24:50] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2020-05-15 14:24:51] [INFO ] Deduced a trap composed of 8 places in 274 ms
[2020-05-15 14:24:51] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-05-15 14:24:51] [INFO ] Deduced a trap composed of 24 places in 176 ms
[2020-05-15 14:24:51] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2020-05-15 14:24:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 970 ms
[2020-05-15 14:24:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:24:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 177 ms returned sat
[2020-05-15 14:24:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2020-05-15 14:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:24:53] [INFO ] [Nat]Absence check using state equation in 1354 ms returned sat
[2020-05-15 14:24:54] [INFO ] Deduced a trap composed of 8 places in 314 ms
[2020-05-15 14:24:54] [INFO ] Deduced a trap composed of 35 places in 276 ms
[2020-05-15 14:24:54] [INFO ] Deduced a trap composed of 33 places in 243 ms
[2020-05-15 14:24:55] [INFO ] Deduced a trap composed of 20 places in 539 ms
[2020-05-15 14:24:55] [INFO ] Deduced a trap composed of 21 places in 266 ms
[2020-05-15 14:24:55] [INFO ] Deduced a trap composed of 24 places in 275 ms
[2020-05-15 14:24:56] [INFO ] Deduced a trap composed of 47 places in 199 ms
[2020-05-15 14:24:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2494 ms
[2020-05-15 14:24:56] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 45 ms.
[2020-05-15 14:25:02] [INFO ] Added : 373 causal constraints over 76 iterations in 5853 ms. Result :sat
[2020-05-15 14:25:02] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-05-15 14:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2020-05-15 14:25:02] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 14:25:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-05-15 14:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:03] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2020-05-15 14:25:04] [INFO ] Deduced a trap composed of 8 places in 239 ms
[2020-05-15 14:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2020-05-15 14:25:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:25:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-05-15 14:25:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-05-15 14:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:06] [INFO ] [Nat]Absence check using state equation in 1630 ms returned sat
[2020-05-15 14:25:06] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-05-15 14:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2020-05-15 14:25:06] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 66 ms.
[2020-05-15 14:25:14] [INFO ] Added : 381 causal constraints over 77 iterations in 7876 ms. Result :sat
[2020-05-15 14:25:14] [INFO ] Deduced a trap composed of 64 places in 452 ms
[2020-05-15 14:25:15] [INFO ] Deduced a trap composed of 63 places in 271 ms
[2020-05-15 14:25:15] [INFO ] Deduced a trap composed of 52 places in 271 ms
[2020-05-15 14:25:16] [INFO ] Deduced a trap composed of 30 places in 248 ms
[2020-05-15 14:25:16] [INFO ] Deduced a trap composed of 37 places in 193 ms
[2020-05-15 14:25:17] [INFO ] Deduced a trap composed of 37 places in 580 ms
[2020-05-15 14:25:17] [INFO ] Deduced a trap composed of 37 places in 229 ms
[2020-05-15 14:25:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3041 ms
[2020-05-15 14:25:17] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-05-15 14:25:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-05-15 14:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:18] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2020-05-15 14:25:19] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-05-15 14:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2020-05-15 14:25:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:25:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-05-15 14:25:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-05-15 14:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:20] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2020-05-15 14:25:20] [INFO ] Deduced a trap composed of 8 places in 203 ms
[2020-05-15 14:25:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2020-05-15 14:25:21] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 46 ms.
[2020-05-15 14:25:28] [INFO ] Added : 365 causal constraints over 74 iterations in 7563 ms. Result :sat
[2020-05-15 14:25:28] [INFO ] Deduced a trap composed of 44 places in 166 ms
[2020-05-15 14:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2020-05-15 14:25:29] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-05-15 14:25:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-05-15 14:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:30] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2020-05-15 14:25:30] [INFO ] Deduced a trap composed of 8 places in 306 ms
[2020-05-15 14:25:30] [INFO ] Deduced a trap composed of 20 places in 260 ms
[2020-05-15 14:25:31] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-05-15 14:25:31] [INFO ] Deduced a trap composed of 22 places in 191 ms
[2020-05-15 14:25:31] [INFO ] Deduced a trap composed of 29 places in 200 ms
[2020-05-15 14:25:31] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-05-15 14:25:32] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2020-05-15 14:25:32] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-05-15 14:25:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2050 ms
[2020-05-15 14:25:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:25:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-05-15 14:25:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-05-15 14:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:33] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2020-05-15 14:25:34] [INFO ] Deduced a trap composed of 8 places in 316 ms
[2020-05-15 14:25:34] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-05-15 14:25:34] [INFO ] Deduced a trap composed of 15 places in 211 ms
[2020-05-15 14:25:34] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2020-05-15 14:25:35] [INFO ] Deduced a trap composed of 21 places in 382 ms
[2020-05-15 14:25:35] [INFO ] Deduced a trap composed of 24 places in 491 ms
[2020-05-15 14:25:36] [INFO ] Deduced a trap composed of 12 places in 329 ms
[2020-05-15 14:25:36] [INFO ] Deduced a trap composed of 17 places in 294 ms
[2020-05-15 14:25:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2917 ms
[2020-05-15 14:25:36] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 70 ms.
[2020-05-15 14:25:41] [INFO ] Added : 314 causal constraints over 64 iterations in 5001 ms. Result :sat
[2020-05-15 14:25:41] [INFO ] Deduced a trap composed of 31 places in 202 ms
[2020-05-15 14:25:42] [INFO ] Deduced a trap composed of 66 places in 206 ms
[2020-05-15 14:25:42] [INFO ] Deduced a trap composed of 62 places in 207 ms
[2020-05-15 14:25:42] [INFO ] Deduced a trap composed of 58 places in 344 ms
[2020-05-15 14:25:43] [INFO ] Deduced a trap composed of 65 places in 211 ms
[2020-05-15 14:25:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1574 ms
[2020-05-15 14:25:43] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-05-15 14:25:43] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-05-15 14:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:44] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2020-05-15 14:25:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:25:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 94 ms returned sat
[2020-05-15 14:25:44] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-05-15 14:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:45] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2020-05-15 14:25:46] [INFO ] Deduced a trap composed of 10 places in 338 ms
[2020-05-15 14:25:46] [INFO ] Deduced a trap composed of 31 places in 222 ms
[2020-05-15 14:25:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 676 ms
[2020-05-15 14:25:46] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 38 ms.
[2020-05-15 14:25:51] [INFO ] Added : 299 causal constraints over 60 iterations in 5048 ms. Result :sat
[2020-05-15 14:25:51] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 14:25:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 98 ms returned sat
[2020-05-15 14:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:53] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2020-05-15 14:25:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:25:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 86 ms returned sat
[2020-05-15 14:25:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 92 ms returned sat
[2020-05-15 14:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:25:54] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2020-05-15 14:25:55] [INFO ] Deduced a trap composed of 14 places in 352 ms
[2020-05-15 14:25:55] [INFO ] Deduced a trap composed of 16 places in 275 ms
[2020-05-15 14:25:55] [INFO ] Deduced a trap composed of 17 places in 159 ms
[2020-05-15 14:25:55] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-05-15 14:25:56] [INFO ] Deduced a trap composed of 19 places in 231 ms
[2020-05-15 14:25:56] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-15 14:25:56] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2020-05-15 14:25:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1917 ms
[2020-05-15 14:25:56] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 51 ms.
[2020-05-15 14:26:02] [INFO ] Added : 337 causal constraints over 69 iterations in 5387 ms. Result :sat
[2020-05-15 14:26:02] [INFO ] Deduced a trap composed of 41 places in 232 ms
[2020-05-15 14:26:02] [INFO ] Deduced a trap composed of 44 places in 258 ms
[2020-05-15 14:26:02] [INFO ] Deduced a trap composed of 65 places in 213 ms
[2020-05-15 14:26:03] [INFO ] Deduced a trap composed of 43 places in 195 ms
[2020-05-15 14:26:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1279 ms
[2020-05-15 14:26:03] [INFO ] [Real]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 14:26:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 96 ms returned sat
[2020-05-15 14:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:05] [INFO ] [Real]Absence check using state equation in 1492 ms returned sat
[2020-05-15 14:26:05] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-05-15 14:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2020-05-15 14:26:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:26:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-05-15 14:26:05] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 70 ms returned sat
[2020-05-15 14:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:06] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2020-05-15 14:26:07] [INFO ] Deduced a trap composed of 8 places in 196 ms
[2020-05-15 14:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2020-05-15 14:26:07] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 45 ms.
[2020-05-15 14:26:13] [INFO ] Added : 378 causal constraints over 77 iterations in 6658 ms. Result :sat
[2020-05-15 14:26:14] [INFO ] Deduced a trap composed of 30 places in 105 ms
[2020-05-15 14:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2020-05-15 14:26:14] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-05-15 14:26:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 14:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:15] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2020-05-15 14:26:15] [INFO ] Deduced a trap composed of 8 places in 210 ms
[2020-05-15 14:26:15] [INFO ] Deduced a trap composed of 14 places in 139 ms
[2020-05-15 14:26:16] [INFO ] Deduced a trap composed of 15 places in 180 ms
[2020-05-15 14:26:16] [INFO ] Deduced a trap composed of 9 places in 133 ms
[2020-05-15 14:26:16] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-05-15 14:26:16] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-05-15 14:26:17] [INFO ] Deduced a trap composed of 10 places in 363 ms
[2020-05-15 14:26:17] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-05-15 14:26:17] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-05-15 14:26:17] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2020-05-15 14:26:18] [INFO ] Deduced a trap composed of 23 places in 283 ms
[2020-05-15 14:26:18] [INFO ] Deduced a trap composed of 33 places in 95 ms
[2020-05-15 14:26:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2703 ms
[2020-05-15 14:26:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:26:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-05-15 14:26:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 14:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:19] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2020-05-15 14:26:19] [INFO ] Deduced a trap composed of 44 places in 249 ms
[2020-05-15 14:26:20] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2020-05-15 14:26:20] [INFO ] Deduced a trap composed of 36 places in 98 ms
[2020-05-15 14:26:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 662 ms
[2020-05-15 14:26:20] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 39 ms.
[2020-05-15 14:26:25] [INFO ] Added : 382 causal constraints over 78 iterations in 5550 ms. Result :sat
[2020-05-15 14:26:26] [INFO ] Deduced a trap composed of 40 places in 173 ms
[2020-05-15 14:26:26] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-05-15 14:26:26] [INFO ] Deduced a trap composed of 22 places in 592 ms
[2020-05-15 14:26:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1206 ms
[2020-05-15 14:26:27] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 14:26:27] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 14:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:28] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2020-05-15 14:26:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:26:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-05-15 14:26:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-05-15 14:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:29] [INFO ] [Nat]Absence check using state equation in 1149 ms returned sat
[2020-05-15 14:26:30] [INFO ] Deduced a trap composed of 8 places in 286 ms
[2020-05-15 14:26:30] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-05-15 14:26:30] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2020-05-15 14:26:30] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-05-15 14:26:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 954 ms
[2020-05-15 14:26:30] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 40 ms.
[2020-05-15 14:26:35] [INFO ] Added : 296 causal constraints over 60 iterations in 4871 ms. Result :sat
[2020-05-15 14:26:36] [INFO ] Deduced a trap composed of 55 places in 263 ms
[2020-05-15 14:26:36] [INFO ] Deduced a trap composed of 54 places in 217 ms
[2020-05-15 14:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 734 ms
[2020-05-15 14:26:36] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-05-15 14:26:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-05-15 14:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:37] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-05-15 14:26:38] [INFO ] Deduced a trap composed of 8 places in 304 ms
[2020-05-15 14:26:38] [INFO ] Deduced a trap composed of 19 places in 206 ms
[2020-05-15 14:26:38] [INFO ] Deduced a trap composed of 14 places in 297 ms
[2020-05-15 14:26:38] [INFO ] Deduced a trap composed of 17 places in 228 ms
[2020-05-15 14:26:39] [INFO ] Deduced a trap composed of 41 places in 214 ms
[2020-05-15 14:26:39] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-05-15 14:26:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1702 ms
[2020-05-15 14:26:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:26:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 122 ms returned sat
[2020-05-15 14:26:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-05-15 14:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:41] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2020-05-15 14:26:41] [INFO ] Deduced a trap composed of 18 places in 313 ms
[2020-05-15 14:26:41] [INFO ] Deduced a trap composed of 53 places in 220 ms
[2020-05-15 14:26:41] [INFO ] Deduced a trap composed of 12 places in 229 ms
[2020-05-15 14:26:42] [INFO ] Deduced a trap composed of 15 places in 182 ms
[2020-05-15 14:26:42] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-05-15 14:26:42] [INFO ] Deduced a trap composed of 35 places in 179 ms
[2020-05-15 14:26:42] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-05-15 14:26:43] [INFO ] Deduced a trap composed of 54 places in 166 ms
[2020-05-15 14:26:43] [INFO ] Deduced a trap composed of 31 places in 178 ms
[2020-05-15 14:26:43] [INFO ] Deduced a trap composed of 32 places in 161 ms
[2020-05-15 14:26:43] [INFO ] Deduced a trap composed of 35 places in 180 ms
[2020-05-15 14:26:43] [INFO ] Deduced a trap composed of 49 places in 192 ms
[2020-05-15 14:26:44] [INFO ] Deduced a trap composed of 45 places in 290 ms
[2020-05-15 14:26:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3343 ms
[2020-05-15 14:26:44] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 51 ms.
[2020-05-15 14:26:49] [INFO ] Added : 314 causal constraints over 64 iterations in 4980 ms. Result :sat
[2020-05-15 14:26:49] [INFO ] Deduced a trap composed of 55 places in 254 ms
[2020-05-15 14:26:49] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-15 14:26:50] [INFO ] Deduced a trap composed of 31 places in 175 ms
[2020-05-15 14:26:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 957 ms
[2020-05-15 14:26:50] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-05-15 14:26:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 14:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:51] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2020-05-15 14:26:52] [INFO ] Deduced a trap composed of 12 places in 367 ms
[2020-05-15 14:26:52] [INFO ] Deduced a trap composed of 15 places in 216 ms
[2020-05-15 14:26:52] [INFO ] Deduced a trap composed of 32 places in 260 ms
[2020-05-15 14:26:52] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-05-15 14:26:52] [INFO ] Deduced a trap composed of 12 places in 97 ms
[2020-05-15 14:26:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1325 ms
[2020-05-15 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:26:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-05-15 14:26:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-05-15 14:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:26:54] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2020-05-15 14:26:54] [INFO ] Deduced a trap composed of 20 places in 242 ms
[2020-05-15 14:26:54] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-05-15 14:26:54] [INFO ] Deduced a trap composed of 8 places in 197 ms
[2020-05-15 14:26:55] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-15 14:26:55] [INFO ] Deduced a trap composed of 12 places in 219 ms
[2020-05-15 14:26:55] [INFO ] Deduced a trap composed of 24 places in 228 ms
[2020-05-15 14:26:55] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-05-15 14:26:56] [INFO ] Deduced a trap composed of 33 places in 171 ms
[2020-05-15 14:26:56] [INFO ] Deduced a trap composed of 12 places in 219 ms
[2020-05-15 14:26:56] [INFO ] Deduced a trap composed of 41 places in 165 ms
[2020-05-15 14:26:56] [INFO ] Deduced a trap composed of 51 places in 128 ms
[2020-05-15 14:26:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2617 ms
[2020-05-15 14:26:56] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 38 ms.
[2020-05-15 14:27:01] [INFO ] Added : 294 causal constraints over 60 iterations in 4437 ms. Result :sat
[2020-05-15 14:27:01] [INFO ] Deduced a trap composed of 36 places in 261 ms
[2020-05-15 14:27:01] [INFO ] Deduced a trap composed of 44 places in 278 ms
[2020-05-15 14:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2020-05-15 14:27:02] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-05-15 14:27:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-05-15 14:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:03] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2020-05-15 14:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:27:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-05-15 14:27:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 14:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:04] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2020-05-15 14:27:04] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-05-15 14:27:05] [INFO ] Deduced a trap composed of 41 places in 236 ms
[2020-05-15 14:27:05] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2020-05-15 14:27:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 730 ms
[2020-05-15 14:27:05] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 40 ms.
[2020-05-15 14:27:09] [INFO ] Added : 304 causal constraints over 62 iterations in 4276 ms. Result :sat
[2020-05-15 14:27:09] [INFO ] Deduced a trap composed of 55 places in 285 ms
[2020-05-15 14:27:10] [INFO ] Deduced a trap composed of 52 places in 236 ms
[2020-05-15 14:27:10] [INFO ] Deduced a trap composed of 31 places in 277 ms
[2020-05-15 14:27:10] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2020-05-15 14:27:11] [INFO ] Deduced a trap composed of 45 places in 187 ms
[2020-05-15 14:27:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1731 ms
[2020-05-15 14:27:11] [INFO ] [Real]Absence check using 39 positive place invariants in 94 ms returned sat
[2020-05-15 14:27:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 81 ms returned sat
[2020-05-15 14:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:13] [INFO ] [Real]Absence check using state equation in 2113 ms returned sat
[2020-05-15 14:27:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:27:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 238 ms returned sat
[2020-05-15 14:27:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-05-15 14:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:15] [INFO ] [Nat]Absence check using state equation in 1817 ms returned sat
[2020-05-15 14:27:16] [INFO ] Deduced a trap composed of 9 places in 299 ms
[2020-05-15 14:27:16] [INFO ] Deduced a trap composed of 33 places in 190 ms
[2020-05-15 14:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 655 ms
[2020-05-15 14:27:16] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 45 ms.
[2020-05-15 14:27:23] [INFO ] Added : 376 causal constraints over 76 iterations in 6735 ms. Result :sat
[2020-05-15 14:27:23] [INFO ] Deduced a trap composed of 36 places in 368 ms
[2020-05-15 14:27:24] [INFO ] Deduced a trap composed of 33 places in 299 ms
[2020-05-15 14:27:24] [INFO ] Deduced a trap composed of 55 places in 270 ms
[2020-05-15 14:27:25] [INFO ] Deduced a trap composed of 59 places in 228 ms
[2020-05-15 14:27:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1792 ms
[2020-05-15 14:27:25] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-05-15 14:27:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 52 ms returned sat
[2020-05-15 14:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:26] [INFO ] [Real]Absence check using state equation in 1390 ms returned sat
[2020-05-15 14:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:27:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 94 ms returned sat
[2020-05-15 14:27:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-05-15 14:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:28] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2020-05-15 14:27:28] [INFO ] Deduced a trap composed of 10 places in 352 ms
[2020-05-15 14:27:29] [INFO ] Deduced a trap composed of 7 places in 310 ms
[2020-05-15 14:27:29] [INFO ] Deduced a trap composed of 17 places in 263 ms
[2020-05-15 14:27:29] [INFO ] Deduced a trap composed of 35 places in 262 ms
[2020-05-15 14:27:30] [INFO ] Deduced a trap composed of 48 places in 258 ms
[2020-05-15 14:27:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1720 ms
[2020-05-15 14:27:30] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 40 ms.
[2020-05-15 14:27:36] [INFO ] Added : 380 causal constraints over 76 iterations in 5870 ms. Result :sat
[2020-05-15 14:27:36] [INFO ] Deduced a trap composed of 37 places in 219 ms
[2020-05-15 14:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2020-05-15 14:27:36] [INFO ] [Real]Absence check using 39 positive place invariants in 50 ms returned sat
[2020-05-15 14:27:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-05-15 14:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:37] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2020-05-15 14:27:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:27:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 227 ms returned sat
[2020-05-15 14:27:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2020-05-15 14:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:40] [INFO ] [Nat]Absence check using state equation in 1647 ms returned sat
[2020-05-15 14:27:40] [INFO ] Deduced a trap composed of 8 places in 211 ms
[2020-05-15 14:27:41] [INFO ] Deduced a trap composed of 32 places in 340 ms
[2020-05-15 14:27:41] [INFO ] Deduced a trap composed of 19 places in 130 ms
[2020-05-15 14:27:41] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2020-05-15 14:27:41] [INFO ] Deduced a trap composed of 24 places in 133 ms
[2020-05-15 14:27:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1193 ms
[2020-05-15 14:27:41] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 116 ms.
[2020-05-15 14:27:46] [INFO ] Added : 280 causal constraints over 57 iterations in 4997 ms. Result :sat
[2020-05-15 14:27:47] [INFO ] Deduced a trap composed of 35 places in 284 ms
[2020-05-15 14:27:47] [INFO ] Deduced a trap composed of 43 places in 383 ms
[2020-05-15 14:27:47] [INFO ] Deduced a trap composed of 62 places in 219 ms
[2020-05-15 14:27:48] [INFO ] Deduced a trap composed of 42 places in 299 ms
[2020-05-15 14:27:48] [INFO ] Deduced a trap composed of 62 places in 297 ms
[2020-05-15 14:27:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1970 ms
[2020-05-15 14:27:48] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-05-15 14:27:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-05-15 14:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:49] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2020-05-15 14:27:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:27:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 88 ms returned sat
[2020-05-15 14:27:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-05-15 14:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:27:51] [INFO ] [Nat]Absence check using state equation in 1520 ms returned sat
[2020-05-15 14:27:52] [INFO ] Deduced a trap composed of 12 places in 629 ms
[2020-05-15 14:27:52] [INFO ] Deduced a trap composed of 8 places in 267 ms
[2020-05-15 14:27:53] [INFO ] Deduced a trap composed of 48 places in 346 ms
[2020-05-15 14:27:53] [INFO ] Deduced a trap composed of 18 places in 338 ms
[2020-05-15 14:27:53] [INFO ] Deduced a trap composed of 20 places in 325 ms
[2020-05-15 14:27:54] [INFO ] Deduced a trap composed of 21 places in 298 ms
[2020-05-15 14:27:54] [INFO ] Deduced a trap composed of 37 places in 228 ms
[2020-05-15 14:27:54] [INFO ] Deduced a trap composed of 54 places in 398 ms
[2020-05-15 14:27:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3261 ms
[2020-05-15 14:27:55] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 98 ms.
[2020-05-15 14:28:01] [INFO ] Added : 278 causal constraints over 57 iterations in 6258 ms. Result :sat
[2020-05-15 14:28:01] [INFO ] Deduced a trap composed of 59 places in 297 ms
[2020-05-15 14:28:02] [INFO ] Deduced a trap composed of 41 places in 461 ms
[2020-05-15 14:28:02] [INFO ] Deduced a trap composed of 63 places in 331 ms
[2020-05-15 14:28:03] [INFO ] Deduced a trap composed of 52 places in 255 ms
[2020-05-15 14:28:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1904 ms
[2020-05-15 14:28:03] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-05-15 14:28:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-05-15 14:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:04] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2020-05-15 14:28:04] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-05-15 14:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2020-05-15 14:28:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:28:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-05-15 14:28:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-05-15 14:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:06] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2020-05-15 14:28:06] [INFO ] Deduced a trap composed of 8 places in 313 ms
[2020-05-15 14:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2020-05-15 14:28:06] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 42 ms.
[2020-05-15 14:28:13] [INFO ] Added : 371 causal constraints over 75 iterations in 6483 ms. Result :sat
[2020-05-15 14:28:13] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-05-15 14:28:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 14:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:14] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2020-05-15 14:28:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:28:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 176 ms returned sat
[2020-05-15 14:28:15] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-05-15 14:28:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:16] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2020-05-15 14:28:17] [INFO ] Deduced a trap composed of 8 places in 691 ms
[2020-05-15 14:28:17] [INFO ] Deduced a trap composed of 15 places in 281 ms
[2020-05-15 14:28:18] [INFO ] Deduced a trap composed of 32 places in 289 ms
[2020-05-15 14:28:18] [INFO ] Deduced a trap composed of 31 places in 181 ms
[2020-05-15 14:28:18] [INFO ] Deduced a trap composed of 18 places in 274 ms
[2020-05-15 14:28:19] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-05-15 14:28:19] [INFO ] Deduced a trap composed of 36 places in 199 ms
[2020-05-15 14:28:19] [INFO ] Deduced a trap composed of 24 places in 257 ms
[2020-05-15 14:28:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2781 ms
[2020-05-15 14:28:19] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 41 ms.
[2020-05-15 14:28:25] [INFO ] Added : 348 causal constraints over 70 iterations in 6141 ms. Result :sat
[2020-05-15 14:28:25] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-05-15 14:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2020-05-15 14:28:26] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-05-15 14:28:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-05-15 14:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:27] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2020-05-15 14:28:27] [INFO ] Deduced a trap composed of 8 places in 197 ms
[2020-05-15 14:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2020-05-15 14:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:28:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 84 ms returned sat
[2020-05-15 14:28:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 14:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:29] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2020-05-15 14:28:29] [INFO ] Deduced a trap composed of 8 places in 191 ms
[2020-05-15 14:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2020-05-15 14:28:29] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 39 ms.
[2020-05-15 14:28:37] [INFO ] Added : 361 causal constraints over 73 iterations in 7982 ms. Result :sat
[2020-05-15 14:28:37] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 14:28:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2020-05-15 14:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:38] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2020-05-15 14:28:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 14:28:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-05-15 14:28:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-05-15 14:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 14:28:40] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2020-05-15 14:28:40] [INFO ] Deduced a trap composed of 8 places in 272 ms
[2020-05-15 14:28:40] [INFO ] Deduced a trap composed of 17 places in 297 ms
[2020-05-15 14:28:41] [INFO ] Deduced a trap composed of 20 places in 175 ms
[2020-05-15 14:28:41] [INFO ] Deduced a trap composed of 21 places in 212 ms
[2020-05-15 14:28:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1145 ms
[2020-05-15 14:28:41] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 34 ms.
[2020-05-15 14:28:46] [INFO ] Added : 254 causal constraints over 52 iterations in 5462 ms. Result :sat
[2020-05-15 14:28:47] [INFO ] Deduced a trap composed of 56 places in 332 ms
[2020-05-15 14:28:47] [INFO ] Deduced a trap composed of 58 places in 226 ms
[2020-05-15 14:28:47] [INFO ] Deduced a trap composed of 58 places in 229 ms
[2020-05-15 14:28:48] [INFO ] Deduced a trap composed of 58 places in 254 ms
[2020-05-15 14:28:48] [INFO ] Deduced a trap composed of 44 places in 267 ms
[2020-05-15 14:28:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1747 ms
[2020-05-15 14:28:49] [INFO ] Flatten gal took : 162 ms
[2020-05-15 14:28:49] [INFO ] Flatten gal took : 65 ms
[2020-05-15 14:28:49] [INFO ] Applying decomposition
[2020-05-15 14:28:49] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2340079041281596304.txt, -o, /tmp/graph2340079041281596304.bin, -w, /tmp/graph2340079041281596304.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2340079041281596304.bin, -l, -1, -v, -w, /tmp/graph2340079041281596304.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 14:28:49] [INFO ] Decomposing Gal with order
[2020-05-15 14:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 14:28:49] [INFO ] Removed a total of 30 redundant transitions.
[2020-05-15 14:28:49] [INFO ] Flatten gal took : 141 ms
[2020-05-15 14:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 56 ms.
[2020-05-15 14:28:50] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 41 ms
[2020-05-15 14:28:50] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 29 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 15 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 27 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.60418e+22,20.707,382676,21860,3267,993781,29960,790,579092,405,175784,0


Converting to forward existential form...Done !
original formula: EF(((EG(((u41.p42==1)&&(u41.p290==1))) * ((i2.i2.u20.p223!=1)||(((i12.u84.p70==1)&&(i12.u84.p431==1))&&(i7.u36.p276==1)))) * (((((u10.p133!=1)||(u10.p189!=1))||(i12.u84.p47!=1))||(i12.u84.p431!=1))||(((i12.u84.p53==1)&&(i12.u84.p431==1))&&(i12.u84.p81!=1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (((((u10.p133!=1)||(u10.p189!=1))||(i12.u84.p47!=1))||(i12.u84.p431!=1))||(((i12.u84.p53==1)&&(i12.u84.p431==1))&&(i12.u84.p81!=1)))) * ((i2.i2.u20.p223!=1)||(((i12.u84.p70==1)&&(i12.u84.p431==1))&&(i7.u36.p276==1)))),((u41.p42==1)&&(u41.p290==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,214.141,1962320,1,0,5.64021e+06,72111,2990,2.95055e+06,2631,358929,3594790
FORMULA DES-PT-40b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(EF(((i1.u2.p86==1)&&(i1.u39.p283==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i1.u2.p86==1)&&(i1.u39.p283==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t60, t99, t139, t141, t154, u41.t80, i1.u39.t83, i2.i1.t160, i2.i1.u8.t156, i2.i1.u8.t158, i2.i2.t121, i2.i2.u20.t123, i3.i0.t166, i3.i0.u6.t162, i3.i0.u6.t164, i3.i1.u23.t111, i3.i1.u23.t117, i3.i1.u26.t112, i4.i1.u14.t144, i4.i1.u14.t146, i4.i1.u14.t149, i4.i1.u14.t151, i4.i1.u14.t153, i6.i0.u22.t118, i6.i0.u28.t102, i6.i0.u28.t109, i7.u35.t90, i7.u35.t92, i7.u35.t94, i7.u35.t96, i7.u35.t98, i8.i1.u15.t133, i8.i1.u15.t135, i8.i1.u15.t137, i8.i2.u74.t33, i8.i2.u74.t36, i8.i2.u74.t38, i9.t56, i9.i0.u65.t52, i9.i0.u73.t41, i9.i1.t54, i9.i1.u48.t76, i9.i1.u63.t57, i9.i1.u64.t55, i9.i3.t58, i9.i3.u61.t61, i9.i3.u62.t59, i10.t66, i10.t64, i10.t62, i10.i1.u57.t68, i10.i2.u58.t67, i10.i3.u59.t65, i10.i4.u60.t63, i11.i0.u17.t126, i11.i0.u17.t128, i11.i0.u17.t130, i11.i2.u43.t78, i11.i3.u81.t23, i11.i3.u81.t25, i11.i3.u81.t27, i12.u84.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/326/62/388
(forward)formula 1,0,362.759,4095328,1,0,1.14473e+07,107334,2431,5.94662e+06,1516,580199,476318
FORMULA DES-PT-40b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-15 14:50:14] [INFO ] Applying decomposition
[2020-05-15 14:50:14] [INFO ] Flatten gal took : 55 ms
[2020-05-15 14:50:14] [INFO ] Decomposing Gal with order
[2020-05-15 14:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 14:50:14] [INFO ] Removed a total of 177 redundant transitions.
[2020-05-15 14:50:14] [INFO ] Flatten gal took : 145 ms
[2020-05-15 14:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 622 labels/synchronizations in 43 ms.
[2020-05-15 14:50:14] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 20 ms
[2020-05-15 14:50:14] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 15:11:38] [INFO ] Flatten gal took : 76 ms
[2020-05-15 15:11:39] [INFO ] Input system was already deterministic with 390 transitions.
[2020-05-15 15:11:39] [INFO ] Transformed 439 places.
[2020-05-15 15:11:39] [INFO ] Transformed 390 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 15:12:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-15 15:12:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 11 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-40b, 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 r051-ebro-158902546000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;