fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097100066
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16252.836 3600000.00 3324007.00 26412.20 FFFFFFTFTT?FFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100066.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is DES-PT-50a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 97K May 5 16:51 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-50a-00
FORMULA_NAME DES-PT-50a-01
FORMULA_NAME DES-PT-50a-02
FORMULA_NAME DES-PT-50a-03
FORMULA_NAME DES-PT-50a-04
FORMULA_NAME DES-PT-50a-05
FORMULA_NAME DES-PT-50a-06
FORMULA_NAME DES-PT-50a-07
FORMULA_NAME DES-PT-50a-08
FORMULA_NAME DES-PT-50a-09
FORMULA_NAME DES-PT-50a-10
FORMULA_NAME DES-PT-50a-11
FORMULA_NAME DES-PT-50a-12
FORMULA_NAME DES-PT-50a-13
FORMULA_NAME DES-PT-50a-14
FORMULA_NAME DES-PT-50a-15

=== Now, execution of the tool begins

BK_START 1620513259017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:34:20] [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]
[2021-05-08 22:34:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:34:20] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-08 22:34:20] [INFO ] Transformed 314 places.
[2021-05-08 22:34:20] [INFO ] Transformed 271 transitions.
[2021-05-08 22:34:20] [INFO ] Found NUPN structural information;
[2021-05-08 22:34:20] [INFO ] Parsed PT model containing 314 places and 271 transitions in 111 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2214 resets, run finished after 495 ms. (steps per millisecond=202 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 314 cols
[2021-05-08 22:34:21] [INFO ] Computed 59 place invariants in 25 ms
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:21] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2021-05-08 22:34:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2021-05-08 22:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:22] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2021-05-08 22:34:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:34:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:22] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 18 ms.
[2021-05-08 22:34:23] [INFO ] Added : 231 causal constraints over 47 iterations in 1072 ms. Result :sat
[2021-05-08 22:34:23] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2021-05-08 22:34:24] [INFO ] Deduced a trap composed of 17 places in 70 ms
[2021-05-08 22:34:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2021-05-08 22:34:24] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2021-05-08 22:34:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-08 22:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:24] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2021-05-08 22:34:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2021-05-08 22:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:25] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-08 22:34:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:25] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 21 ms.
[2021-05-08 22:34:26] [INFO ] Added : 211 causal constraints over 43 iterations in 1151 ms. Result :sat
[2021-05-08 22:34:26] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:26] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-08 22:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 55 ms returned sat
[2021-05-08 22:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:27] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2021-05-08 22:34:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:27] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 32 ms.
[2021-05-08 22:34:28] [INFO ] Added : 231 causal constraints over 47 iterations in 1011 ms. Result :sat
[2021-05-08 22:34:28] [INFO ] Deduced a trap composed of 22 places in 63 ms
[2021-05-08 22:34:28] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2021-05-08 22:34:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2021-05-08 22:34:29] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:29] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2021-05-08 22:34:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:30] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-08 22:34:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:30] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 19 ms.
[2021-05-08 22:34:30] [INFO ] Added : 126 causal constraints over 26 iterations in 676 ms. Result :sat
[2021-05-08 22:34:30] [INFO ] Deduced a trap composed of 9 places in 58 ms
[2021-05-08 22:34:30] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2021-05-08 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:31] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2021-05-08 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:31] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2021-05-08 22:34:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:32] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 15 ms.
[2021-05-08 22:34:33] [INFO ] Added : 170 causal constraints over 35 iterations in 1039 ms. Result :sat
[2021-05-08 22:34:33] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-08 22:34:33] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2021-05-08 22:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2021-05-08 22:34:33] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:33] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-08 22:34:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 61 ms returned sat
[2021-05-08 22:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:34] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2021-05-08 22:34:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:34] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 16 ms.
[2021-05-08 22:34:35] [INFO ] Added : 83 causal constraints over 18 iterations in 736 ms. Result :sat
[2021-05-08 22:34:35] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:35] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-08 22:34:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 22:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:36] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2021-05-08 22:34:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:34:36] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:37] [INFO ] Added : 232 causal constraints over 47 iterations in 1013 ms. Result :sat
[2021-05-08 22:34:37] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:37] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2021-05-08 22:34:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:38] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2021-05-08 22:34:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:38] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:39] [INFO ] Added : 202 causal constraints over 41 iterations in 1248 ms. Result :sat
[2021-05-08 22:34:39] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:40] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-08 22:34:40] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-08 22:34:40] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2021-05-08 22:34:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:40] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-08 22:34:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:34:40] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 15 ms.
[2021-05-08 22:34:41] [INFO ] Added : 229 causal constraints over 47 iterations in 1006 ms. Result :sat
[2021-05-08 22:34:41] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:42] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2021-05-08 22:34:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:42] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2021-05-08 22:34:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:43] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 15 ms.
[2021-05-08 22:34:44] [INFO ] Added : 129 causal constraints over 27 iterations in 1019 ms. Result :sat
[2021-05-08 22:34:44] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:44] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:44] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 16 ms.
[2021-05-08 22:34:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:45] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-08 22:34:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:45] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 17 ms.
[2021-05-08 22:34:46] [INFO ] Added : 213 causal constraints over 43 iterations in 900 ms. Result :sat
[2021-05-08 22:34:46] [INFO ] Deduced a trap composed of 12 places in 18 ms
[2021-05-08 22:34:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-08 22:34:46] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:46] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-08 22:34:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:47] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2021-05-08 22:34:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:47] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 19 ms.
[2021-05-08 22:34:48] [INFO ] Added : 129 causal constraints over 27 iterations in 1035 ms. Result :sat
[2021-05-08 22:34:48] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:48] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2021-05-08 22:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:49] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-08 22:34:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:34:49] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:50] [INFO ] Added : 192 causal constraints over 39 iterations in 971 ms. Result :sat
[2021-05-08 22:34:50] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2021-05-08 22:34:50] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2021-05-08 22:34:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-08 22:34:50] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:34:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:51] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2021-05-08 22:34:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:51] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2021-05-08 22:34:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:51] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:52] [INFO ] Added : 135 causal constraints over 28 iterations in 772 ms. Result :sat
[2021-05-08 22:34:52] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:53] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2021-05-08 22:34:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2021-05-08 22:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:53] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2021-05-08 22:34:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:34:53] [INFO ] Deduced a trap composed of 9 places in 38 ms
[2021-05-08 22:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-08 22:34:53] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 12 ms.
[2021-05-08 22:34:54] [INFO ] Added : 234 causal constraints over 48 iterations in 1075 ms. Result :sat
[2021-05-08 22:34:54] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:55] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2021-05-08 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 22:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:55] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-08 22:34:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:55] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:56] [INFO ] Added : 126 causal constraints over 26 iterations in 747 ms. Result :sat
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:57] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-08 22:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:34:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:57] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2021-05-08 22:34:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:34:57] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:34:58] [INFO ] Added : 202 causal constraints over 41 iterations in 1241 ms. Result :sat
[2021-05-08 22:34:58] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:34:59] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-08 22:34:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:34:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2021-05-08 22:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:00] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2021-05-08 22:35:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:35:00] [INFO ] Deduced a trap composed of 13 places in 51 ms
[2021-05-08 22:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-08 22:35:00] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 14 ms.
[2021-05-08 22:35:01] [INFO ] Added : 140 causal constraints over 29 iterations in 842 ms. Result :sat
[2021-05-08 22:35:01] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2021-05-08 22:35:01] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2021-05-08 22:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:01] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-08 22:35:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:02] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2021-05-08 22:35:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:35:02] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:03] [INFO ] Added : 238 causal constraints over 48 iterations in 1194 ms. Result :sat
[2021-05-08 22:35:03] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:03] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-08 22:35:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 73 ms returned sat
[2021-05-08 22:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:04] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2021-05-08 22:35:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:35:04] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 12 ms.
[2021-05-08 22:35:05] [INFO ] Added : 114 causal constraints over 23 iterations in 952 ms. Result :sat
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 22 places in 56 ms
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 23 places in 48 ms
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2021-05-08 22:35:05] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2021-05-08 22:35:06] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2021-05-08 22:35:06] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2021-05-08 22:35:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 590 ms
[2021-05-08 22:35:06] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:06] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-08 22:35:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2021-05-08 22:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:07] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-08 22:35:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:35:07] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:08] [INFO ] Added : 159 causal constraints over 33 iterations in 1141 ms. Result :sat
[2021-05-08 22:35:08] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:08] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2021-05-08 22:35:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2021-05-08 22:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:09] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-08 22:35:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:35:09] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:10] [INFO ] Added : 157 causal constraints over 33 iterations in 1161 ms. Result :sat
[2021-05-08 22:35:10] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:11] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2021-05-08 22:35:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:11] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2021-05-08 22:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:35:11] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2021-05-08 22:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 22:35:11] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 12 ms.
[2021-05-08 22:35:13] [INFO ] Added : 212 causal constraints over 43 iterations in 1537 ms. Result :sat
[2021-05-08 22:35:13] [INFO ] Deduced a trap composed of 9 places in 48 ms
[2021-05-08 22:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2021-05-08 22:35:13] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:13] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-08 22:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:14] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2021-05-08 22:35:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:35:14] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:15] [INFO ] Added : 224 causal constraints over 45 iterations in 1030 ms. Result :sat
[2021-05-08 22:35:15] [INFO ] Deduced a trap composed of 13 places in 16 ms
[2021-05-08 22:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-08 22:35:15] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:15] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-08 22:35:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:16] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2021-05-08 22:35:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:35:16] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 12 ms.
[2021-05-08 22:35:17] [INFO ] Added : 230 causal constraints over 47 iterations in 1290 ms. Result :sat
[2021-05-08 22:35:17] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:18] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-05-08 22:35:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:35:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:18] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-08 22:35:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:35:18] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:19] [INFO ] Added : 203 causal constraints over 41 iterations in 969 ms. Result :sat
[2021-05-08 22:35:19] [INFO ] Deduced a trap composed of 9 places in 48 ms
[2021-05-08 22:35:20] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2021-05-08 22:35:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-08 22:35:20] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:35:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:20] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-08 22:35:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:35:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 22:35:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 22:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:35:21] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2021-05-08 22:35:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:35:21] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 13 ms.
[2021-05-08 22:35:22] [INFO ] Added : 253 causal constraints over 51 iterations in 1203 ms. Result :sat
[2021-05-08 22:35:22] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2021-05-08 22:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-08 22:35:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-08 22:35:22] [INFO ] Flatten gal took : 84 ms
FORMULA DES-PT-50a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 22:35:22] [INFO ] Applying decomposition
[2021-05-08 22:35:22] [INFO ] Flatten gal took : 47 ms
[2021-05-08 22:35:22] [INFO ] Decomposing Gal with order
[2021-05-08 22:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 22:35:22] [INFO ] Removed a total of 361 redundant transitions.
[2021-05-08 22:35:22] [INFO ] Flatten gal took : 84 ms
[2021-05-08 22:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 207 labels/synchronizations in 11 ms.
[2021-05-08 22:35:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-08 22:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-50a @ 3570 seconds

FORMULA DES-PT-50a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 315
rslt: Output for LTLFireability @ DES-PT-50a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 22:35:23 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p198) AND (1 <= p204)))",
"processed_size": 33,
"rewrites": 79
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p160) AND (1 <= p204)))",
"processed_size": 33,
"rewrites": 79
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p45) AND (1 <= p232) AND (1 <= p234))",
"processed_size": 44,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p145 <= 0) OR (p229 <= 0))",
"processed_size": 29,
"rewrites": 81
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 52
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (((p184 <= 0) OR (p204 <= 0))) OR (G ((F (((1 <= p205))) AND (((1 <= p145) AND (1 <= p229)) OR ((1 <= p205))))) AND X (F (((p184 <= 0) OR (p204 <= 0)))))))",
"processed_size": 163,
"rewrites": 79
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((1 <= p212) AND (1 <= p222) AND (1 <= p224)))",
"processed_size": 49,
"rewrites": 79
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (((p140 <= 0) OR (p229 <= 0))))",
"processed_size": 37,
"rewrites": 79
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((X (G (((1 <= p130) AND (1 <= p229)))) OR G (((1 <= p130) AND (1 <= p229))))) AND ((p58 <= 0) OR (p309 <= 0))))",
"processed_size": 119,
"rewrites": 79
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((X (((1 <= p143) AND (1 <= p229))) OR ((1 <= p151) AND (1 <= p204)))))",
"processed_size": 76,
"rewrites": 79
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p23 <= 0) OR (p232 <= 0) OR (p234 <= 0))",
"processed_size": 44,
"rewrites": 81
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 51
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p222) AND (1 <= p224))))",
"processed_size": 37,
"rewrites": 79
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))) AND G ((((1 <= p247) AND (1 <= p264)) OR G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))))))",
"processed_size": 200,
"rewrites": 79
},
"result":
{
"edges": 60570103,
"markings": 1558069,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 45
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 855
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)) AND (F (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0))) OR G (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)))))) OR ((1 <= p26) AND (1 <= p232) AND (1 <= p234)))))",
"processed_size": 215,
"rewrites": 79
},
"result":
{
"edges": 1716083,
"markings": 216206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p141) AND (1 <= p229))) AND ((p90 <= 0) OR (p309 <= 0)))))",
"processed_size": 76,
"rewrites": 79
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p298) AND (1 <= p308))) OR ((1 <= p28) AND (1 <= p232) AND (1 <= p234))))",
"processed_size": 87,
"rewrites": 79
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3418
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3418
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p115) AND (1 <= p229))",
"processed_size": 29,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p115) AND (1 <= p229))",
"processed_size": 29,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p160) AND (1 <= p204)))",
"processed_size": 33,
"rewrites": 79
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3576,
"runtime": 3255.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X(**) OR (G(**) AND X(F(**)))) AND X((X(**) OR G(**)))) : G(F((G((* AND (F(*) OR G(*)))) OR **))) : (** OR (X(G(*)) AND F(*))) : G(F(**)) : G(F((G(**) AND **))) : F((F(G((G(*) AND *))) AND G((** OR G((G(*) AND *)))))) : F((X(*) OR (G((F(**) AND (** OR **))) AND X(F(*))))) : (G(**) OR (F(G(**)) OR **)) : F(**) : F((F(**) OR **)) : (G(**) OR X(X(*))) : G((F((X(G(**)) OR G(**))) AND **)) : G(F((X(**) OR **)))"
},
"net":
{
"arcs": 1242,
"conflict_clusters": 46,
"places": 314,
"places_significant": 255,
"singleton_clusters": 0,
"transitions": 257
},
"result":
{
"preliminary_value": "no no no no no no yes unknown no no yes no no ",
"value": "no no no no no no yes unknown no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 571/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 314
lola: finding significant places
lola: 314 places, 257 transitions, 255 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: ((G (((1 <= p198) AND (1 <= p204))) U X (((1 <= p160) AND (1 <= p204)))) AND (X (X (((1 <= p62) AND (1 <= p309)))) OR X (G (((p160 <= 0) OR (p204 <= 0)))))) : G (X (F ((G (NOT((G (((1 <= p36) AND (1 <= p232) AND (1 <= p234))) U ((1 <= p36) AND (1 <= p232) AND (1 <= p234))))) OR ((1 <= p26) AND (1 <= p232) AND (1 <= p234)))))) : (((1 <= p45) AND (1 <= p232) AND (1 <= p234)) OR (NOT(X (F (((1 <= p59) AND (1 <= p309))))) AND NOT(G (((p145 <= 0) OR (p229 <= 0)))))) : F (G (X (F (((1 <= p222) AND (1 <= p224)))))) : G (((((1 <= p90) AND (1 <= p309)) U ((1 <= p221) AND (1 <= p226) AND (1 <= p228))) U G (F ((G (((1 <= p141) AND (1 <= p229))) AND ((p90 <= 0) OR (p309 <= 0))))))) : NOT(G (X (X (F (NOT(X ((((1 <= p247) AND (1 <= p264)) U NOT(F ((F (((1 <= p241) AND (1 <= p258))) OR ((1 <= p241) AND (1 <= p258))))))))))))) : F ((NOT(F (((1 <= 0) U NOT((((1 <= p145) AND (1 <= p229)) U ((1 <= p205))))))) U NOT(X (((1 <= p184) AND (1 <= p204)))))) : ((G (((1 <= p160) AND (1 <= p204))) OR F (G (((p160 <= 0) OR (p204 <= 0))))) OR ((1 <= p115) AND (1 <= p229))) : (X ((X (G (((1 <= p190) AND (1 <= p204)))) AND X (X (((1 <= p23) AND (1 <= p232) AND (1 <= p234)))))) U F (((1 <= p23) AND (1 <= p232) AND (1 <= p234)))) : F ((F (((1 <= p298) AND (1 <= p308))) OR ((1 <= p28) AND (1 <= p232) AND (1 <= p234)))) : (G (((1 <= p212) AND (1 <= p222) AND (1 <= p224))) OR X (NOT(X (((1 <= p140) AND (1 <= p229)))))) : G ((F ((X (G (((1 <= p130) AND (1 <= p229)))) OR G (((1 <= p130) AND (1 <= p229))))) AND ((p58 <= 0) OR (p309 <= 0)))) : F (G (X (X (F ((X (((1 <= p143) AND (1 <= p229))) OR ((1 <= p151) AND (1 <= p204))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p160) AND (1 <= p204))) OR (G (((1 <= p198) AND (1 <= p204))) AND X (F (((1 <= p160) AND (1 <= p204)))))) AND X ((X (((1 <= p62) AND (1 <= p309))) OR G (((p160 <= 0) OR (p204 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p198) AND (1 <= p204)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p198) AND (1 <= p204)))
lola: processed formula length: 33
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p160) AND (1 <= p204)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p160) AND (1 <= p204)))
lola: processed formula length: 33
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p45) AND (1 <= p232) AND (1 <= p234)) OR (X (G (((p59 <= 0) OR (p309 <= 0)))) AND F (((1 <= p145) AND (1 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p45) AND (1 <= p232) AND (1 <= p234))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p45) AND (1 <= p232) AND (1 <= p234))
lola: processed formula length: 44
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p145) AND (1 <= p229)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p145 <= 0) OR (p229 <= 0))
lola: processed formula length: 29
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p184 <= 0) OR (p204 <= 0))) OR (G ((F (((1 <= p205))) AND (((1 <= p145) AND (1 <= p229)) OR ((1 <= p205))))) AND X (F (((p184 <= 0) OR (p204 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p184 <= 0) OR (p204 <= 0))) OR (G ((F (((1 <= p205))) AND (((1 <= p145) AND (1 <= p229)) OR ((1 <= p205))))) AND X (F (((p184 <= 0) OR (p204 <= 0)))))))
lola: processed formula length: 163
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p212) AND (1 <= p222) AND (1 <= p224))) OR X (X (((p140 <= 0) OR (p229 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p212) AND (1 <= p222) AND (1 <= p224)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p212) AND (1 <= p222) AND (1 <= p224)))
lola: processed formula length: 49
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p140 <= 0) OR (p229 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p140 <= 0) OR (p229 <= 0))))
lola: processed formula length: 37
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X (G (((1 <= p130) AND (1 <= p229)))) OR G (((1 <= p130) AND (1 <= p229))))) AND ((p58 <= 0) OR (p309 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X (G (((1 <= p130) AND (1 <= p229)))) OR G (((1 <= p130) AND (1 <= p229))))) AND ((p58 <= 0) OR (p309 <= 0))))
lola: processed formula length: 119
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((1 <= p143) AND (1 <= p229))) OR ((1 <= p151) AND (1 <= p204)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((1 <= p143) AND (1 <= p229))) OR ((1 <= p151) AND (1 <= p204)))))
lola: processed formula length: 76
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p23) AND (1 <= p232) AND (1 <= p234)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p23 <= 0) OR (p232 <= 0) OR (p234 <= 0))
lola: processed formula length: 44
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p222) AND (1 <= p224))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p222) AND (1 <= p224))))
lola: processed formula length: 37
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 8 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))) AND G ((((1 <= p247) AND (1 <= p264)) OR G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))) AND G ((((1 <= p247) AND (1 <= p264)) OR G ((G (((p241 <= 0) OR (p258 <= 0))) AND ((p241 <= 0) OR (p258 <= 0))))))))
lola: processed formula length: 200
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 45 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 79374 markings, 2207933 edges, 15875 markings/sec, 0 secs
lola: 135266 markings, 4396139 edges, 11178 markings/sec, 5 secs
lola: 193545 markings, 6594994 edges, 11656 markings/sec, 10 secs
lola: 246999 markings, 8768781 edges, 10691 markings/sec, 15 secs
lola: 290462 markings, 10955675 edges, 8693 markings/sec, 20 secs
lola: 348586 markings, 13117558 edges, 11625 markings/sec, 25 secs
lola: 396729 markings, 15286390 edges, 9629 markings/sec, 30 secs
lola: 447803 markings, 17467473 edges, 10215 markings/sec, 35 secs
lola: 494808 markings, 19638245 edges, 9401 markings/sec, 40 secs
lola: 547546 markings, 21806222 edges, 10548 markings/sec, 45 secs
lola: 587111 markings, 23965135 edges, 7913 markings/sec, 50 secs
lola: 627422 markings, 26125523 edges, 8062 markings/sec, 55 secs
lola: 677264 markings, 28269275 edges, 9968 markings/sec, 60 secs
lola: 713488 markings, 30401275 edges, 7245 markings/sec, 65 secs
lola: 867814 markings, 32553906 edges, 30865 markings/sec, 70 secs
lola: 933167 markings, 34707077 edges, 13071 markings/sec, 75 secs
lola: 992064 markings, 36844046 edges, 11779 markings/sec, 80 secs
lola: 1054435 markings, 38972124 edges, 12474 markings/sec, 85 secs
lola: 1119832 markings, 41098767 edges, 13079 markings/sec, 90 secs
lola: 1177454 markings, 43214252 edges, 11524 markings/sec, 95 secs
lola: 1229531 markings, 45333030 edges, 10415 markings/sec, 100 secs
lola: 1273714 markings, 47455967 edges, 8837 markings/sec, 105 secs
lola: 1317799 markings, 49563000 edges, 8817 markings/sec, 110 secs
lola: 1361578 markings, 51665424 edges, 8756 markings/sec, 115 secs
lola: 1415263 markings, 53796580 edges, 10737 markings/sec, 120 secs
lola: 1460832 markings, 55937123 edges, 9114 markings/sec, 125 secs
lola: 1502612 markings, 58064462 edges, 8356 markings/sec, 130 secs
lola: 1545729 markings, 60180094 edges, 8623 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1558069 markings, 60570103 edges
lola: ========================================
lola: subprocess 9 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)) AND (F (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0))) OR G (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)))))) OR ((1 <= p26) AND (1 <= p232) AND (1 <= p234)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)) AND (F (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0))) OR G (((p36 <= 0) OR (p232 <= 0) OR (p234 <= 0)))))) OR ((1 <= p26) AND (1 <= p232) AND (1 <= p234)))))
lola: processed formula length: 215
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 216206 markings, 1716083 edges
lola: ========================================
lola: subprocess 10 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p141) AND (1 <= p229))) AND ((p90 <= 0) OR (p309 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p141) AND (1 <= p229))) AND ((p90 <= 0) OR (p309 <= 0)))))
lola: processed formula length: 76
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 1709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p298) AND (1 <= p308))) OR ((1 <= p28) AND (1 <= p232) AND (1 <= p234))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p298) AND (1 <= p308))) OR ((1 <= p28) AND (1 <= p232) AND (1 <= p234))))
lola: processed formula length: 87
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 12 will run for 3418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p160) AND (1 <= p204))) OR (F (G (((p160 <= 0) OR (p204 <= 0)))) OR ((1 <= p115) AND (1 <= p229))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p115) AND (1 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p115) AND (1 <= p229))
lola: processed formula length: 29
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p160 <= 0) OR (p204 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p160 <= 0) OR (p204 <= 0))))
lola: processed formula length: 37
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no no no no yes unknown no no yes no no
lola: memory consumption: 54172 KB
lola: time consumption: 153 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p160) AND (1 <= p204))) OR (F (G (((p160 <= 0) OR (p204 <= 0)))) OR ((1 <= p115) AND (1 <= p229))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p115) AND (1 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p115) AND (1 <= p229))
lola: processed formula length: 29
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((1 <= p160) AND (1 <= p204)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p160) AND (1 <= p204)))
lola: processed formula length: 33
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p160 <= 0) OR (p204 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p160 <= 0) OR (p204 <= 0))))
lola: processed formula length: 37
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 320740 markings, 1962995 edges, 64148 markings/sec, 0 secs
lola: 565557 markings, 3888526 edges, 48963 markings/sec, 5 secs
lola: 809350 markings, 5806890 edges, 48759 markings/sec, 10 secs
lola: 1026530 markings, 7715810 edges, 43436 markings/sec, 15 secs
lola: 1260108 markings, 9614815 edges, 46716 markings/sec, 20 secs
lola: 1507596 markings, 11530519 edges, 49498 markings/sec, 25 secs
lola: 1744919 markings, 13451257 edges, 47465 markings/sec, 30 secs
lola: 1989918 markings, 15364027 edges, 49000 markings/sec, 35 secs
lola: 2267822 markings, 17268449 edges, 55581 markings/sec, 40 secs
lola: 2495801 markings, 19161332 edges, 45596 markings/sec, 45 secs
lola: 2702710 markings, 21035858 edges, 41382 markings/sec, 50 secs
lola: 2937109 markings, 22928678 edges, 46880 markings/sec, 55 secs
lola: 3154365 markings, 24822885 edges, 43451 markings/sec, 60 secs
lola: 3427840 markings, 26689513 edges, 54695 markings/sec, 65 secs
lola: 3654586 markings, 28558035 edges, 45349 markings/sec, 70 secs
lola: 3874078 markings, 30383167 edges, 43898 markings/sec, 75 secs
lola: 4121303 markings, 32264946 edges, 49445 markings/sec, 80 secs
lola: 4370420 markings, 34184604 edges, 49823 markings/sec, 85 secs
lola: 4595721 markings, 36082547 edges, 45060 markings/sec, 90 secs
lola: 4841833 markings, 37987493 edges, 49222 markings/sec, 95 secs
lola: 5072373 markings, 39887201 edges, 46108 markings/sec, 100 secs
lola: 5314643 markings, 41781957 edges, 48454 markings/sec, 105 secs
lola: 5561220 markings, 43662894 edges, 49315 markings/sec, 110 secs
lola: 5764639 markings, 45540919 edges, 40684 markings/sec, 115 secs
lola: 5965800 markings, 47424049 edges, 40232 markings/sec, 120 secs
lola: 6160102 markings, 49313907 edges, 38860 markings/sec, 125 secs
lola: 6382573 markings, 51188438 edges, 44494 markings/sec, 130 secs
lola: 6585846 markings, 53076088 edges, 40655 markings/sec, 135 secs
lola: 6776128 markings, 54949879 edges, 38056 markings/sec, 140 secs
lola: 7002169 markings, 56791942 edges, 45208 markings/sec, 145 secs
lola: 7225297 markings, 58647887 edges, 44626 markings/sec, 150 secs
lola: 7429080 markings, 60495264 edges, 40757 markings/sec, 155 secs
lola: 7612247 markings, 62285038 edges, 36633 markings/sec, 160 secs
lola: 7790737 markings, 64074374 edges, 35698 markings/sec, 165 secs
lola: 7987657 markings, 65909733 edges, 39384 markings/sec, 170 secs
lola: 8224234 markings, 67872448 edges, 47315 markings/sec, 175 secs
lola: 8470203 markings, 69814486 edges, 49194 markings/sec, 180 secs
lola: 8685907 markings, 71723492 edges, 43141 markings/sec, 185 secs
lola: 8928941 markings, 73627281 edges, 48607 markings/sec, 190 secs
lola: 9170861 markings, 75573818 edges, 48384 markings/sec, 195 secs
lola: 9415877 markings, 77447680 edges, 49003 markings/sec, 200 secs
lola: 9654800 markings, 79404291 edges, 47785 markings/sec, 205 secs
lola: 9910017 markings, 81306815 edges, 51043 markings/sec, 210 secs
lola: 10154501 markings, 83278784 edges, 48897 markings/sec, 215 secs
lola: 10375841 markings, 85238808 edges, 44268 markings/sec, 220 secs
lola: 10595369 markings, 87189824 edges, 43906 markings/sec, 225 secs
lola: 10826287 markings, 89146367 edges, 46184 markings/sec, 230 secs
lola: 11057291 markings, 91084086 edges, 46201 markings/sec, 235 secs
lola: 11260793 markings, 93017387 edges, 40700 markings/sec, 240 secs
lola: 11517809 markings, 94898134 edges, 51403 markings/sec, 245 secs
lola: 11764144 markings, 96770744 edges, 49267 markings/sec, 250 secs
lola: 11981638 markings, 98633303 edges, 43499 markings/sec, 255 secs
lola: 12211045 markings, 100538702 edges, 45881 markings/sec, 260 secs
lola: 12414770 markings, 102421234 edges, 40745 markings/sec, 265 secs
lola: 12683776 markings, 104319758 edges, 53801 markings/sec, 270 secs
lola: 12918249 markings, 106253781 edges, 46895 markings/sec, 275 secs
lola: 13131061 markings, 108222889 edges, 42562 markings/sec, 280 secs
lola: 13327167 markings, 110164246 edges, 39221 markings/sec, 285 secs
lola: 13582011 markings, 112126566 edges, 50969 markings/sec, 290 secs
lola: 13822067 markings, 114055953 edges, 48011 markings/sec, 295 secs
lola: 14066192 markings, 115939157 edges, 48825 markings/sec, 300 secs
lola: 14281402 markings, 117816652 edges, 43042 markings/sec, 305 secs
lola: 14505829 markings, 119697314 edges, 44885 markings/sec, 310 secs
lola: 14735901 markings, 121593781 edges, 46014 markings/sec, 315 secs
lola: 14947799 markings, 123542807 edges, 42380 markings/sec, 320 secs
lola: 15151087 markings, 125472591 edges, 40658 markings/sec, 325 secs
lola: 15365807 markings, 127407057 edges, 42944 markings/sec, 330 secs
lola: 15564569 markings, 129341092 edges, 39752 markings/sec, 335 secs
lola: 15771542 markings, 131276702 edges, 41395 markings/sec, 340 secs
lola: 16014812 markings, 133140938 edges, 48654 markings/sec, 345 secs
lola: 16225574 markings, 135054811 edges, 42152 markings/sec, 350 secs
lola: 16477521 markings, 136911009 edges, 50389 markings/sec, 355 secs
lola: 16698259 markings, 138765035 edges, 44148 markings/sec, 360 secs
lola: 16881081 markings, 140616859 edges, 36564 markings/sec, 365 secs
lola: 17057248 markings, 142468271 edges, 35233 markings/sec, 370 secs
lola: 17250608 markings, 144331807 edges, 38672 markings/sec, 375 secs
lola: 17460128 markings, 146170819 edges, 41904 markings/sec, 380 secs
lola: 17679030 markings, 148020322 edges, 43780 markings/sec, 385 secs
lola: 17919189 markings, 149862153 edges, 48032 markings/sec, 390 secs
lola: 18115455 markings, 151676839 edges, 39253 markings/sec, 395 secs
lola: 18349371 markings, 153501646 edges, 46783 markings/sec, 400 secs
lola: 18583319 markings, 155332140 edges, 46790 markings/sec, 405 secs
lola: 18761902 markings, 157104636 edges, 35717 markings/sec, 410 secs
lola: 18958755 markings, 158906805 edges, 39371 markings/sec, 415 secs
lola: 19177233 markings, 160715032 edges, 43696 markings/sec, 420 secs
lola: 19424613 markings, 162543344 edges, 49476 markings/sec, 425 secs
lola: 19646662 markings, 164401498 edges, 44410 markings/sec, 430 secs
lola: 19838759 markings, 166251490 edges, 38419 markings/sec, 435 secs
lola: 20069002 markings, 168054018 edges, 46049 markings/sec, 440 secs
lola: 20291619 markings, 169873387 edges, 44523 markings/sec, 445 secs
lola: 20487457 markings, 171663437 edges, 39168 markings/sec, 450 secs
lola: 20692184 markings, 173463529 edges, 40945 markings/sec, 455 secs
lola: 20895427 markings, 175274917 edges, 40649 markings/sec, 460 secs
lola: 21115540 markings, 177089301 edges, 44023 markings/sec, 465 secs
lola: 21349925 markings, 178907552 edges, 46877 markings/sec, 470 secs
lola: 21579755 markings, 180807005 edges, 45966 markings/sec, 475 secs
lola: 21791873 markings, 182679448 edges, 42424 markings/sec, 480 secs
lola: 21994530 markings, 184547852 edges, 40531 markings/sec, 485 secs
lola: 22187994 markings, 186441144 edges, 38693 markings/sec, 490 secs
lola: 22399617 markings, 188342586 edges, 42325 markings/sec, 495 secs
lola: 22579508 markings, 190205271 edges, 35978 markings/sec, 500 secs
lola: 22802876 markings, 192073249 edges, 44674 markings/sec, 505 secs
lola: 23015287 markings, 193958171 edges, 42482 markings/sec, 510 secs
lola: 23192489 markings, 195799445 edges, 35440 markings/sec, 515 secs
lola: 23394018 markings, 197676333 edges, 40306 markings/sec, 520 secs
lola: 23633607 markings, 199516440 edges, 47918 markings/sec, 525 secs
lola: 23831799 markings, 201373583 edges, 39638 markings/sec, 530 secs
lola: 24027114 markings, 203212474 edges, 39063 markings/sec, 535 secs
lola: 24212590 markings, 205045175 edges, 37095 markings/sec, 540 secs
lola: 24393895 markings, 206844765 edges, 36261 markings/sec, 545 secs
lola: 24587767 markings, 208664242 edges, 38774 markings/sec, 550 secs
lola: 24767995 markings, 210506141 edges, 36046 markings/sec, 555 secs
lola: 24949535 markings, 212361807 edges, 36308 markings/sec, 560 secs
lola: 25121954 markings, 214216711 edges, 34484 markings/sec, 565 secs
lola: 25320082 markings, 216060295 edges, 39626 markings/sec, 570 secs
lola: 25548432 markings, 217893529 edges, 45670 markings/sec, 575 secs
lola: 25746579 markings, 219738631 edges, 39629 markings/sec, 580 secs
lola: 25981025 markings, 221566678 edges, 46889 markings/sec, 585 secs
lola: 26172476 markings, 223358910 edges, 38290 markings/sec, 590 secs
lola: 26389404 markings, 225189164 edges, 43386 markings/sec, 595 secs
lola: 26610329 markings, 227017436 edges, 44185 markings/sec, 600 secs
lola: 26798693 markings, 228931163 edges, 37673 markings/sec, 605 secs
lola: 26980729 markings, 230853268 edges, 36407 markings/sec, 610 secs
lola: 27177841 markings, 232795136 edges, 39422 markings/sec, 615 secs
lola: 27353075 markings, 234709386 edges, 35047 markings/sec, 620 secs
lola: 27547453 markings, 236627219 edges, 38876 markings/sec, 625 secs
lola: 27749628 markings, 238558287 edges, 40435 markings/sec, 630 secs
lola: 27927021 markings, 240459750 edges, 35479 markings/sec, 635 secs
lola: 28112381 markings, 242367678 edges, 37072 markings/sec, 640 secs
lola: 28322662 markings, 244259717 edges, 42056 markings/sec, 645 secs
lola: 28523903 markings, 246175113 edges, 40248 markings/sec, 650 secs
lola: 28704333 markings, 248053164 edges, 36086 markings/sec, 655 secs
lola: 28879024 markings, 249914281 edges, 34938 markings/sec, 660 secs
lola: 29047854 markings, 251738125 edges, 33766 markings/sec, 665 secs
lola: 29222792 markings, 253570944 edges, 34988 markings/sec, 670 secs
lola: 29394654 markings, 255454545 edges, 34372 markings/sec, 675 secs
lola: 29569237 markings, 257349372 edges, 34917 markings/sec, 680 secs
lola: 29730354 markings, 259239500 edges, 32223 markings/sec, 685 secs
lola: 29916814 markings, 261145765 edges, 37292 markings/sec, 690 secs
lola: 30127678 markings, 263027249 edges, 42173 markings/sec, 695 secs
lola: 30323624 markings, 264892030 edges, 39189 markings/sec, 700 secs
lola: 30535491 markings, 266782315 edges, 42373 markings/sec, 705 secs
lola: 30745752 markings, 268621568 edges, 42052 markings/sec, 710 secs
lola: 30932025 markings, 270426372 edges, 37255 markings/sec, 715 secs
lola: 31142485 markings, 272225001 edges, 42092 markings/sec, 720 secs
lola: 31349504 markings, 274033891 edges, 41404 markings/sec, 725 secs
lola: 31544284 markings, 275832437 edges, 38956 markings/sec, 730 secs
lola: 31769135 markings, 277644247 edges, 44970 markings/sec, 735 secs
lola: 31981376 markings, 279451783 edges, 42448 markings/sec, 740 secs
lola: 32199408 markings, 281270653 edges, 43606 markings/sec, 745 secs
lola: 32406843 markings, 283088038 edges, 41487 markings/sec, 750 secs
lola: 32592220 markings, 284879756 edges, 37075 markings/sec, 755 secs
lola: 32788633 markings, 286685365 edges, 39283 markings/sec, 760 secs
lola: 32985602 markings, 288498223 edges, 39394 markings/sec, 765 secs
lola: 33256292 markings, 290356193 edges, 54138 markings/sec, 770 secs
lola: 33462037 markings, 292196608 edges, 41149 markings/sec, 775 secs
lola: 33636072 markings, 293989222 edges, 34807 markings/sec, 780 secs
lola: 33824484 markings, 295822386 edges, 37682 markings/sec, 785 secs
lola: 33994053 markings, 297625819 edges, 33914 markings/sec, 790 secs
lola: 34204206 markings, 299445920 edges, 42031 markings/sec, 795 secs
lola: 34410745 markings, 301228323 edges, 41308 markings/sec, 800 secs
lola: 34628668 markings, 303036897 edges, 43585 markings/sec, 805 secs
lola: 34846241 markings, 304867988 edges, 43515 markings/sec, 810 secs
lola: 35083944 markings, 306712908 edges, 47541 markings/sec, 815 secs
lola: 35286682 markings, 308555134 edges, 40548 markings/sec, 820 secs
lola: 35478358 markings, 310418828 edges, 38335 markings/sec, 825 secs
lola: 35654564 markings, 312291723 edges, 35241 markings/sec, 830 secs
lola: 35826238 markings, 314148960 edges, 34335 markings/sec, 835 secs
lola: 35987214 markings, 315977275 edges, 32195 markings/sec, 840 secs
lola: 36154826 markings, 317822699 edges, 33522 markings/sec, 845 secs
lola: 36352971 markings, 319708072 edges, 39629 markings/sec, 850 secs
lola: 36546940 markings, 321568037 edges, 38794 markings/sec, 855 secs
lola: 36746053 markings, 323394086 edges, 39823 markings/sec, 860 secs
lola: 36953168 markings, 325272792 edges, 41423 markings/sec, 865 secs
lola: 37138510 markings, 327144825 edges, 37068 markings/sec, 870 secs
lola: 37347945 markings, 329019780 edges, 41887 markings/sec, 875 secs
lola: 37573425 markings, 330895788 edges, 45096 markings/sec, 880 secs
lola: 37771924 markings, 332773292 edges, 39700 markings/sec, 885 secs
lola: 37993175 markings, 334623993 edges, 44250 markings/sec, 890 secs
lola: 38206316 markings, 336407737 edges, 42628 markings/sec, 895 secs
lola: 38424744 markings, 338283614 edges, 43686 markings/sec, 900 secs
lola: 38612424 markings, 340193912 edges, 37536 markings/sec, 905 secs
lola: 38804283 markings, 342117204 edges, 38372 markings/sec, 910 secs
lola: 38997779 markings, 344051340 edges, 38699 markings/sec, 915 secs
lola: 39188420 markings, 345959595 edges, 38128 markings/sec, 920 secs
lola: 39404851 markings, 347905569 edges, 43286 markings/sec, 925 secs
lola: 39627795 markings, 349791987 edges, 44589 markings/sec, 930 secs
lola: 39850056 markings, 351698809 edges, 44452 markings/sec, 935 secs
lola: 40046677 markings, 353556756 edges, 39324 markings/sec, 940 secs
lola: 40264117 markings, 355431381 edges, 43488 markings/sec, 945 secs
lola: 40473767 markings, 357240201 edges, 41930 markings/sec, 950 secs
lola: 40699889 markings, 359069871 edges, 45224 markings/sec, 955 secs
lola: 40910465 markings, 360907244 edges, 42115 markings/sec, 960 secs
lola: 41112368 markings, 362783733 edges, 40381 markings/sec, 965 secs
lola: 41308856 markings, 364644979 edges, 39298 markings/sec, 970 secs
lola: 41488958 markings, 366463649 edges, 36020 markings/sec, 975 secs
lola: 41675845 markings, 368285063 edges, 37377 markings/sec, 980 secs
lola: 41880163 markings, 370167347 edges, 40864 markings/sec, 985 secs
lola: 42107238 markings, 372051074 edges, 45415 markings/sec, 990 secs
lola: 42345415 markings, 373907526 edges, 47635 markings/sec, 995 secs
lola: 42559717 markings, 375771631 edges, 42860 markings/sec, 1000 secs
lola: 42796448 markings, 377642946 edges, 47346 markings/sec, 1005 secs
lola: 43084127 markings, 379632091 edges, 57536 markings/sec, 1010 secs
lola: 43351958 markings, 381629145 edges, 53566 markings/sec, 1015 secs
lola: 43634466 markings, 383601650 edges, 56502 markings/sec, 1020 secs
lola: 43889698 markings, 385514994 edges, 51046 markings/sec, 1025 secs
lola: 44117212 markings, 387431673 edges, 45503 markings/sec, 1030 secs
lola: 44353942 markings, 389346220 edges, 47346 markings/sec, 1035 secs
lola: 44586733 markings, 391200719 edges, 46558 markings/sec, 1040 secs
lola: 44848083 markings, 393072520 edges, 52270 markings/sec, 1045 secs
lola: 45090778 markings, 395051542 edges, 48539 markings/sec, 1050 secs
lola: 45331290 markings, 397004527 edges, 48102 markings/sec, 1055 secs
lola: 45577192 markings, 398921270 edges, 49180 markings/sec, 1060 secs
lola: 45774713 markings, 400739125 edges, 39504 markings/sec, 1065 secs
lola: 45970468 markings, 402499164 edges, 39151 markings/sec, 1070 secs
lola: 46217514 markings, 404402756 edges, 49409 markings/sec, 1075 secs
lola: 46434223 markings, 406397142 edges, 43342 markings/sec, 1080 secs
lola: 46657050 markings, 408352958 edges, 44565 markings/sec, 1085 secs
lola: 46865822 markings, 410265995 edges, 41754 markings/sec, 1090 secs
lola: 47075327 markings, 412155851 edges, 41901 markings/sec, 1095 secs
lola: 47319233 markings, 414047148 edges, 48781 markings/sec, 1100 secs
lola: 47560658 markings, 416013450 edges, 48285 markings/sec, 1105 secs
lola: 47789658 markings, 417964306 edges, 45800 markings/sec, 1110 secs
lola: 48021291 markings, 419892818 edges, 46327 markings/sec, 1115 secs
lola: 48203414 markings, 421776554 edges, 36425 markings/sec, 1120 secs
lola: 48393699 markings, 423703689 edges, 38057 markings/sec, 1125 secs
lola: 48580900 markings, 425627786 edges, 37440 markings/sec, 1130 secs
lola: 48769913 markings, 427511265 edges, 37803 markings/sec, 1135 secs
lola: 48978625 markings, 429423675 edges, 41742 markings/sec, 1140 secs
lola: 49186828 markings, 431330005 edges, 41641 markings/sec, 1145 secs
lola: 49428171 markings, 433218628 edges, 48269 markings/sec, 1150 secs
lola: 49626426 markings, 435087882 edges, 39651 markings/sec, 1155 secs
lola: 49804290 markings, 436910988 edges, 35573 markings/sec, 1160 secs
lola: 50028018 markings, 438813995 edges, 44746 markings/sec, 1165 secs
lola: 50233374 markings, 440649545 edges, 41071 markings/sec, 1170 secs
lola: 50417563 markings, 442480682 edges, 36838 markings/sec, 1175 secs
lola: 50617432 markings, 444325410 edges, 39974 markings/sec, 1180 secs
lola: 50787804 markings, 446124033 edges, 34074 markings/sec, 1185 secs
lola: 50980747 markings, 447972461 edges, 38589 markings/sec, 1190 secs
lola: 51225399 markings, 449853078 edges, 48930 markings/sec, 1195 secs
lola: 51447261 markings, 451711828 edges, 44372 markings/sec, 1200 secs
lola: 51671075 markings, 453575694 edges, 44763 markings/sec, 1205 secs
lola: 51871385 markings, 455351723 edges, 40062 markings/sec, 1210 secs
lola: 52080428 markings, 457159774 edges, 41809 markings/sec, 1215 secs
lola: 52297505 markings, 459060510 edges, 43415 markings/sec, 1220 secs
lola: 52482032 markings, 460883670 edges, 36905 markings/sec, 1225 secs
lola: 52711003 markings, 462763927 edges, 45794 markings/sec, 1230 secs
lola: 53006860 markings, 464675647 edges, 59171 markings/sec, 1235 secs
lola: 53271465 markings, 466568631 edges, 52921 markings/sec, 1240 secs
lola: 53478014 markings, 468427217 edges, 41310 markings/sec, 1245 secs
lola: 53681449 markings, 470294680 edges, 40687 markings/sec, 1250 secs
lola: 53915120 markings, 472172939 edges, 46734 markings/sec, 1255 secs
lola: 54212165 markings, 474178975 edges, 59409 markings/sec, 1260 secs
lola: 54484320 markings, 476195571 edges, 54431 markings/sec, 1265 secs
lola: 54749238 markings, 478186364 edges, 52984 markings/sec, 1270 secs
lola: 55024411 markings, 480116096 edges, 55035 markings/sec, 1275 secs
lola: 55259029 markings, 482043191 edges, 46924 markings/sec, 1280 secs
lola: 55519823 markings, 483986611 edges, 52159 markings/sec, 1285 secs
lola: 55740939 markings, 485954923 edges, 44223 markings/sec, 1290 secs
lola: 55952423 markings, 487926582 edges, 42297 markings/sec, 1295 secs
lola: 56169454 markings, 489867950 edges, 43406 markings/sec, 1300 secs
lola: 56339475 markings, 491756255 edges, 34004 markings/sec, 1305 secs
lola: 56513937 markings, 493668118 edges, 34892 markings/sec, 1310 secs
lola: 56676580 markings, 495575680 edges, 32529 markings/sec, 1315 secs
lola: 56863240 markings, 497493128 edges, 37332 markings/sec, 1320 secs
lola: 57047199 markings, 499401445 edges, 36792 markings/sec, 1325 secs
lola: 57236843 markings, 501335767 edges, 37929 markings/sec, 1330 secs
lola: 57453607 markings, 503216655 edges, 43353 markings/sec, 1335 secs
lola: 57643745 markings, 505097915 edges, 38028 markings/sec, 1340 secs
lola: 57811802 markings, 506903832 edges, 33611 markings/sec, 1345 secs
lola: 58002669 markings, 508733537 edges, 38173 markings/sec, 1350 secs
lola: 58195115 markings, 510573373 edges, 38489 markings/sec, 1355 secs
lola: 58373679 markings, 512418895 edges, 35713 markings/sec, 1360 secs
lola: 58547792 markings, 514245946 edges, 34823 markings/sec, 1365 secs
lola: 58712585 markings, 516051552 edges, 32959 markings/sec, 1370 secs
lola: 58879081 markings, 517851528 edges, 33299 markings/sec, 1375 secs
lola: 59092968 markings, 519747046 edges, 42777 markings/sec, 1380 secs
lola: 59270480 markings, 521613881 edges, 35502 markings/sec, 1385 secs
lola: 59497502 markings, 523493416 edges, 45404 markings/sec, 1390 secs
lola: 59690494 markings, 525355780 edges, 38598 markings/sec, 1395 secs
lola: 59880675 markings, 527146054 edges, 38036 markings/sec, 1400 secs
lola: 60092880 markings, 528953345 edges, 42441 markings/sec, 1405 secs
lola: 60284038 markings, 530782481 edges, 38232 markings/sec, 1410 secs
lola: 60455312 markings, 532580753 edges, 34255 markings/sec, 1415 secs
lola: 60648156 markings, 534394464 edges, 38569 markings/sec, 1420 secs
lola: 60831869 markings, 536198923 edges, 36743 markings/sec, 1425 secs
lola: 61016880 markings, 538044329 edges, 37002 markings/sec, 1430 secs
lola: 61216520 markings, 539949449 edges, 39928 markings/sec, 1435 secs
lola: 61407284 markings, 541837749 edges, 38153 markings/sec, 1440 secs
lola: 61670820 markings, 543815099 edges, 52707 markings/sec, 1445 secs
lola: 61919069 markings, 545801175 edges, 49650 markings/sec, 1450 secs
lola: 62153066 markings, 547788647 edges, 46799 markings/sec, 1455 secs
lola: 62409065 markings, 549744717 edges, 51200 markings/sec, 1460 secs
lola: 62634163 markings, 551677990 edges, 45020 markings/sec, 1465 secs
lola: 62843131 markings, 553614210 edges, 41794 markings/sec, 1470 secs
lola: 63108819 markings, 555551040 edges, 53138 markings/sec, 1475 secs
lola: 63315496 markings, 557356230 edges, 41335 markings/sec, 1480 secs
lola: 63499543 markings, 559163737 edges, 36809 markings/sec, 1485 secs
lola: 63745372 markings, 560982704 edges, 49166 markings/sec, 1490 secs
lola: 64054088 markings, 562939412 edges, 61743 markings/sec, 1495 secs
lola: 64323327 markings, 564901468 edges, 53848 markings/sec, 1500 secs
lola: 64597336 markings, 567141078 edges, 54802 markings/sec, 1505 secs
lola: 64823098 markings, 569082803 edges, 45152 markings/sec, 1510 secs
lola: 65102824 markings, 571300754 edges, 55945 markings/sec, 1515 secs
lola: 65333092 markings, 573246694 edges, 46054 markings/sec, 1520 secs
lola: 65558143 markings, 575216859 edges, 45010 markings/sec, 1525 secs
lola: 65827109 markings, 577136668 edges, 53793 markings/sec, 1530 secs
lola: 66081251 markings, 579113128 edges, 50828 markings/sec, 1535 secs
lola: 66298486 markings, 581078014 edges, 43447 markings/sec, 1540 secs
lola: 66557684 markings, 583035185 edges, 51840 markings/sec, 1545 secs
lola: 66815057 markings, 584994714 edges, 51475 markings/sec, 1550 secs
lola: 67047651 markings, 586964227 edges, 46519 markings/sec, 1555 secs
lola: 67293103 markings, 588906362 edges, 49090 markings/sec, 1560 secs
lola: 67518565 markings, 590846401 edges, 45092 markings/sec, 1565 secs
lola: 67745584 markings, 592781071 edges, 45404 markings/sec, 1570 secs
lola: 67980951 markings, 594716675 edges, 47073 markings/sec, 1575 secs
lola: 68226104 markings, 596642785 edges, 49031 markings/sec, 1580 secs
lola: 68474932 markings, 598552566 edges, 49766 markings/sec, 1585 secs
lola: 68710658 markings, 600486531 edges, 47145 markings/sec, 1590 secs
lola: 68955888 markings, 602354285 edges, 49046 markings/sec, 1595 secs
lola: 69172287 markings, 604232727 edges, 43280 markings/sec, 1600 secs
lola: 69385492 markings, 606130252 edges, 42641 markings/sec, 1605 secs
lola: 69578278 markings, 608064414 edges, 38557 markings/sec, 1610 secs
lola: 69792040 markings, 610002707 edges, 42752 markings/sec, 1615 secs
lola: 70014878 markings, 611938765 edges, 44568 markings/sec, 1620 secs
lola: 70220264 markings, 613873306 edges, 41077 markings/sec, 1625 secs
lola: 70429511 markings, 615821715 edges, 41849 markings/sec, 1630 secs
lola: 70636621 markings, 617782164 edges, 41422 markings/sec, 1635 secs
lola: 70825151 markings, 619704841 edges, 37706 markings/sec, 1640 secs
lola: 71026132 markings, 621632240 edges, 40196 markings/sec, 1645 secs
lola: 71266087 markings, 623542586 edges, 47991 markings/sec, 1650 secs
lola: 71483078 markings, 625456460 edges, 43398 markings/sec, 1655 secs
lola: 71685997 markings, 627360363 edges, 40584 markings/sec, 1660 secs
lola: 71873017 markings, 629244574 edges, 37404 markings/sec, 1665 secs
lola: 72068165 markings, 631092378 edges, 39030 markings/sec, 1670 secs
lola: 72247823 markings, 632915439 edges, 35932 markings/sec, 1675 secs
lola: 72428331 markings, 634790869 edges, 36102 markings/sec, 1680 secs
lola: 72621592 markings, 636687484 edges, 38652 markings/sec, 1685 secs
lola: 72814015 markings, 638604762 edges, 38485 markings/sec, 1690 secs
lola: 72992774 markings, 640500470 edges, 35752 markings/sec, 1695 secs
lola: 73193153 markings, 642383717 edges, 40076 markings/sec, 1700 secs
lola: 73436225 markings, 644254749 edges, 48614 markings/sec, 1705 secs
lola: 73637601 markings, 646137714 edges, 40275 markings/sec, 1710 secs
lola: 73887201 markings, 648014300 edges, 49920 markings/sec, 1715 secs
lola: 74077003 markings, 649823982 edges, 37960 markings/sec, 1720 secs
lola: 74296596 markings, 651676100 edges, 43919 markings/sec, 1725 secs
lola: 74486664 markings, 653487798 edges, 38014 markings/sec, 1730 secs
lola: 74717338 markings, 655332230 edges, 46135 markings/sec, 1735 secs
lola: 74930000 markings, 657162896 edges, 42532 markings/sec, 1740 secs
lola: 75136763 markings, 659022421 edges, 41353 markings/sec, 1745 secs
lola: 75325044 markings, 660902461 edges, 37656 markings/sec, 1750 secs
lola: 75513988 markings, 662783738 edges, 37789 markings/sec, 1755 secs
lola: 75698656 markings, 664653224 edges, 36934 markings/sec, 1760 secs
lola: 75868106 markings, 666475915 edges, 33890 markings/sec, 1765 secs
lola: 76088227 markings, 668369483 edges, 44024 markings/sec, 1770 secs
lola: 76304161 markings, 670261219 edges, 43187 markings/sec, 1775 secs
lola: 76510406 markings, 672098129 edges, 41249 markings/sec, 1780 secs
lola: 76725724 markings, 673954322 edges, 43064 markings/sec, 1785 secs
lola: 76987919 markings, 675857579 edges, 52439 markings/sec, 1790 secs
lola: 77225030 markings, 677748097 edges, 47422 markings/sec, 1795 secs
lola: 77465143 markings, 679652918 edges, 48023 markings/sec, 1800 secs
lola: 77726910 markings, 681605608 edges, 52353 markings/sec, 1805 secs
lola: 78035816 markings, 683530493 edges, 61781 markings/sec, 1810 secs
lola: 78310333 markings, 685463132 edges, 54903 markings/sec, 1815 secs
lola: 78588152 markings, 687381188 edges, 55564 markings/sec, 1820 secs
lola: 78824503 markings, 689264945 edges, 47270 markings/sec, 1825 secs
lola: 79100093 markings, 691136682 edges, 55118 markings/sec, 1830 secs
lola: 79327563 markings, 692999793 edges, 45494 markings/sec, 1835 secs
lola: 79584167 markings, 694975148 edges, 51321 markings/sec, 1840 secs
lola: 79818635 markings, 696945004 edges, 46894 markings/sec, 1845 secs
lola: 80056675 markings, 698891861 edges, 47608 markings/sec, 1850 secs
lola: 80303137 markings, 700815449 edges, 49292 markings/sec, 1855 secs
lola: 80530738 markings, 702766231 edges, 45520 markings/sec, 1860 secs
lola: 80760635 markings, 704729875 edges, 45979 markings/sec, 1865 secs
lola: 80993405 markings, 706671759 edges, 46554 markings/sec, 1870 secs
lola: 81176978 markings, 708568340 edges, 36715 markings/sec, 1875 secs
lola: 81366558 markings, 710490425 edges, 37916 markings/sec, 1880 secs
lola: 81540695 markings, 712391815 edges, 34827 markings/sec, 1885 secs
lola: 81742429 markings, 714311477 edges, 40347 markings/sec, 1890 secs
lola: 81942897 markings, 716209011 edges, 40094 markings/sec, 1895 secs
lola: 82150155 markings, 718139486 edges, 41452 markings/sec, 1900 secs
lola: 82375039 markings, 720020487 edges, 44977 markings/sec, 1905 secs
lola: 82591689 markings, 721910763 edges, 43330 markings/sec, 1910 secs
lola: 82772416 markings, 723724942 edges, 36145 markings/sec, 1915 secs
lola: 82976315 markings, 725580654 edges, 40780 markings/sec, 1920 secs
lola: 83188260 markings, 727434459 edges, 42389 markings/sec, 1925 secs
lola: 83416727 markings, 729276195 edges, 45693 markings/sec, 1930 secs
lola: 83631821 markings, 731169782 edges, 43019 markings/sec, 1935 secs
lola: 83820206 markings, 733076533 edges, 37677 markings/sec, 1940 secs
lola: 84023799 markings, 734976777 edges, 40719 markings/sec, 1945 secs
lola: 84242903 markings, 736855337 edges, 43821 markings/sec, 1950 secs
lola: 84438869 markings, 738691420 edges, 39193 markings/sec, 1955 secs
lola: 84621682 markings, 740534709 edges, 36563 markings/sec, 1960 secs
lola: 84805202 markings, 742387227 edges, 36704 markings/sec, 1965 secs
lola: 85048194 markings, 744293158 edges, 48598 markings/sec, 1970 secs
lola: 85277584 markings, 746189213 edges, 45878 markings/sec, 1975 secs
lola: 85505162 markings, 748104302 edges, 45516 markings/sec, 1980 secs
lola: 85701356 markings, 749977404 edges, 39239 markings/sec, 1985 secs
lola: 85913333 markings, 751804107 edges, 42395 markings/sec, 1990 secs
lola: 86121448 markings, 753645969 edges, 41623 markings/sec, 1995 secs
lola: 86363119 markings, 755530093 edges, 48334 markings/sec, 2000 secs
lola: 86583369 markings, 757431189 edges, 44050 markings/sec, 2005 secs
lola: 86801457 markings, 759355141 edges, 43618 markings/sec, 2010 secs
lola: 87012331 markings, 761271717 edges, 42175 markings/sec, 2015 secs
lola: 87296233 markings, 763247753 edges, 56780 markings/sec, 2020 secs
lola: 87583284 markings, 765256434 edges, 57410 markings/sec, 2025 secs
lola: 87838946 markings, 767249128 edges, 51132 markings/sec, 2030 secs
lola: 88115015 markings, 769217932 edges, 55214 markings/sec, 2035 secs
lola: 88371254 markings, 771150758 edges, 51248 markings/sec, 2040 secs
lola: 88599353 markings, 773087605 edges, 45620 markings/sec, 2045 secs
lola: 88877611 markings, 775030214 edges, 55652 markings/sec, 2050 secs
lola: 89184080 markings, 776950869 edges, 61294 markings/sec, 2055 secs
lola: 89435773 markings, 778880524 edges, 50339 markings/sec, 2060 secs
lola: 89636669 markings, 780748511 edges, 40179 markings/sec, 2065 secs
lola: 89921586 markings, 782593927 edges, 56983 markings/sec, 2070 secs
lola: 90193238 markings, 784533929 edges, 54330 markings/sec, 2075 secs
lola: 90428886 markings, 786475781 edges, 47130 markings/sec, 2080 secs
lola: 90670341 markings, 788400868 edges, 48291 markings/sec, 2085 secs
lola: 90899848 markings, 790354799 edges, 45901 markings/sec, 2090 secs
lola: 91130951 markings, 792306715 edges, 46221 markings/sec, 2095 secs
lola: 91339149 markings, 794244694 edges, 41640 markings/sec, 2100 secs
lola: 91599979 markings, 796203797 edges, 52166 markings/sec, 2105 secs
lola: 91843039 markings, 798136523 edges, 48612 markings/sec, 2110 secs
lola: 92066983 markings, 800083973 edges, 44789 markings/sec, 2115 secs
lola: 92306936 markings, 802042469 edges, 47991 markings/sec, 2120 secs
lola: 92521573 markings, 803957642 edges, 42927 markings/sec, 2125 secs
lola: 92737721 markings, 805916573 edges, 43230 markings/sec, 2130 secs
lola: 92949209 markings, 807874661 edges, 42298 markings/sec, 2135 secs
lola: 93183850 markings, 809871114 edges, 46928 markings/sec, 2140 secs
lola: 93447157 markings, 811857985 edges, 52661 markings/sec, 2145 secs
lola: 93707968 markings, 813828927 edges, 52162 markings/sec, 2150 secs
lola: 93968880 markings, 815823178 edges, 52182 markings/sec, 2155 secs
lola: 94217933 markings, 817789180 edges, 49811 markings/sec, 2160 secs
lola: 94473736 markings, 819737192 edges, 51161 markings/sec, 2165 secs
lola: 94703074 markings, 821689695 edges, 45868 markings/sec, 2170 secs
lola: 94952434 markings, 823679549 edges, 49872 markings/sec, 2175 secs
lola: 95223714 markings, 825677497 edges, 54256 markings/sec, 2180 secs
lola: 95497168 markings, 827605190 edges, 54691 markings/sec, 2185 secs
lola: 95766962 markings, 829510446 edges, 53959 markings/sec, 2190 secs
lola: 96007613 markings, 831414999 edges, 48130 markings/sec, 2195 secs
lola: 96230618 markings, 833302757 edges, 44601 markings/sec, 2200 secs
lola: 96458437 markings, 835202375 edges, 45564 markings/sec, 2205 secs
lola: 96673327 markings, 837116639 edges, 42978 markings/sec, 2210 secs
lola: 96902481 markings, 839033785 edges, 45831 markings/sec, 2215 secs
lola: 97129380 markings, 840945243 edges, 45380 markings/sec, 2220 secs
lola: 97368520 markings, 842839760 edges, 47828 markings/sec, 2225 secs
lola: 97611881 markings, 844725917 edges, 48672 markings/sec, 2230 secs
lola: 97849569 markings, 846612068 edges, 47538 markings/sec, 2235 secs
lola: 98054858 markings, 848481851 edges, 41058 markings/sec, 2240 secs
lola: 98250200 markings, 850350136 edges, 39068 markings/sec, 2245 secs
lola: 98446972 markings, 852242866 edges, 39354 markings/sec, 2250 secs
lola: 98639449 markings, 854078840 edges, 38495 markings/sec, 2255 secs
lola: 98828166 markings, 855930008 edges, 37743 markings/sec, 2260 secs
lola: 99013698 markings, 857821885 edges, 37106 markings/sec, 2265 secs
lola: 99227714 markings, 859684059 edges, 42803 markings/sec, 2270 secs
lola: 99442057 markings, 861532791 edges, 42869 markings/sec, 2275 secs
lola: 99657944 markings, 863429508 edges, 43177 markings/sec, 2280 secs
lola: 99897575 markings, 865300134 edges, 47926 markings/sec, 2285 secs
lola: 100143633 markings, 867184560 edges, 49212 markings/sec, 2290 secs
lola: 100359054 markings, 869058837 edges, 43084 markings/sec, 2295 secs
lola: 100602288 markings, 870913498 edges, 48647 markings/sec, 2300 secs
lola: 100854077 markings, 872788849 edges, 50358 markings/sec, 2305 secs
lola: 101076726 markings, 874614792 edges, 44530 markings/sec, 2310 secs
lola: 101295401 markings, 876415767 edges, 43735 markings/sec, 2315 secs
lola: 101509819 markings, 878210747 edges, 42884 markings/sec, 2320 secs
lola: 101712424 markings, 880005761 edges, 40521 markings/sec, 2325 secs
lola: 101907002 markings, 881797226 edges, 38916 markings/sec, 2330 secs
lola: 102089450 markings, 883604777 edges, 36490 markings/sec, 2335 secs
lola: 102286720 markings, 885438762 edges, 39454 markings/sec, 2340 secs
lola: 102528041 markings, 887306052 edges, 48264 markings/sec, 2345 secs
lola: 102763063 markings, 889195269 edges, 47004 markings/sec, 2350 secs
lola: 102959077 markings, 891071158 edges, 39203 markings/sec, 2355 secs
lola: 103133921 markings, 892947588 edges, 34969 markings/sec, 2360 secs
lola: 103345392 markings, 894841952 edges, 42294 markings/sec, 2365 secs
lola: 103557301 markings, 896736435 edges, 42382 markings/sec, 2370 secs
lola: 103748984 markings, 898627552 edges, 38337 markings/sec, 2375 secs
lola: 103995298 markings, 900486873 edges, 49263 markings/sec, 2380 secs
lola: 104246479 markings, 902330439 edges, 50236 markings/sec, 2385 secs
lola: 104512359 markings, 904134639 edges, 53176 markings/sec, 2390 secs
lola: 104738865 markings, 905927882 edges, 45301 markings/sec, 2395 secs
lola: 104954155 markings, 907716229 edges, 43058 markings/sec, 2400 secs
lola: 105171003 markings, 909544697 edges, 43370 markings/sec, 2405 secs
lola: 105376037 markings, 911348547 edges, 41007 markings/sec, 2410 secs
lola: 105618412 markings, 913155869 edges, 48475 markings/sec, 2415 secs
lola: 105850181 markings, 914931257 edges, 46354 markings/sec, 2420 secs
lola: 106054533 markings, 916612550 edges, 40870 markings/sec, 2425 secs
lola: 106183461 markings, 917886262 edges, 25786 markings/sec, 2430 secs
lola: 106369857 markings, 919654956 edges, 37279 markings/sec, 2435 secs
lola: 106576867 markings, 921514963 edges, 41402 markings/sec, 2440 secs
lola: 106780264 markings, 923377166 edges, 40679 markings/sec, 2445 secs
lola: 106970834 markings, 925225045 edges, 38114 markings/sec, 2450 secs
lola: 107178060 markings, 927066173 edges, 41445 markings/sec, 2455 secs
lola: 107361800 markings, 928832194 edges, 36748 markings/sec, 2460 secs
lola: 107525228 markings, 930308020 edges, 32686 markings/sec, 2465 secs
lola: 107695946 markings, 931944606 edges, 34144 markings/sec, 2470 secs
lola: 107884284 markings, 933656223 edges, 37668 markings/sec, 2475 secs
lola: 108041674 markings, 935210468 edges, 31478 markings/sec, 2480 secs
lola: 108198016 markings, 936889094 edges, 31268 markings/sec, 2485 secs
lola: 108375758 markings, 938705923 edges, 35548 markings/sec, 2490 secs
lola: 108557294 markings, 940558026 edges, 36307 markings/sec, 2495 secs
lola: 108737808 markings, 942371339 edges, 36103 markings/sec, 2500 secs
lola: 108907923 markings, 944149194 edges, 34023 markings/sec, 2505 secs
lola: 109068680 markings, 945825439 edges, 32151 markings/sec, 2510 secs
lola: 109241360 markings, 947387953 edges, 34536 markings/sec, 2515 secs
lola: 109446567 markings, 949204940 edges, 41041 markings/sec, 2520 secs
lola: 109642104 markings, 951052716 edges, 39107 markings/sec, 2525 secs
lola: 109843590 markings, 952881663 edges, 40297 markings/sec, 2530 secs
lola: 110025671 markings, 954686351 edges, 36416 markings/sec, 2535 secs
lola: 110195550 markings, 956286597 edges, 33976 markings/sec, 2540 secs
lola: 110378280 markings, 957981781 edges, 36546 markings/sec, 2545 secs
lola: 110552283 markings, 959676201 edges, 34801 markings/sec, 2550 secs
lola: 110712343 markings, 961369806 edges, 32012 markings/sec, 2555 secs
lola: 110876005 markings, 963078469 edges, 32732 markings/sec, 2560 secs
lola: 111032261 markings, 964820712 edges, 31251 markings/sec, 2565 secs
lola: 111193214 markings, 966561144 edges, 32191 markings/sec, 2570 secs
lola: 111374296 markings, 968230866 edges, 36216 markings/sec, 2575 secs
lola: 111586366 markings, 970023359 edges, 42414 markings/sec, 2580 secs
lola: 111785632 markings, 971812234 edges, 39853 markings/sec, 2585 secs
lola: 111957276 markings, 973557850 edges, 34329 markings/sec, 2590 secs
lola: 112119717 markings, 974961851 edges, 32488 markings/sec, 2595 secs
lola: 112276058 markings, 976552411 edges, 31268 markings/sec, 2600 secs
lola: 112472184 markings, 978362620 edges, 39225 markings/sec, 2605 secs
lola: 112645572 markings, 980189800 edges, 34678 markings/sec, 2610 secs
lola: 112819642 markings, 981996525 edges, 34814 markings/sec, 2615 secs
lola: 112977438 markings, 983649477 edges, 31559 markings/sec, 2620 secs
lola: 113131080 markings, 985358093 edges, 30728 markings/sec, 2625 secs
lola: 113293566 markings, 987168668 edges, 32497 markings/sec, 2630 secs
lola: 113469471 markings, 988991826 edges, 35181 markings/sec, 2635 secs
lola: 113642108 markings, 990790554 edges, 34527 markings/sec, 2640 secs
lola: 113809732 markings, 992417897 edges, 33525 markings/sec, 2645 secs
lola: 114013698 markings, 994237610 edges, 40793 markings/sec, 2650 secs
lola: 114234180 markings, 996077549 edges, 44096 markings/sec, 2655 secs
lola: 114440217 markings, 997837144 edges, 41207 markings/sec, 2660 secs
lola: 114605781 markings, 999562871 edges, 33113 markings/sec, 2665 secs
lola: 114791040 markings, 1001357018 edges, 37052 markings/sec, 2670 secs
lola: 114987673 markings, 1003201915 edges, 39327 markings/sec, 2675 secs
lola: 115184982 markings, 1005039385 edges, 39462 markings/sec, 2680 secs
lola: 115412985 markings, 1006826575 edges, 45601 markings/sec, 2685 secs
lola: 115607774 markings, 1008563925 edges, 38958 markings/sec, 2690 secs
lola: 115786931 markings, 1010263531 edges, 35831 markings/sec, 2695 secs
lola: 115968976 markings, 1011985600 edges, 36409 markings/sec, 2700 secs
lola: 116165605 markings, 1013716915 edges, 39326 markings/sec, 2705 secs
lola: 116374469 markings, 1015393358 edges, 41773 markings/sec, 2710 secs
lola: 116569962 markings, 1017172848 edges, 39099 markings/sec, 2715 secs
lola: 116766653 markings, 1018965432 edges, 39338 markings/sec, 2720 secs
lola: 116943959 markings, 1020531422 edges, 35461 markings/sec, 2725 secs
lola: 117102543 markings, 1022038520 edges, 31717 markings/sec, 2730 secs
lola: 117281726 markings, 1023755286 edges, 35837 markings/sec, 2735 secs
lola: 117445996 markings, 1025374004 edges, 32854 markings/sec, 2740 secs
lola: 117604495 markings, 1026997735 edges, 31700 markings/sec, 2745 secs
lola: 117780020 markings, 1028641469 edges, 35105 markings/sec, 2750 secs
lola: 117988860 markings, 1030414881 edges, 41768 markings/sec, 2755 secs
lola: 118136356 markings, 1031857761 edges, 29499 markings/sec, 2760 secs
lola: 118326732 markings, 1033510711 edges, 38075 markings/sec, 2765 secs
lola: 118529555 markings, 1035294588 edges, 40565 markings/sec, 2770 secs
lola: 118724951 markings, 1037051200 edges, 39079 markings/sec, 2775 secs
lola: 118932326 markings, 1038731205 edges, 41475 markings/sec, 2780 secs
lola: 119148419 markings, 1040515594 edges, 43219 markings/sec, 2785 secs
lola: 119385983 markings, 1042327432 edges, 47513 markings/sec, 2790 secs
lola: 119594238 markings, 1044001217 edges, 41651 markings/sec, 2795 secs
lola: 119799951 markings, 1045759452 edges, 41143 markings/sec, 2800 secs
lola: 119998413 markings, 1047510732 edges, 39692 markings/sec, 2805 secs
lola: 120185406 markings, 1049274620 edges, 37399 markings/sec, 2810 secs
lola: 120343757 markings, 1050932471 edges, 31670 markings/sec, 2815 secs
lola: 120509074 markings, 1052635010 edges, 33063 markings/sec, 2820 secs
lola: 120713990 markings, 1054381150 edges, 40983 markings/sec, 2825 secs
lola: 120922391 markings, 1056155304 edges, 41680 markings/sec, 2830 secs
lola: 121104406 markings, 1057833184 edges, 36403 markings/sec, 2835 secs
lola: 121299304 markings, 1059597362 edges, 38980 markings/sec, 2840 secs
lola: 121472560 markings, 1061357221 edges, 34651 markings/sec, 2845 secs
lola: 121655175 markings, 1063124815 edges, 36523 markings/sec, 2850 secs
lola: 121871299 markings, 1064932285 edges, 43225 markings/sec, 2855 secs
lola: 122068997 markings, 1066730359 edges, 39540 markings/sec, 2860 secs
lola: 122234382 markings, 1068443097 edges, 33077 markings/sec, 2865 secs
lola: 122408545 markings, 1070217542 edges, 34833 markings/sec, 2870 secs
lola: 122593659 markings, 1071998093 edges, 37023 markings/sec, 2875 secs
lola: 122808951 markings, 1073795781 edges, 43058 markings/sec, 2880 secs
lola: 123007669 markings, 1075611125 edges, 39744 markings/sec, 2885 secs
lola: 123202682 markings, 1077422464 edges, 39003 markings/sec, 2890 secs
lola: 123408361 markings, 1079213567 edges, 41136 markings/sec, 2895 secs
lola: 123601190 markings, 1080984368 edges, 38566 markings/sec, 2900 secs
lola: 123818031 markings, 1082740368 edges, 43368 markings/sec, 2905 secs
lola: 124012415 markings, 1084443547 edges, 38877 markings/sec, 2910 secs
lola: 124168087 markings, 1086115012 edges, 31134 markings/sec, 2915 secs
lola: 124344754 markings, 1087910689 edges, 35333 markings/sec, 2920 secs
lola: 124516109 markings, 1089653103 edges, 34271 markings/sec, 2925 secs
lola: 124696690 markings, 1091433224 edges, 36116 markings/sec, 2930 secs
lola: 124890315 markings, 1093255815 edges, 38725 markings/sec, 2935 secs
lola: 125090338 markings, 1095103014 edges, 40005 markings/sec, 2940 secs
lola: 125322541 markings, 1096916002 edges, 46441 markings/sec, 2945 secs
lola: 125628585 markings, 1098741804 edges, 61209 markings/sec, 2950 secs
lola: 125868045 markings, 1100444453 edges, 47892 markings/sec, 2955 secs
lola: 126074342 markings, 1102082895 edges, 41259 markings/sec, 2960 secs
lola: 126306032 markings, 1103817076 edges, 46338 markings/sec, 2965 secs
lola: 126544406 markings, 1105483706 edges, 47675 markings/sec, 2970 secs
lola: 126753998 markings, 1107081286 edges, 41918 markings/sec, 2975 secs
lola: 126954602 markings, 1108826838 edges, 40121 markings/sec, 2980 secs
lola: 127151031 markings, 1110548789 edges, 39286 markings/sec, 2985 secs
lola: 127306591 markings, 1111884579 edges, 31112 markings/sec, 2990 secs
lola: 127486233 markings, 1113364350 edges, 35928 markings/sec, 2995 secs
lola: 127705341 markings, 1115139601 edges, 43822 markings/sec, 3000 secs
lola: 127900756 markings, 1116633963 edges, 39083 markings/sec, 3005 secs
lola: 128139107 markings, 1118402403 edges, 47670 markings/sec, 3010 secs
lola: 128317454 markings, 1119861430 edges, 35669 markings/sec, 3015 secs
lola: 128490910 markings, 1121401621 edges, 34691 markings/sec, 3020 secs
lola: 128662344 markings, 1122933407 edges, 34287 markings/sec, 3025 secs
lola: 128821717 markings, 1124396002 edges, 31875 markings/sec, 3030 secs
lola: 128998754 markings, 1126180138 edges, 35407 markings/sec, 3035 secs
lola: 129179299 markings, 1127755680 edges, 36109 markings/sec, 3040 secs
lola: 129375284 markings, 1129591938 edges, 39197 markings/sec, 3045 secs
lola: 129536562 markings, 1131178993 edges, 32256 markings/sec, 3050 secs
lola: 129704311 markings, 1132625709 edges, 33550 markings/sec, 3055 secs
lola: 129884270 markings, 1134333982 edges, 35992 markings/sec, 3060 secs
lola: 130047488 markings, 1135883150 edges, 32644 markings/sec, 3065 secs
lola: 130228980 markings, 1137629478 edges, 36298 markings/sec, 3070 secs
lola: 130390219 markings, 1139337158 edges, 32248 markings/sec, 3075 secs
lola: 130548462 markings, 1141015391 edges, 31649 markings/sec, 3080 secs
lola: 130632143 markings, 1141903243 edges, 16736 markings/sec, 3085 secs
lola: 130632175 markings, 1141903445 edges, 6 markings/sec, 3090 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes unknown no no yes no no
lola:
preliminary result: no no no no no no yes unknown no no yes no no
lola: memory consumption: 3576 KB
lola: time consumption: 3255 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
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-50a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is DES-PT-50a, 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 r075-tall-162039097100066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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