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

About the Execution of 2020-gold for DoubleExponent-PT-004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.659 3600000.00 3029780.00 73134.60 FFF?FFFTFTFFFF?? 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.r094-tall-162048902500210.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 DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 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 67K 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 DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15

=== Now, execution of the tool begins

BK_START 1620745961166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:12:42] [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-11 15:12:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:12:42] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-11 15:12:42] [INFO ] Transformed 216 places.
[2021-05-11 15:12:42] [INFO ] Transformed 198 transitions.
[2021-05-11 15:12:42] [INFO ] Parsed PT model containing 216 places and 198 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3294 resets, run finished after 373 ms. (steps per millisecond=268 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1]
// Phase 1: matrix 198 rows 216 cols
[2021-05-11 15:12:43] [INFO ] Computed 24 place invariants in 23 ms
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-11 15:12:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2021-05-11 15:12:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-11 15:12:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2021-05-11 15:12:44] [INFO ] Added : 195 causal constraints over 39 iterations in 698 ms. Result :sat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-11 15:12:44] [INFO ] Deduced a trap composed of 86 places in 91 ms
[2021-05-11 15:12:44] [INFO ] Deduced a trap composed of 89 places in 75 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 86 places in 62 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 79 places in 62 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 59 places in 44 ms
[2021-05-11 15:12:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 394 ms
[2021-05-11 15:12:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2021-05-11 15:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 86 places in 68 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 89 places in 78 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 31 places in 83 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 90 places in 76 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 79 places in 71 ms
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 59 places in 40 ms
[2021-05-11 15:12:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 651 ms
[2021-05-11 15:12:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2021-05-11 15:12:46] [INFO ] Added : 156 causal constraints over 32 iterations in 620 ms. Result :sat
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 72 places in 67 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 82 places in 56 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 88 places in 61 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 63 places in 51 ms
[2021-05-11 15:12:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2021-05-11 15:12:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 72 places in 62 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 41 places in 59 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 63 places in 52 ms
[2021-05-11 15:12:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2021-05-11 15:12:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2021-05-11 15:12:48] [INFO ] Added : 187 causal constraints over 38 iterations in 668 ms. Result :sat
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 71 places in 59 ms
[2021-05-11 15:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-11 15:12:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:48] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 86 places in 73 ms
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 79 places in 72 ms
[2021-05-11 15:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2021-05-11 15:12:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:48] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 86 places in 64 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 41 places in 65 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 73 places in 63 ms
[2021-05-11 15:12:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2021-05-11 15:12:49] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:12:49] [INFO ] Added : 195 causal constraints over 39 iterations in 599 ms. Result :sat
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 73 places in 70 ms
[2021-05-11 15:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2021-05-11 15:12:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:50] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 73 places in 62 ms
[2021-05-11 15:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-11 15:12:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:50] [INFO ] Added : 191 causal constraints over 39 iterations in 563 ms. Result :sat
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 48 places in 35 ms
[2021-05-11 15:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-11 15:12:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:51] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2021-05-11 15:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-11 15:12:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:51] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:51] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 16 places in 57 ms
[2021-05-11 15:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-11 15:12:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:51] [INFO ] Added : 187 causal constraints over 38 iterations in 536 ms. Result :sat
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 96 places in 60 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 58 places in 60 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 90 places in 62 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 111 places in 60 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 95 places in 64 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 54 places in 60 ms
[2021-05-11 15:12:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 522 ms
[2021-05-11 15:12:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:52] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:12:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2021-05-11 15:12:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-11 15:12:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 20 ms.
[2021-05-11 15:12:53] [INFO ] Added : 193 causal constraints over 39 iterations in 616 ms. Result :sat
[2021-05-11 15:12:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:53] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 57 places in 56 ms
[2021-05-11 15:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-11 15:12:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:53] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:54] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 57 places in 57 ms
[2021-05-11 15:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2021-05-11 15:12:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2021-05-11 15:12:54] [INFO ] Added : 193 causal constraints over 40 iterations in 661 ms. Result :sat
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 77 places in 60 ms
[2021-05-11 15:12:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:55] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:12:55] [INFO ] Deduced a trap composed of 16 places in 80 ms
[2021-05-11 15:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2021-05-11 15:12:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:55] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:55] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-11 15:12:55] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2021-05-11 15:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-11 15:12:55] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:12:56] [INFO ] Added : 191 causal constraints over 39 iterations in 576 ms. Result :sat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-11 15:12:56] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2021-05-11 15:12:56] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2021-05-11 15:12:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2021-05-11 15:12:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-11 15:12:56] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-11 15:12:56] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2021-05-11 15:12:56] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2021-05-11 15:12:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2021-05-11 15:12:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2021-05-11 15:12:57] [INFO ] Added : 194 causal constraints over 39 iterations in 699 ms. Result :sat
[2021-05-11 15:12:57] [INFO ] Deduced a trap composed of 88 places in 94 ms
[2021-05-11 15:12:57] [INFO ] Deduced a trap composed of 81 places in 80 ms
[2021-05-11 15:12:57] [INFO ] Deduced a trap composed of 88 places in 63 ms
[2021-05-11 15:12:57] [INFO ] Deduced a trap composed of 86 places in 65 ms
[2021-05-11 15:12:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 61 places in 63 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 83 places in 73 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 61 places in 70 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 82 places in 68 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 87 places in 61 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2021-05-11 15:12:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 450 ms
[2021-05-11 15:12:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 61 places in 60 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 41 places in 62 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 86 places in 66 ms
[2021-05-11 15:12:58] [INFO ] Deduced a trap composed of 77 places in 62 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 86 places in 65 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 95 places in 65 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 63 places in 57 ms
[2021-05-11 15:12:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 500 ms
[2021-05-11 15:12:59] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:12:59] [INFO ] Added : 185 causal constraints over 38 iterations in 667 ms. Result :sat
[2021-05-11 15:12:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:59] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:00] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 70 places in 52 ms
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 43 places in 54 ms
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2021-05-11 15:13:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2021-05-11 15:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 70 places in 52 ms
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 43 places in 51 ms
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 61 places in 52 ms
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2021-05-11 15:13:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 233 ms
[2021-05-11 15:13:00] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:01] [INFO ] Added : 183 causal constraints over 37 iterations in 592 ms. Result :sat
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 41 places in 24 ms
[2021-05-11 15:13:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-11 15:13:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 41 places in 25 ms
[2021-05-11 15:13:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-11 15:13:01] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:02] [INFO ] Added : 194 causal constraints over 40 iterations in 638 ms. Result :sat
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 59 places in 39 ms
[2021-05-11 15:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-11 15:13:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:02] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 59 places in 33 ms
[2021-05-11 15:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-11 15:13:02] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:03] [INFO ] Added : 193 causal constraints over 39 iterations in 614 ms. Result :sat
[2021-05-11 15:13:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:03] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 77 places in 62 ms
[2021-05-11 15:13:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-11 15:13:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:03] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 77 places in 60 ms
[2021-05-11 15:13:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-11 15:13:03] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:04] [INFO ] Added : 193 causal constraints over 40 iterations in 623 ms. Result :sat
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 58 places in 84 ms
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 43 places in 36 ms
[2021-05-11 15:13:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 49 places in 36 ms
[2021-05-11 15:13:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-11 15:13:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-11 15:13:05] [INFO ] Deduced a trap composed of 49 places in 33 ms
[2021-05-11 15:13:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-11 15:13:05] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:05] [INFO ] Added : 189 causal constraints over 38 iterations in 563 ms. Result :sat
[2021-05-11 15:13:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:06] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 67 places in 48 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 67 places in 48 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 66 places in 41 ms
[2021-05-11 15:13:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2021-05-11 15:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 41 places in 53 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 65 places in 51 ms
[2021-05-11 15:13:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2021-05-11 15:13:06] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:06] [INFO ] Added : 102 causal constraints over 21 iterations in 310 ms. Result :sat
[2021-05-11 15:13:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 61 places in 62 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 83 places in 63 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 82 places in 61 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 61 places in 63 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 89 places in 59 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 63 places in 71 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 82 places in 71 ms
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2021-05-11 15:13:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 601 ms
[2021-05-11 15:13:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:13:07] [INFO ] Deduced a trap composed of 61 places in 63 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 41 places in 61 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 86 places in 63 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 77 places in 75 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 78 places in 66 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 82 places in 71 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 81 places in 70 ms
[2021-05-11 15:13:08] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2021-05-11 15:13:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 698 ms
[2021-05-11 15:13:08] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:09] [INFO ] Added : 194 causal constraints over 39 iterations in 751 ms. Result :sat
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-11 15:13:09] [INFO ] Deduced a trap composed of 65 places in 63 ms
[2021-05-11 15:13:09] [INFO ] Deduced a trap composed of 90 places in 65 ms
[2021-05-11 15:13:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2021-05-11 15:13:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-11 15:13:09] [INFO ] Deduced a trap composed of 65 places in 73 ms
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 87 places in 62 ms
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 87 places in 64 ms
[2021-05-11 15:13:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2021-05-11 15:13:10] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:10] [INFO ] Added : 194 causal constraints over 41 iterations in 640 ms. Result :sat
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-11 15:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-11 15:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:11] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:11] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:13:11] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-11 15:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-11 15:13:11] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:11] [INFO ] Added : 158 causal constraints over 32 iterations in 538 ms. Result :sat
[2021-05-11 15:13:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:11] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:11] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:13:12] [INFO ] Deduced a trap composed of 85 places in 70 ms
[2021-05-11 15:13:12] [INFO ] Deduced a trap composed of 74 places in 69 ms
[2021-05-11 15:13:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-11 15:13:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:13:12] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:12] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-11 15:13:12] [INFO ] Deduced a trap composed of 85 places in 59 ms
[2021-05-11 15:13:12] [INFO ] Deduced a trap composed of 74 places in 64 ms
[2021-05-11 15:13:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2021-05-11 15:13:12] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:13] [INFO ] Added : 185 causal constraints over 37 iterations in 634 ms. Result :sat
[2021-05-11 15:13:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:13] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:13] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 68 places in 51 ms
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 55 places in 50 ms
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 77 places in 51 ms
[2021-05-11 15:13:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2021-05-11 15:13:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:13:13] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:13] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 68 places in 45 ms
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2021-05-11 15:13:13] [INFO ] Deduced a trap composed of 59 places in 36 ms
[2021-05-11 15:13:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2021-05-11 15:13:13] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2021-05-11 15:13:14] [INFO ] Added : 194 causal constraints over 39 iterations in 638 ms. Result :sat
[2021-05-11 15:13:14] [INFO ] Deduced a trap composed of 25 places in 57 ms
[2021-05-11 15:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-11 15:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-11 15:13:14] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:14] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:14] [INFO ] Deduced a trap composed of 70 places in 71 ms
[2021-05-11 15:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-11 15:13:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:13:14] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:15] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:15] [INFO ] Deduced a trap composed of 70 places in 60 ms
[2021-05-11 15:13:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-11 15:13:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:15] [INFO ] Added : 192 causal constraints over 39 iterations in 605 ms. Result :sat
[2021-05-11 15:13:15] [INFO ] Deduced a trap composed of 88 places in 68 ms
[2021-05-11 15:13:15] [INFO ] Deduced a trap composed of 70 places in 69 ms
[2021-05-11 15:13:15] [INFO ] Deduced a trap composed of 71 places in 67 ms
[2021-05-11 15:13:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2021-05-11 15:13:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:16] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:16] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:16] [INFO ] Deduced a trap composed of 70 places in 60 ms
[2021-05-11 15:13:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-11 15:13:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:16] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:16] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-11 15:13:16] [INFO ] Deduced a trap composed of 70 places in 60 ms
[2021-05-11 15:13:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-11 15:13:16] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:17] [INFO ] Added : 192 causal constraints over 39 iterations in 610 ms. Result :sat
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 88 places in 60 ms
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 70 places in 60 ms
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 71 places in 57 ms
[2021-05-11 15:13:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2021-05-11 15:13:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:17] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:17] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 81 places in 73 ms
[2021-05-11 15:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-11 15:13:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:17] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-11 15:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:17] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 81 places in 60 ms
[2021-05-11 15:13:17] [INFO ] Deduced a trap composed of 63 places in 54 ms
[2021-05-11 15:13:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2021-05-11 15:13:17] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:18] [INFO ] Added : 105 causal constraints over 21 iterations in 314 ms. Result :sat
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 2 ms returned unsat
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:18] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-11 15:13:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:18] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:18] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:13:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:19] [INFO ] Added : 108 causal constraints over 22 iterations in 370 ms. Result :sat
[2021-05-11 15:13:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:19] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:19] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:13:19] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:19] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:19] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:13:19] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:20] [INFO ] Added : 193 causal constraints over 39 iterations in 650 ms. Result :sat
[2021-05-11 15:13:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-11 15:13:20] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-11 15:13:20] [INFO ] Deduced a trap composed of 41 places in 34 ms
[2021-05-11 15:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-11 15:13:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:20] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:20] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-11 15:13:20] [INFO ] Deduced a trap composed of 41 places in 40 ms
[2021-05-11 15:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-11 15:13:20] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:21] [INFO ] Added : 161 causal constraints over 33 iterations in 488 ms. Result :sat
[2021-05-11 15:13:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:21] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:21] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:13:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:21] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:21] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-11 15:13:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:13:22] [INFO ] Added : 184 causal constraints over 37 iterations in 569 ms. Result :sat
[2021-05-11 15:13:22] [INFO ] Deduced a trap composed of 35 places in 37 ms
[2021-05-11 15:13:22] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2021-05-11 15:13:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-11 15:13:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:22] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:22] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-11 15:13:22] [INFO ] Deduced a trap composed of 88 places in 76 ms
[2021-05-11 15:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2021-05-11 15:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:22] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:22] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-11 15:13:22] [INFO ] Deduced a trap composed of 88 places in 86 ms
[2021-05-11 15:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-11 15:13:22] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:13:23] [INFO ] Added : 190 causal constraints over 38 iterations in 590 ms. Result :sat
[2021-05-11 15:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:23] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:23] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:13:23] [INFO ] Deduced a trap composed of 78 places in 72 ms
[2021-05-11 15:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-11 15:13:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:23] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:24] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:13:24] [INFO ] Deduced a trap composed of 78 places in 72 ms
[2021-05-11 15:13:24] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2021-05-11 15:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2021-05-11 15:13:24] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:24] [INFO ] Added : 192 causal constraints over 39 iterations in 621 ms. Result :sat
[2021-05-11 15:13:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:25] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:25] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:25] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:25] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:25] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:25] [INFO ] Added : 194 causal constraints over 39 iterations in 558 ms. Result :sat
[2021-05-11 15:13:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:26] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-11 15:13:26] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:13:26] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:26] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-11 15:13:26] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:26] [INFO ] Added : 156 causal constraints over 32 iterations in 558 ms. Result :sat
[2021-05-11 15:13:26] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2021-05-11 15:13:26] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2021-05-11 15:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-11 15:13:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-11 15:13:27] [INFO ] Flatten gal took : 66 ms
FORMULA DoubleExponent-PT-004-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 15:13:27] [INFO ] Flatten gal took : 16 ms
[2021-05-11 15:13:27] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-11 15:13:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-004 @ 3570 seconds

FORMULA DoubleExponent-PT-004-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 514
rslt: Output for LTLFireability @ DoubleExponent-PT-004

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 11 15:13:28 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 2,
"aconj": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "(X (G ((1 <= p113))) U (X (G ((1 <= p113))) OR ((1 <= p145) U (1 <= p90))))",
"processed_size": 75,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 0,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X ((X ((X (F ((p136 <= 0))) AND F (G ((1 <= p136))))) U G (((1 <= p10) AND (1 <= p116))))))",
"processed_size": 94,
"rewrites": 71
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 360
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p83)))",
"processed_size": 18,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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": "F ((X (((1 <= p54) AND (1 <= p68))) OR ((1 <= p185) AND (1 <= p204))))",
"processed_size": 70,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((X (G (((p64 <= 0) OR (p199 <= 0)))) OR (p31 <= 0)) U (1 <= p193)) AND (1 <= p31)))",
"processed_size": 89,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((p23 <= 0) OR (p162 <= 0)) R (G (((1 <= p73) AND (1 <= p94))) AND (p18 <= 0))))",
"processed_size": 85,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p95)))",
"processed_size": 18,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (((X (X (((1 <= p131) AND (1 <= p140)))) OR ((1 <= p131) AND (1 <= p140))) AND ((1 <= p169) AND (1 <= p209)))) AND X (G (((1 <= p84) AND (1 <= p93))))))",
"processed_size": 158,
"rewrites": 71
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 1081
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((((1 <= p117) U ((1 <= p64) AND (1 <= p191))) AND (((p8 <= 0) OR (p153 <= 0)) R ((p60 <= 0) R ((p145 <= 0) AND (p117 <= 0))))))",
"processed_size": 131,
"rewrites": 71
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p56)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3444,
"runtime": 3056.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(((** U **) AND (* R (* R *)))) : (X(G(**)) U (X(G(**)) OR (** U **))) : G(F((X(G(**)) OR **))) : X(X((X((X(F(*)) AND F(G(**)))) U G(**)))) : X(F(**)) : F((X(**) OR **)) : X((((X(G(*)) OR **) U **) AND **)) : X((* R (G(**) AND *))) : X(G(**)) : X((F(((X(X(**)) OR **) AND (** AND **))) AND X(G(*)))) : (F((G(*) OR ((G(*) AND X(*)) OR G(**)))) OR **) : F(G((G(F(*)) AND *)))"
},
"net":
{
"arcs": 558,
"conflict_clusters": 143,
"places": 216,
"places_significant": 192,
"singleton_clusters": 0,
"transitions": 198
},
"result":
{
"preliminary_value": "no no unknown no no no no no no no unknown unknown ",
"value": "no no unknown no no no no no no no unknown unknown "
},
"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: 414/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 198 transitions, 192 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: F ((((1 <= p117) U ((1 <= p64) AND (1 <= p191))) AND NOT((((1 <= p8) AND (1 <= p153)) U ((1 <= p60) U ((1 <= p145) OR (1 <= p117))))))) : (X (G ((1 <= p113))) U (G (X (G ((1 <= p113)))) OR ((1 <= p145) U (1 <= p90)))) : G (F ((X (G (((1 <= p1) AND (1 <= p215)))) OR (p201 <= 0)))) : X (X ((X ((NOT(G (X (G ((1 <= p136))))) AND F (G ((1 <= p136))))) U G (((1 <= p10) AND (1 <= p116)))))) : (X (X (X (NOT(G (((1 <= p113) U X (((1 <= p66) AND (1 <= p212))))))))) U F (X ((1 <= p83)))) : F ((X (((1 <= p54) AND (1 <= p68))) OR ((1 <= p185) AND (1 <= p204)))) : X ((((NOT(X (F (((1 <= p193) U ((1 <= p64) AND (1 <= p199)))))) OR (p31 <= 0)) U (1 <= p193)) AND (1 <= p31))) : X (NOT((((1 <= p23) AND (1 <= p162)) U (NOT(G (((1 <= p73) AND (1 <= p94)))) OR (1 <= p18))))) : X (G ((1 <= p95))) : X ((F ((((X (X (((1 <= p131) AND (1 <= p140)))) OR ((1 <= p131) AND (1 <= p140))) AND (1 <= p169)) AND (1 <= p209))) AND X (NOT(F (((p84 <= 0) OR (p93 <= 0))))))) : ((NOT(G ((F (((1 <= p114) AND (1 <= p127))) U X ((1 <= p158))))) OR F (G (((1 <= p114) AND (1 <= p127))))) OR (1 <= p56)) : F (X (G (F (X (NOT(F ((X (F (G (((1 <= p11) AND (1 <= p19))))) OR ((1 <= p45) AND (1 <= p194))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p113))) U (X (G ((1 <= p113))) OR ((1 <= p145) U (1 <= p90))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((1 <= p113))) U (X (G ((1 <= p113))) OR ((1 <= p145) U (1 <= p90))))
lola: processed formula length: 75
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G (((1 <= p1) AND (1 <= p215)))) OR (p201 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G (((1 <= p1) AND (1 <= p215)))) OR (p201 <= 0))))
lola: processed formula length: 60
lola: 71 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: 1873429 markings, 2072126 edges, 374686 markings/sec, 0 secs
lola: 3730012 markings, 4125342 edges, 371317 markings/sec, 5 secs
lola: 5543309 markings, 6131196 edges, 362659 markings/sec, 10 secs
lola: 7345019 markings, 8124287 edges, 360342 markings/sec, 15 secs
lola: 9136088 markings, 10105599 edges, 358214 markings/sec, 20 secs
lola: 10923698 markings, 12083180 edges, 357522 markings/sec, 25 secs
lola: 12705559 markings, 14054397 edges, 356372 markings/sec, 30 secs
lola: 14485537 markings, 16023535 edges, 355996 markings/sec, 35 secs
lola: 16260849 markings, 17987488 edges, 355062 markings/sec, 40 secs
lola: 18038491 markings, 19954019 edges, 355528 markings/sec, 45 secs
lola: 19814134 markings, 21918338 edges, 355129 markings/sec, 50 secs
lola: 21576207 markings, 23867659 edges, 352415 markings/sec, 55 secs
lola: 23341697 markings, 25820826 edges, 353098 markings/sec, 60 secs
lola: 25110460 markings, 27777529 edges, 353753 markings/sec, 65 secs
lola: 26866514 markings, 29720165 edges, 351211 markings/sec, 70 secs
lola: 28660410 markings, 31704749 edges, 358779 markings/sec, 75 secs
lola: 30451272 markings, 33685899 edges, 358172 markings/sec, 80 secs
lola: 32207837 markings, 35629185 edges, 351313 markings/sec, 85 secs
lola: 33983548 markings, 37593588 edges, 355142 markings/sec, 90 secs
lola: 35738174 markings, 39534716 edges, 350925 markings/sec, 95 secs
lola: 37506904 markings, 41491425 edges, 353746 markings/sec, 100 secs
lola: 39245282 markings, 43414586 edges, 347676 markings/sec, 105 secs
lola: 41014388 markings, 45371703 edges, 353821 markings/sec, 110 secs
lola: 42764810 markings, 47308182 edges, 350084 markings/sec, 115 secs
lola: 44522788 markings, 49252997 edges, 351596 markings/sec, 120 secs
lola: 46270079 markings, 51186036 edges, 349458 markings/sec, 125 secs
lola: 48006569 markings, 53107094 edges, 347298 markings/sec, 130 secs
lola: 49767602 markings, 55055337 edges, 352207 markings/sec, 135 secs
lola: 51511034 markings, 56984044 edges, 348686 markings/sec, 140 secs
lola: 53250791 markings, 58908829 edges, 347951 markings/sec, 145 secs
lola: 55002725 markings, 60846929 edges, 350387 markings/sec, 150 secs
lola: 56730737 markings, 62758582 edges, 345602 markings/sec, 155 secs
lola: 58466541 markings, 64678924 edges, 347161 markings/sec, 160 secs
lola: 60229283 markings, 66629062 edges, 352548 markings/sec, 165 secs
lola: 61978207 markings, 68563913 edges, 349785 markings/sec, 170 secs
lola: 63733163 markings, 70505370 edges, 350991 markings/sec, 175 secs
lola: 65482222 markings, 72440384 edges, 349812 markings/sec, 180 secs
lola: 67216968 markings, 74359548 edges, 346949 markings/sec, 185 secs
lola: 68947428 markings, 76273959 edges, 346092 markings/sec, 190 secs
lola: 70708626 markings, 78222349 edges, 352240 markings/sec, 195 secs
lola: 72450619 markings, 80149510 edges, 348399 markings/sec, 200 secs
lola: 74178281 markings, 82060891 edges, 345532 markings/sec, 205 secs
lola: 75924923 markings, 83993145 edges, 349328 markings/sec, 210 secs
lola: 77655895 markings, 85908071 edges, 346194 markings/sec, 215 secs
lola: 79375773 markings, 87810866 edges, 343976 markings/sec, 220 secs
lola: 81112392 markings, 89732023 edges, 347324 markings/sec, 225 secs
lola: 82871699 markings, 91678351 edges, 351861 markings/sec, 230 secs
lola: 84616238 markings, 93608355 edges, 348908 markings/sec, 235 secs
lola: 86342180 markings, 95517824 edges, 345188 markings/sec, 240 secs
lola: 88097528 markings, 97459696 edges, 351070 markings/sec, 245 secs
lola: 89833181 markings, 99379852 edges, 347131 markings/sec, 250 secs
lola: 91564098 markings, 101294786 edges, 346183 markings/sec, 255 secs
lola: 93281603 markings, 103194894 edges, 343501 markings/sec, 260 secs
lola: 95036204 markings, 105135975 edges, 350920 markings/sec, 265 secs
lola: 96775939 markings, 107060619 edges, 347947 markings/sec, 270 secs
lola: 98511400 markings, 108980592 edges, 347092 markings/sec, 275 secs
lola: 100232298 markings, 110884453 edges, 344180 markings/sec, 280 secs
lola: 101981204 markings, 112819228 edges, 349781 markings/sec, 285 secs
lola: 103708443 markings, 114730067 edges, 345448 markings/sec, 290 secs
lola: 105427852 markings, 116632302 edges, 343882 markings/sec, 295 secs
lola: 107133500 markings, 118519256 edges, 341130 markings/sec, 300 secs
lola: 108870984 markings, 120441394 edges, 347497 markings/sec, 305 secs
lola: 110639940 markings, 122398417 edges, 353791 markings/sec, 310 secs
lola: 112401754 markings, 124347545 edges, 352363 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X ((X (F ((p136 <= 0))) AND F (G ((1 <= p136))))) U G (((1 <= p10) AND (1 <= p116))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X ((X (F ((p136 <= 0))) AND F (G ((1 <= p136))))) U G (((1 <= p10) AND (1 <= p116))))))
lola: processed formula length: 94
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p83)))
lola: processed formula length: 18
lola: 71 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p54) AND (1 <= p68))) OR ((1 <= p185) AND (1 <= p204))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p54) AND (1 <= p68))) OR ((1 <= p185) AND (1 <= p204))))
lola: processed formula length: 70
lola: 71 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((X (G (((p64 <= 0) OR (p199 <= 0)))) OR (p31 <= 0)) U (1 <= p193)) AND (1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((X (G (((p64 <= 0) OR (p199 <= 0)))) OR (p31 <= 0)) U (1 <= p193)) AND (1 <= p31)))
lola: processed formula length: 89
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p23 <= 0) OR (p162 <= 0)) R (G (((1 <= p73) AND (1 <= p94))) AND (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p23 <= 0) OR (p162 <= 0)) R (G (((1 <= p73) AND (1 <= p94))) AND (p18 <= 0))))
lola: processed formula length: 85
lola: 71 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p95)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p95)))
lola: processed formula length: 18
lola: 71 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((X (X (((1 <= p131) AND (1 <= p140)))) OR ((1 <= p131) AND (1 <= p140))) AND ((1 <= p169) AND (1 <= p209)))) AND X (G (((1 <= p84) AND (1 <= p93))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((X (X (((1 <= p131) AND (1 <= p140)))) OR ((1 <= p131) AND (1 <= p140))) AND ((1 <= p169) AND (1 <= p209)))) AND X (G (((1 <= p84) AND (1 <= p93))))))
lola: processed formula length: 158
lola: 71 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: 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127)))))) OR (1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p56)
lola: processed formula length: 10
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 10 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127))))))
lola: processed formula length: 119
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 1860475 markings, 2058231 edges, 372095 markings/sec, 0 secs
lola: 3703249 markings, 4096568 edges, 368555 markings/sec, 5 secs
lola: 5500725 markings, 6085296 edges, 359495 markings/sec, 10 secs
lola: 7288234 markings, 8063078 edges, 357502 markings/sec, 15 secs
lola: 9065283 markings, 10029298 edges, 355410 markings/sec, 20 secs
lola: 10837840 markings, 11990626 edges, 354511 markings/sec, 25 secs
lola: 12605247 markings, 13946249 edges, 353481 markings/sec, 30 secs
lola: 14372647 markings, 15901872 edges, 353480 markings/sec, 35 secs
lola: 16131267 markings, 17847767 edges, 351724 markings/sec, 40 secs
lola: 17888495 markings, 19792094 edges, 351446 markings/sec, 45 secs
lola: 19643554 markings, 21734025 edges, 351012 markings/sec, 50 secs
lola: 21385269 markings, 23661296 edges, 348343 markings/sec, 55 secs
lola: 23141020 markings, 25604028 edges, 351150 markings/sec, 60 secs
lola: 24893859 markings, 27543494 edges, 350568 markings/sec, 65 secs
lola: 26626133 markings, 29460267 edges, 346455 markings/sec, 70 secs
lola: 28410748 markings, 31434930 edges, 356923 markings/sec, 75 secs
lola: 30186181 markings, 33399426 edges, 355087 markings/sec, 80 secs
lola: 31933346 markings, 35332707 edges, 349433 markings/sec, 85 secs
lola: 33701116 markings, 37288737 edges, 353554 markings/sec, 90 secs
lola: 35451794 markings, 39225912 edges, 350136 markings/sec, 95 secs
lola: 37219047 markings, 41181368 edges, 353451 markings/sec, 100 secs
lola: 38957233 markings, 43104712 edges, 347637 markings/sec, 105 secs
lola: 40716423 markings, 45051251 edges, 351838 markings/sec, 110 secs
lola: 42464588 markings, 46985645 edges, 349633 markings/sec, 115 secs
lola: 44211349 markings, 48918501 edges, 349352 markings/sec, 120 secs
lola: 45961499 markings, 50855063 edges, 350030 markings/sec, 125 secs
lola: 47689226 markings, 52766843 edges, 345545 markings/sec, 130 secs
lola: 49446796 markings, 54711604 edges, 351514 markings/sec, 135 secs
lola: 51179624 markings, 56628985 edges, 346566 markings/sec, 140 secs
lola: 52916468 markings, 58550940 edges, 347369 markings/sec, 145 secs
lola: 54662051 markings, 60482421 edges, 349117 markings/sec, 150 secs
lola: 56388484 markings, 62392756 edges, 345287 markings/sec, 155 secs
lola: 58108417 markings, 64295937 edges, 343987 markings/sec, 160 secs
lola: 59879186 markings, 66255301 edges, 354154 markings/sec, 165 secs
lola: 61627541 markings, 68189920 edges, 349671 markings/sec, 170 secs
lola: 63372286 markings, 70120528 edges, 348949 markings/sec, 175 secs
lola: 65116879 markings, 72050963 edges, 348919 markings/sec, 180 secs
lola: 66844164 markings, 73962258 edges, 345457 markings/sec, 185 secs
lola: 68560157 markings, 75861118 edges, 343199 markings/sec, 190 secs
lola: 70320571 markings, 77809000 edges, 352083 markings/sec, 195 secs
lola: 72062334 markings, 79736305 edges, 348353 markings/sec, 200 secs
lola: 73790569 markings, 81648670 edges, 345647 markings/sec, 205 secs
lola: 75540522 markings, 83585005 edges, 349991 markings/sec, 210 secs
lola: 77273117 markings, 85502163 edges, 346519 markings/sec, 215 secs
lola: 78992457 markings, 87404734 edges, 343868 markings/sec, 220 secs
lola: 80717898 markings, 89313954 edges, 345088 markings/sec, 225 secs
lola: 82476319 markings, 91259677 edges, 351684 markings/sec, 230 secs
lola: 84219996 markings, 93189118 edges, 348735 markings/sec, 235 secs
lola: 85944556 markings, 95097447 edges, 344912 markings/sec, 240 secs
lola: 87696037 markings, 97035433 edges, 350296 markings/sec, 245 secs
lola: 89428935 markings, 98952940 edges, 346580 markings/sec, 250 secs
lola: 91156094 markings, 100864133 edges, 345432 markings/sec, 255 secs
lola: 92865326 markings, 102755482 edges, 341846 markings/sec, 260 secs
lola: 94611706 markings, 104687830 edges, 349276 markings/sec, 265 secs
lola: 96347118 markings, 106608112 edges, 347082 markings/sec, 270 secs
lola: 98075490 markings, 108520628 edges, 345674 markings/sec, 275 secs
lola: 99784354 markings, 110411563 edges, 341773 markings/sec, 280 secs
lola: 101527059 markings, 112339875 edges, 348541 markings/sec, 285 secs
lola: 103252342 markings, 114248956 edges, 345057 markings/sec, 290 secs
lola: 104970041 markings, 116149665 edges, 343540 markings/sec, 295 secs
lola: 106675004 markings, 118036305 edges, 340993 markings/sec, 300 secs
lola: 108392952 markings, 119937221 edges, 343590 markings/sec, 305 secs
lola: 110162976 markings, 121895796 edges, 354005 markings/sec, 310 secs
lola: 111920941 markings, 123841014 edges, 351593 markings/sec, 315 secs
lola: 113657754 markings, 125762883 edges, 347363 markings/sec, 320 secs
lola: 115385389 markings, 127674618 edges, 345527 markings/sec, 325 secs
lola: 117139542 markings, 129615591 edges, 350831 markings/sec, 330 secs
lola: 118592742 markings, 131223919 edges, 290640 markings/sec, 335 secs
lola: 120078286 markings, 132867708 edges, 297109 markings/sec, 340 secs
lola: 121745745 markings, 134712521 edges, 333492 markings/sec, 345 secs
lola: 123163255 markings, 136281075 edges, 283502 markings/sec, 350 secs
lola: 124836782 markings, 138132828 edges, 334705 markings/sec, 355 secs
lola: 126348144 markings, 139805210 edges, 302272 markings/sec, 360 secs
lola: 127990952 markings, 141623006 edges, 328562 markings/sec, 365 secs
lola: 129339074 markings, 143114779 edges, 269624 markings/sec, 370 secs
lola: 130782200 markings, 144711700 edges, 288625 markings/sec, 375 secs
lola: 132387722 markings, 146488203 edges, 321104 markings/sec, 380 secs
lola: 134045786 markings, 148322931 edges, 331613 markings/sec, 385 secs
lola: 135455190 markings, 149882447 edges, 281881 markings/sec, 390 secs
lola: 136895869 markings, 151476610 edges, 288136 markings/sec, 395 secs
lola: 138446137 markings, 153192108 edges, 310054 markings/sec, 400 secs
lola: 139741093 markings, 154625029 edges, 258991 markings/sec, 405 secs
lola: 141363106 markings, 156419804 edges, 324403 markings/sec, 410 secs
lola: 142797324 markings, 158006813 edges, 286844 markings/sec, 415 secs
lola: 144257775 markings, 159622849 edges, 292090 markings/sec, 420 secs
lola: 145616814 markings, 161126654 edges, 271808 markings/sec, 425 secs
lola: 146095959 markings, 161656903 edges, 95829 markings/sec, 430 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: subprocess 10 will run for 1399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((p11 <= 0) OR (p19 <= 0)))) AND ((p45 <= 0) OR (p194 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((p11 <= 0) OR (p19 <= 0)))) AND ((p45 <= 0) OR (p194 <= 0)))))
lola: processed formula length: 78
lola: 71 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: 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: 1132908 markings, 1877662 edges, 226582 markings/sec, 0 secs
lola: 2264382 markings, 3753408 edges, 226295 markings/sec, 5 secs
lola: 3396352 markings, 5630098 edges, 226394 markings/sec, 10 secs
lola: 4533698 markings, 7512509 edges, 227469 markings/sec, 15 secs
lola: 5658036 markings, 9376498 edges, 224868 markings/sec, 20 secs
lola: 6772404 markings, 11223957 edges, 222874 markings/sec, 25 secs
lola: 7887723 markings, 13073033 edges, 223064 markings/sec, 30 secs
lola: 9015583 markings, 14939789 edges, 225572 markings/sec, 35 secs
lola: 10127578 markings, 16783325 edges, 222399 markings/sec, 40 secs
lola: 11228627 markings, 18608773 edges, 220210 markings/sec, 45 secs
lola: 12333376 markings, 20440207 edges, 220950 markings/sec, 50 secs
lola: 13448494 markings, 22285894 edges, 223024 markings/sec, 55 secs
lola: 14553205 markings, 24117317 edges, 220942 markings/sec, 60 secs
lola: 15646561 markings, 25929870 edges, 218671 markings/sec, 65 secs
lola: 16742941 markings, 27747602 edges, 219276 markings/sec, 70 secs
lola: 17851693 markings, 29582597 edges, 221750 markings/sec, 75 secs
lola: 18955672 markings, 31412880 edges, 220796 markings/sec, 80 secs
lola: 20048441 markings, 33224827 edges, 218554 markings/sec, 85 secs
lola: 21137404 markings, 35030351 edges, 217793 markings/sec, 90 secs
lola: 22240987 markings, 36859940 edges, 220717 markings/sec, 95 secs
lola: 23341173 markings, 38680531 edges, 220037 markings/sec, 100 secs
lola: 24427040 markings, 40480611 edges, 217173 markings/sec, 105 secs
lola: 25513146 markings, 42281369 edges, 217221 markings/sec, 110 secs
lola: 26606045 markings, 44093298 edges, 218580 markings/sec, 115 secs
lola: 27707700 markings, 45916552 edges, 220331 markings/sec, 120 secs
lola: 28792721 markings, 47715352 edges, 217004 markings/sec, 125 secs
lola: 29877402 markings, 49513538 edges, 216936 markings/sec, 130 secs
lola: 30968027 markings, 51321643 edges, 218125 markings/sec, 135 secs
lola: 32066168 markings, 53138997 edges, 219628 markings/sec, 140 secs
lola: 33145601 markings, 54928796 edges, 215887 markings/sec, 145 secs
lola: 34223621 markings, 56716250 edges, 215604 markings/sec, 150 secs
lola: 35306939 markings, 58512073 edges, 216664 markings/sec, 155 secs
lola: 36409641 markings, 60336940 edges, 220540 markings/sec, 160 secs
lola: 37495989 markings, 62138121 edges, 217270 markings/sec, 165 secs
lola: 38579177 markings, 63933850 edges, 216638 markings/sec, 170 secs
lola: 39668862 markings, 65740274 edges, 217937 markings/sec, 175 secs
lola: 40768398 markings, 67559972 edges, 219907 markings/sec, 180 secs
lola: 41845341 markings, 69345491 edges, 215389 markings/sec, 185 secs
lola: 42914510 markings, 71117961 edges, 213834 markings/sec, 190 secs
lola: 43993190 markings, 72906517 edges, 215736 markings/sec, 195 secs
lola: 45086762 markings, 74716245 edges, 218714 markings/sec, 200 secs
lola: 46168334 markings, 76509524 edges, 216314 markings/sec, 205 secs
lola: 47242094 markings, 78289667 edges, 214752 markings/sec, 210 secs
lola: 48322594 markings, 80080897 edges, 216100 markings/sec, 215 secs
lola: 49416144 markings, 81890714 edges, 218710 markings/sec, 220 secs
lola: 50492707 markings, 83675431 edges, 215313 markings/sec, 225 secs
lola: 51560518 markings, 85445615 edges, 213562 markings/sec, 230 secs
lola: 52633830 markings, 87225464 edges, 214662 markings/sec, 235 secs
lola: 53722073 markings, 89026410 edges, 217649 markings/sec, 240 secs
lola: 54808141 markings, 90826937 edges, 217214 markings/sec, 245 secs
lola: 55883452 markings, 92609707 edges, 215062 markings/sec, 250 secs
lola: 56961079 markings, 94396202 edges, 215525 markings/sec, 255 secs
lola: 58050855 markings, 96199719 edges, 217955 markings/sec, 260 secs
lola: 59129729 markings, 97988314 edges, 215775 markings/sec, 265 secs
lola: 60197396 markings, 99758308 edges, 213533 markings/sec, 270 secs
lola: 61267163 markings, 101532237 edges, 213953 markings/sec, 275 secs
lola: 62345503 markings, 103319853 edges, 215668 markings/sec, 280 secs
lola: 63432073 markings, 105117854 edges, 217314 markings/sec, 285 secs
lola: 64506025 markings, 106898336 edges, 214790 markings/sec, 290 secs
lola: 65577840 markings, 108675386 edges, 214363 markings/sec, 295 secs
lola: 66656638 markings, 110463867 edges, 215760 markings/sec, 300 secs
lola: 67740955 markings, 112258209 edges, 216863 markings/sec, 305 secs
lola: 68807962 markings, 114027614 edges, 213401 markings/sec, 310 secs
lola: 69872003 markings, 115791579 edges, 212808 markings/sec, 315 secs
lola: 70941883 markings, 117565164 edges, 213976 markings/sec, 320 secs
lola: 72034371 markings, 119373300 edges, 218498 markings/sec, 325 secs
lola: 73116310 markings, 121166843 edges, 216388 markings/sec, 330 secs
lola: 74192495 markings, 122951012 edges, 215237 markings/sec, 335 secs
lola: 75272517 markings, 124741630 edges, 216004 markings/sec, 340 secs
lola: 76366381 markings, 126551906 edges, 218773 markings/sec, 345 secs
lola: 77440171 markings, 128332471 edges, 214758 markings/sec, 350 secs
lola: 78509376 markings, 130104997 edges, 213841 markings/sec, 355 secs
lola: 79584699 markings, 131887662 edges, 215065 markings/sec, 360 secs
lola: 80674161 markings, 133690624 edges, 217892 markings/sec, 365 secs
lola: 81752093 markings, 135477762 edges, 215586 markings/sec, 370 secs
lola: 82823610 markings, 137254126 edges, 214303 markings/sec, 375 secs
lola: 83899843 markings, 139038362 edges, 215247 markings/sec, 380 secs
lola: 84987147 markings, 140837811 edges, 217461 markings/sec, 385 secs
lola: 86064134 markings, 142623664 edges, 215397 markings/sec, 390 secs
lola: 87132738 markings, 144395067 edges, 213721 markings/sec, 395 secs
lola: 88203404 markings, 146170090 edges, 214133 markings/sec, 400 secs
lola: 89286980 markings, 147963435 edges, 216715 markings/sec, 405 secs
lola: 90368564 markings, 149756488 edges, 216317 markings/sec, 410 secs
lola: 91439572 markings, 151532058 edges, 214202 markings/sec, 415 secs
lola: 92512525 markings, 153310799 edges, 214591 markings/sec, 420 secs
lola: 93594112 markings, 155104382 edges, 216317 markings/sec, 425 secs
lola: 94678077 markings, 156898148 edges, 216793 markings/sec, 430 secs
lola: 95749001 markings, 158673431 edges, 214185 markings/sec, 435 secs
lola: 96817900 markings, 160445639 edges, 213780 markings/sec, 440 secs
lola: 97892110 markings, 162226388 edges, 214842 markings/sec, 445 secs
lola: 98976389 markings, 164020714 edges, 216856 markings/sec, 450 secs
lola: 100043866 markings, 165790550 edges, 213495 markings/sec, 455 secs
lola: 101108149 markings, 167555343 edges, 212857 markings/sec, 460 secs
lola: 102178951 markings, 169330619 edges, 214160 markings/sec, 465 secs
lola: 103264370 markings, 171126786 edges, 217084 markings/sec, 470 secs
lola: 104331746 markings, 172896354 edges, 213475 markings/sec, 475 secs
lola: 105392402 markings, 174654720 edges, 212131 markings/sec, 480 secs
lola: 106458404 markings, 176421948 edges, 213200 markings/sec, 485 secs
lola: 107544324 markings, 178219472 edges, 217184 markings/sec, 490 secs
lola: 108620160 markings, 180003056 edges, 215167 markings/sec, 495 secs
lola: 109688000 markings, 181773354 edges, 213568 markings/sec, 500 secs
lola: 110762417 markings, 183554559 edges, 214883 markings/sec, 505 secs
lola: 111850519 markings, 185355223 edges, 217620 markings/sec, 510 secs
lola: 112923295 markings, 187133652 edges, 214555 markings/sec, 515 secs
lola: 113989504 markings, 188901273 edges, 213242 markings/sec, 520 secs
lola: 115056126 markings, 190670225 edges, 213324 markings/sec, 525 secs
lola: 115918638 markings, 192096430 edges, 172502 markings/sec, 530 secs
lola: 116967131 markings, 193835002 edges, 209699 markings/sec, 535 secs
lola: 117997716 markings, 195543277 edges, 206117 markings/sec, 540 secs
lola: 119022523 markings, 197242302 edges, 204961 markings/sec, 545 secs
lola: 120049867 markings, 198945780 edges, 205469 markings/sec, 550 secs
lola: 121053815 markings, 200606922 edges, 200790 markings/sec, 555 secs
lola: 121934856 markings, 202067574 edges, 176208 markings/sec, 560 secs
lola: 122711989 markings, 203355685 edges, 155427 markings/sec, 565 secs
lola: 123593688 markings, 204817727 edges, 176340 markings/sec, 570 secs
lola: 124620829 markings, 206520383 edges, 205428 markings/sec, 575 secs
lola: 125664916 markings, 208248273 edges, 208817 markings/sec, 580 secs
lola: 126694060 markings, 209954716 edges, 205829 markings/sec, 585 secs
lola: 127716515 markings, 211649567 edges, 204491 markings/sec, 590 secs
lola: 128740854 markings, 213347765 edges, 204868 markings/sec, 595 secs
lola: 129780164 markings, 215068012 edges, 207862 markings/sec, 600 secs
lola: 130797836 markings, 216755039 edges, 203534 markings/sec, 605 secs
lola: 131638674 markings, 218148951 edges, 168168 markings/sec, 610 secs
lola: 132637141 markings, 219804198 edges, 199693 markings/sec, 615 secs
lola: 133119329 markings, 220603757 edges, 96438 markings/sec, 620 secs
lola: 133806252 markings, 221739187 edges, 137385 markings/sec, 625 secs
lola: 134790670 markings, 223371574 edges, 196884 markings/sec, 630 secs
lola: 135806586 markings, 225055571 edges, 203183 markings/sec, 635 secs
lola: 136817224 markings, 226731133 edges, 202128 markings/sec, 640 secs
lola: 137799033 markings, 228359079 edges, 196362 markings/sec, 645 secs
lola: 138837747 markings, 230077718 edges, 207743 markings/sec, 650 secs
lola: 139858725 markings, 231770652 edges, 204196 markings/sec, 655 secs
lola: 140833225 markings, 233386075 edges, 194900 markings/sec, 660 secs
lola: 141846982 markings, 235066665 edges, 202751 markings/sec, 665 secs
lola: 142003704 markings, 235326546 edges, 31344 markings/sec, 670 secs
lola: 142029715 markings, 235369812 edges, 5202 markings/sec, 675 secs
lola: 142029885 markings, 235370080 edges, 34 markings/sec, 680 secs
lola: 142030086 markings, 235370417 edges, 40 markings/sec, 685 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 2096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p117) U ((1 <= p64) AND (1 <= p191))) AND (((p8 <= 0) OR (p153 <= 0)) R ((p60 <= 0) R ((p145 <= 0) AND (p117 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p117) U ((1 <= p64) AND (1 <= p191))) AND (((p8 <= 0) OR (p153 <= 0)) R ((p60 <= 0) R ((p145 <= 0) AND (p117 <= 0))))))
lola: processed formula length: 131
lola: 71 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: 26 markings, 26 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (G (((1 <= p1) AND (1 <= p215)))) OR (p201 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G (((1 <= p1) AND (1 <= p215)))) OR (p201 <= 0))))
lola: processed formula length: 60
lola: 71 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: 1822340 markings, 2015605 edges, 364468 markings/sec, 0 secs
lola: 3664751 markings, 4053180 edges, 368482 markings/sec, 5 secs
lola: 5473256 markings, 6053685 edges, 361701 markings/sec, 10 secs
lola: 7267074 markings, 8038044 edges, 358764 markings/sec, 15 secs
lola: 9051677 markings, 10012220 edges, 356921 markings/sec, 20 secs
lola: 10834751 markings, 11984776 edges, 356615 markings/sec, 25 secs
lola: 12615090 markings, 13954324 edges, 356068 markings/sec, 30 secs
lola: 14389668 markings, 15917469 edges, 354916 markings/sec, 35 secs
lola: 16159917 markings, 17875817 edges, 354050 markings/sec, 40 secs
lola: 17931678 markings, 19835844 edges, 354352 markings/sec, 45 secs
lola: 19702221 markings, 21794532 edges, 354109 markings/sec, 50 secs
lola: 21457066 markings, 23735891 edges, 350969 markings/sec, 55 secs
lola: 23219224 markings, 25685299 edges, 352432 markings/sec, 60 secs
lola: 24979245 markings, 27632362 edges, 352004 markings/sec, 65 secs
lola: 26718179 markings, 29556106 edges, 347787 markings/sec, 70 secs
lola: 28508406 markings, 31536590 edges, 358045 markings/sec, 75 secs
lola: 30290113 markings, 33507590 edges, 356341 markings/sec, 80 secs
lola: 32043251 markings, 35447103 edges, 350628 markings/sec, 85 secs
lola: 33818170 markings, 37410636 edges, 354984 markings/sec, 90 secs
lola: 35575105 markings, 39354287 edges, 351387 markings/sec, 95 secs
lola: 37348051 markings, 41315675 edges, 354589 markings/sec, 100 secs
lola: 39094080 markings, 43247267 edges, 349206 markings/sec, 105 secs
lola: 40861943 markings, 45203040 edges, 353573 markings/sec, 110 secs
lola: 42617755 markings, 47145490 edges, 351162 markings/sec, 115 secs
lola: 44375243 markings, 49089798 edges, 351498 markings/sec, 120 secs
lola: 46129725 markings, 51030771 edges, 350896 markings/sec, 125 secs
lola: 47865706 markings, 52951294 edges, 347196 markings/sec, 130 secs
lola: 49628741 markings, 54901708 edges, 352607 markings/sec, 135 secs
lola: 51374941 markings, 56833516 edges, 349240 markings/sec, 140 secs
lola: 53117627 markings, 58761470 edges, 348537 markings/sec, 145 secs
lola: 54874314 markings, 60704880 edges, 351337 markings/sec, 150 secs
lola: 56607172 markings, 62621936 edges, 346572 markings/sec, 155 secs
lola: 58343493 markings, 64542808 edges, 347264 markings/sec, 160 secs
lola: 60111988 markings, 66499268 edges, 353699 markings/sec, 165 secs
lola: 61864110 markings, 68437634 edges, 350424 markings/sec, 170 secs
lola: 63622450 markings, 70382903 edges, 351668 markings/sec, 175 secs
lola: 65379276 markings, 72326485 edges, 351365 markings/sec, 180 secs
lola: 67117866 markings, 74249867 edges, 347718 markings/sec, 185 secs
lola: 68842655 markings, 76158054 edges, 344958 markings/sec, 190 secs
lola: 70606839 markings, 78109749 edges, 352837 markings/sec, 195 secs
lola: 72349278 markings, 80037367 edges, 348488 markings/sec, 200 secs
lola: 74078428 markings, 81950390 edges, 345830 markings/sec, 205 secs
lola: 75829679 markings, 83887780 edges, 350250 markings/sec, 210 secs
lola: 77562094 markings, 85804330 edges, 346483 markings/sec, 215 secs
lola: 79286095 markings, 87711621 edges, 344800 markings/sec, 220 secs
lola: 81017416 markings, 89626963 edges, 346264 markings/sec, 225 secs
lola: 82776396 markings, 91572929 edges, 351796 markings/sec, 230 secs
lola: 84521465 markings, 93503475 edges, 349014 markings/sec, 235 secs
lola: 86245998 markings, 95411389 edges, 344907 markings/sec, 240 secs
lola: 88000356 markings, 97352198 edges, 350872 markings/sec, 245 secs
lola: 89734886 markings, 99271068 edges, 346906 markings/sec, 250 secs
lola: 91460255 markings, 101179885 edges, 345074 markings/sec, 255 secs
lola: 93171279 markings, 103072836 edges, 342205 markings/sec, 260 secs
lola: 94919185 markings, 105006516 edges, 349581 markings/sec, 265 secs
lola: 96655478 markings, 106927334 edges, 347259 markings/sec, 270 secs
lola: 98384311 markings, 108840013 edges, 345767 markings/sec, 275 secs
lola: 100097229 markings, 110735058 edges, 342584 markings/sec, 280 secs
lola: 101840604 markings, 112663694 edges, 348675 markings/sec, 285 secs
lola: 103566270 markings, 114572751 edges, 345133 markings/sec, 290 secs
lola: 105284215 markings, 116473360 edges, 343589 markings/sec, 295 secs
lola: 106988144 markings, 118358494 edges, 340786 markings/sec, 300 secs
lola: 108714258 markings, 120268024 edges, 345223 markings/sec, 305 secs
lola: 110481423 markings, 122223045 edges, 353433 markings/sec, 310 secs
lola: 112239300 markings, 124167775 edges, 351575 markings/sec, 315 secs
lola: 113981079 markings, 126094765 edges, 348356 markings/sec, 320 secs
lola: 115721514 markings, 128020254 edges, 348087 markings/sec, 325 secs
lola: 117482324 markings, 129968175 edges, 352162 markings/sec, 330 secs
lola: 119226244 markings, 131898305 edges, 348784 markings/sec, 335 secs
lola: 120912441 markings, 133763966 edges, 337239 markings/sec, 340 secs
lola: 122581055 markings, 135608946 edges, 333723 markings/sec, 345 secs
lola: 124037730 markings, 137220478 edges, 291335 markings/sec, 350 secs
lola: 125536756 markings, 138878840 edges, 299805 markings/sec, 355 secs
lola: 126845076 markings, 140326188 edges, 261664 markings/sec, 360 secs
lola: 128413307 markings, 142061192 edges, 313646 markings/sec, 365 secs
lola: 130012960 markings, 143830887 edges, 319931 markings/sec, 370 secs
lola: 131304577 markings, 145259846 edges, 258323 markings/sec, 375 secs
lola: 132899191 markings, 147023972 edges, 318923 markings/sec, 380 secs
lola: 134099654 markings, 148352018 edges, 240093 markings/sec, 385 secs
lola: 135629936 markings, 150044956 edges, 306056 markings/sec, 390 secs
lola: 136858294 markings, 151403877 edges, 245672 markings/sec, 395 secs
lola: 138269595 markings, 152965247 edges, 282260 markings/sec, 400 secs
lola: 139674385 markings, 154519430 edges, 280958 markings/sec, 405 secs
lola: 141039469 markings, 156029632 edges, 273017 markings/sec, 410 secs
lola: 142531618 markings, 157680369 edges, 298430 markings/sec, 415 secs
lola: 143932556 markings, 159230238 edges, 280188 markings/sec, 420 secs
lola: 145023401 markings, 160437030 edges, 218169 markings/sec, 425 secs
lola: 146669148 markings, 162257777 edges, 329149 markings/sec, 430 secs
lola: 146914529 markings, 162529240 edges, 49076 markings/sec, 435 secs
lola: 146916219 markings, 162531110 edges, 338 markings/sec, 440 secs
lola: 146916449 markings, 162531362 edges, 46 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127)))))) OR (1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p56)
lola: processed formula length: 10
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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: F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p158 <= 0)) OR ((G (((p114 <= 0) OR (p127 <= 0))) AND X ((p158 <= 0))) OR G (((1 <= p114) AND (1 <= p127))))))
lola: processed formula length: 119
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 1822246 markings, 2015923 edges, 364449 markings/sec, 0 secs
lola: 3660564 markings, 4049365 edges, 367664 markings/sec, 5 secs
lola: 5461190 markings, 6041553 edges, 360125 markings/sec, 10 secs
lola: 7248716 markings, 8019357 edges, 357505 markings/sec, 15 secs
lola: 9025704 markings, 9985492 edges, 355398 markings/sec, 20 secs
lola: 10799914 markings, 11948663 edges, 354842 markings/sec, 25 secs
lola: 12569914 markings, 13907164 edges, 354000 markings/sec, 30 secs
lola: 14336876 markings, 15862289 edges, 353392 markings/sec, 35 secs
lola: 16096611 markings, 17809408 edges, 351947 markings/sec, 40 secs
lola: 17855045 markings, 19755084 edges, 351687 markings/sec, 45 secs
lola: 19610432 markings, 21697380 edges, 351077 markings/sec, 50 secs
lola: 21352435 markings, 23624937 edges, 348401 markings/sec, 55 secs
lola: 23109208 markings, 25568825 edges, 351355 markings/sec, 60 secs
lola: 24863012 markings, 27509351 edges, 350761 markings/sec, 65 secs
lola: 26594550 markings, 29425310 edges, 346308 markings/sec, 70 secs
lola: 28378254 markings, 31399009 edges, 356741 markings/sec, 75 secs
lola: 30153258 markings, 33362985 edges, 355001 markings/sec, 80 secs
lola: 31904341 markings, 35300588 edges, 350217 markings/sec, 85 secs
lola: 33670489 markings, 37254847 edges, 353230 markings/sec, 90 secs
lola: 35419212 markings, 39189847 edges, 349745 markings/sec, 95 secs
lola: 37183120 markings, 41141613 edges, 352782 markings/sec, 100 secs
lola: 38921958 markings, 43065673 edges, 347768 markings/sec, 105 secs
lola: 40678689 markings, 45009482 edges, 351346 markings/sec, 110 secs
lola: 42431912 markings, 46949491 edges, 350645 markings/sec, 115 secs
lola: 44179577 markings, 48883369 edges, 349533 markings/sec, 120 secs
lola: 45932652 markings, 50823132 edges, 350615 markings/sec, 125 secs
lola: 47664704 markings, 52739660 edges, 346410 markings/sec, 130 secs
lola: 49423938 markings, 54686317 edges, 351847 markings/sec, 135 secs
lola: 51166004 markings, 56613927 edges, 348413 markings/sec, 140 secs
lola: 52902649 markings, 58535637 edges, 347329 markings/sec, 145 secs
lola: 54650626 markings, 60469770 edges, 349595 markings/sec, 150 secs
lola: 56375406 markings, 62378288 edges, 344956 markings/sec, 155 secs
lola: 58096109 markings, 64282318 edges, 344141 markings/sec, 160 secs
lola: 59870758 markings, 66245983 edges, 354930 markings/sec, 165 secs
lola: 61620456 markings, 68182081 edges, 349940 markings/sec, 170 secs
lola: 63366153 markings, 70113744 edges, 349139 markings/sec, 175 secs
lola: 65115960 markings, 72049945 edges, 349961 markings/sec, 180 secs
lola: 66846944 markings, 73965336 edges, 346197 markings/sec, 185 secs
lola: 68568179 markings, 75869987 edges, 344247 markings/sec, 190 secs
lola: 70328509 markings, 77817773 edges, 352066 markings/sec, 195 secs
lola: 72072577 markings, 79747621 edges, 348814 markings/sec, 200 secs
lola: 73802417 markings, 81661780 edges, 345968 markings/sec, 205 secs
lola: 75550831 markings, 83596412 edges, 349683 markings/sec, 210 secs
lola: 77278303 markings, 85507906 edges, 345494 markings/sec, 215 secs
lola: 78996002 markings, 87408655 edges, 343540 markings/sec, 220 secs
lola: 80713205 markings, 89308761 edges, 343441 markings/sec, 225 secs
lola: 82465348 markings, 91247529 edges, 350429 markings/sec, 230 secs
lola: 84204261 markings, 93171705 edges, 347783 markings/sec, 235 secs
lola: 85923816 markings, 95074486 edges, 343911 markings/sec, 240 secs
lola: 87668722 markings, 97005210 edges, 348981 markings/sec, 245 secs
lola: 89397944 markings, 98918643 edges, 345844 markings/sec, 250 secs
lola: 91117975 markings, 100821953 edges, 344006 markings/sec, 255 secs
lola: 92817902 markings, 102702935 edges, 339985 markings/sec, 260 secs
lola: 94557988 markings, 104628394 edges, 348017 markings/sec, 265 secs
lola: 96291417 markings, 106546471 edges, 346686 markings/sec, 270 secs
lola: 98015158 markings, 108453858 edges, 344748 markings/sec, 275 secs
lola: 99720418 markings, 110340817 edges, 341052 markings/sec, 280 secs
lola: 101455782 markings, 112260997 edges, 347073 markings/sec, 285 secs
lola: 103177200 markings, 114165805 edges, 344284 markings/sec, 290 secs
lola: 104889738 markings, 116060790 edges, 342508 markings/sec, 295 secs
lola: 106591038 markings, 117943362 edges, 340260 markings/sec, 300 secs
lola: 108300320 markings, 119834752 edges, 341856 markings/sec, 305 secs
lola: 110065570 markings, 121788015 edges, 353050 markings/sec, 310 secs
lola: 111815409 markings, 123724267 edges, 349968 markings/sec, 315 secs
lola: 113549313 markings, 125642942 edges, 346781 markings/sec, 320 secs
lola: 115277525 markings, 127555232 edges, 345642 markings/sec, 325 secs
lola: 117035038 markings, 129499953 edges, 351503 markings/sec, 330 secs
lola: 118477527 markings, 131096327 edges, 288498 markings/sec, 335 secs
lola: 120134021 markings, 132929102 edges, 331299 markings/sec, 340 secs
lola: 121741411 markings, 134707718 edges, 321478 markings/sec, 345 secs
lola: 123176575 markings, 136295821 edges, 287033 markings/sec, 350 secs
lola: 124399986 markings, 137649520 edges, 244682 markings/sec, 355 secs
lola: 126046037 markings, 139470895 edges, 329210 markings/sec, 360 secs
lola: 127134038 markings, 140674811 edges, 217600 markings/sec, 365 secs
lola: 128605231 markings, 142302736 edges, 294239 markings/sec, 370 secs
lola: 130121731 markings, 143980851 edges, 303300 markings/sec, 375 secs
lola: 131745045 markings, 145777113 edges, 324663 markings/sec, 380 secs
lola: 133222526 markings, 147411952 edges, 295496 markings/sec, 385 secs
lola: 134742804 markings, 149094198 edges, 304056 markings/sec, 390 secs
lola: 136077709 markings, 150571257 edges, 266981 markings/sec, 395 secs
lola: 137485335 markings, 152128906 edges, 281525 markings/sec, 400 secs
lola: 138799376 markings, 153582992 edges, 262808 markings/sec, 405 secs
lola: 140199113 markings, 155131815 edges, 279947 markings/sec, 410 secs
lola: 141820881 markings, 156926350 edges, 324354 markings/sec, 415 secs
lola: 143219940 markings, 158474469 edges, 279812 markings/sec, 420 secs
lola: 144699288 markings, 160111391 edges, 295870 markings/sec, 425 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: ========================================
lola: ...considering subproblem: F (G ((G (F (((p11 <= 0) OR (p19 <= 0)))) AND ((p45 <= 0) OR (p194 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((p11 <= 0) OR (p19 <= 0)))) AND ((p45 <= 0) OR (p194 <= 0)))))
lola: processed formula length: 78
lola: 71 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: 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: 791539 markings, 1312090 edges, 158308 markings/sec, 0 secs
lola: 1910806 markings, 3167596 edges, 223853 markings/sec, 5 secs
lola: 3026212 markings, 5016717 edges, 223081 markings/sec, 10 secs
lola: 4147072 markings, 6875022 edges, 224172 markings/sec, 15 secs
lola: 5272372 markings, 8737494 edges, 225060 markings/sec, 20 secs
lola: 6382358 markings, 10577570 edges, 221997 markings/sec, 25 secs
lola: 7489624 markings, 12413409 edges, 221453 markings/sec, 30 secs
lola: 8602434 markings, 14258230 edges, 222562 markings/sec, 35 secs
lola: 9722764 markings, 16112525 edges, 224066 markings/sec, 40 secs
lola: 10822123 markings, 17935100 edges, 219872 markings/sec, 45 secs
lola: 11917622 markings, 19751213 edges, 219100 markings/sec, 50 secs
lola: 13019021 markings, 21577277 edges, 220280 markings/sec, 55 secs
lola: 14131198 markings, 23417926 edges, 222435 markings/sec, 60 secs
lola: 15225008 markings, 25231281 edges, 218762 markings/sec, 65 secs
lola: 16314747 markings, 27037855 edges, 217948 markings/sec, 70 secs
lola: 17412380 markings, 28857590 edges, 219527 markings/sec, 75 secs
lola: 18523460 markings, 30696439 edges, 222216 markings/sec, 80 secs
lola: 19611685 markings, 32500540 edges, 217645 markings/sec, 85 secs
lola: 20699407 markings, 34303778 edges, 217544 markings/sec, 90 secs
lola: 21792449 markings, 36115902 edges, 218608 markings/sec, 95 secs
lola: 22898406 markings, 37946326 edges, 221191 markings/sec, 100 secs
lola: 23982669 markings, 39743842 edges, 216853 markings/sec, 105 secs
lola: 25063182 markings, 41535494 edges, 216103 markings/sec, 110 secs
lola: 26151103 markings, 43339232 edges, 217584 markings/sec, 115 secs
lola: 27253329 markings, 45163253 edges, 220445 markings/sec, 120 secs
lola: 28339985 markings, 46964885 edges, 217331 markings/sec, 125 secs
lola: 29422912 markings, 48760133 edges, 216585 markings/sec, 130 secs
lola: 30510417 markings, 50562961 edges, 217501 markings/sec, 135 secs
lola: 31611384 markings, 52385236 edges, 220193 markings/sec, 140 secs
lola: 32693901 markings, 54179852 edges, 216503 markings/sec, 145 secs
lola: 33769541 markings, 55963093 edges, 215128 markings/sec, 150 secs
lola: 34850038 markings, 57754369 edges, 216099 markings/sec, 155 secs
lola: 35944220 markings, 59565591 edges, 218836 markings/sec, 160 secs
lola: 37033793 markings, 61372028 edges, 217915 markings/sec, 165 secs
lola: 38114440 markings, 63163443 edges, 216129 markings/sec, 170 secs
lola: 39200694 markings, 64964302 edges, 217251 markings/sec, 175 secs
lola: 40297963 markings, 66780132 edges, 219454 markings/sec, 180 secs
lola: 41380178 markings, 68574350 edges, 216443 markings/sec, 185 secs
lola: 42452178 markings, 70351511 edges, 214400 markings/sec, 190 secs
lola: 43525361 markings, 72130759 edges, 214637 markings/sec, 195 secs
lola: 44610261 markings, 73926183 edges, 216980 markings/sec, 200 secs
lola: 45696707 markings, 75727574 edges, 217289 markings/sec, 205 secs
lola: 46772003 markings, 77510400 edges, 215059 markings/sec, 210 secs
lola: 47846681 markings, 79292026 edges, 214936 markings/sec, 215 secs
lola: 48929202 markings, 81086605 edges, 216504 markings/sec, 220 secs
lola: 50013329 markings, 82880826 edges, 216825 markings/sec, 225 secs
lola: 51081985 markings, 84652459 edges, 213731 markings/sec, 230 secs
lola: 52149706 markings, 86422471 edges, 213544 markings/sec, 235 secs
lola: 53222065 markings, 88200370 edges, 214472 markings/sec, 240 secs
lola: 54313651 markings, 90007092 edges, 218317 markings/sec, 245 secs
lola: 55388366 markings, 91788948 edges, 214943 markings/sec, 250 secs
lola: 56460494 markings, 93566289 edges, 214426 markings/sec, 255 secs
lola: 57538489 markings, 95353512 edges, 215599 markings/sec, 260 secs
lola: 59412355 markings, 98456764 edges, 374773 markings/sec, 265 secs
lola: 60477440 markings, 100222599 edges, 213017 markings/sec, 270 secs
lola: 61536334 markings, 101978412 edges, 211779 markings/sec, 275 secs
lola: 62602728 markings, 103742930 edges, 213279 markings/sec, 280 secs
lola: 63669697 markings, 105511988 edges, 213394 markings/sec, 285 secs
lola: 64737820 markings, 107282732 edges, 213625 markings/sec, 290 secs
lola: 65807187 markings, 109055546 edges, 213873 markings/sec, 295 secs
lola: 66885551 markings, 110840157 edges, 215673 markings/sec, 300 secs
lola: 67957602 markings, 112617871 edges, 214410 markings/sec, 305 secs
lola: 69019951 markings, 114379060 edges, 212470 markings/sec, 310 secs
lola: 70081579 markings, 116138779 edges, 212326 markings/sec, 315 secs
lola: 71148639 markings, 117907962 edges, 213412 markings/sec, 320 secs
lola: 72238121 markings, 119710974 edges, 217896 markings/sec, 325 secs
lola: 73315982 markings, 121497908 edges, 215572 markings/sec, 330 secs
lola: 74388811 markings, 123276861 edges, 214566 markings/sec, 335 secs
lola: 75469197 markings, 125067962 edges, 216077 markings/sec, 340 secs
lola: 76559109 markings, 126871574 edges, 217982 markings/sec, 345 secs
lola: 77630103 markings, 128647084 edges, 214199 markings/sec, 350 secs
lola: 78695460 markings, 130413415 edges, 213071 markings/sec, 355 secs
lola: 79766811 markings, 132189513 edges, 214270 markings/sec, 360 secs
lola: 80856733 markings, 133993286 edges, 217984 markings/sec, 365 secs
lola: 81928516 markings, 135770111 edges, 214357 markings/sec, 370 secs
lola: 82997010 markings, 137541952 edges, 213699 markings/sec, 375 secs
lola: 84068897 markings, 139318950 edges, 214377 markings/sec, 380 secs
lola: 85156568 markings, 141118826 edges, 217534 markings/sec, 385 secs
lola: 86228933 markings, 142896546 edges, 214473 markings/sec, 390 secs
lola: 87295098 markings, 144664023 edges, 213233 markings/sec, 395 secs
lola: 88363520 markings, 146435451 edges, 213684 markings/sec, 400 secs
lola: 89448001 markings, 148230138 edges, 216896 markings/sec, 405 secs
lola: 90524876 markings, 150015776 edges, 215375 markings/sec, 410 secs
lola: 91594008 markings, 151788152 edges, 213826 markings/sec, 415 secs
lola: 92665512 markings, 153564528 edges, 214301 markings/sec, 420 secs
lola: 93748736 markings, 155357254 edges, 216645 markings/sec, 425 secs
lola: 94824662 markings, 157140821 edges, 215185 markings/sec, 430 secs
lola: 95890572 markings, 158907984 edges, 213182 markings/sec, 435 secs
lola: 96955394 markings, 160673843 edges, 212964 markings/sec, 440 secs
lola: 98029950 markings, 162455241 edges, 214911 markings/sec, 445 secs
lola: 99109691 markings, 164242081 edges, 215948 markings/sec, 450 secs
lola: 100177096 markings, 166011705 edges, 213481 markings/sec, 455 secs
lola: 101242000 markings, 167777030 edges, 212981 markings/sec, 460 secs
lola: 102311917 markings, 169550665 edges, 213983 markings/sec, 465 secs
lola: 103392398 markings, 171338842 edges, 216096 markings/sec, 470 secs
lola: 104457215 markings, 173104537 edges, 212963 markings/sec, 475 secs
lola: 105518071 markings, 174863294 edges, 212171 markings/sec, 480 secs
lola: 106584204 markings, 176630727 edges, 213227 markings/sec, 485 secs
lola: 107671417 markings, 178429980 edges, 217443 markings/sec, 490 secs
lola: 108745018 markings, 180209762 edges, 214720 markings/sec, 495 secs
lola: 109811597 markings, 181977908 edges, 213316 markings/sec, 500 secs
lola: 110883821 markings, 183755791 edges, 214445 markings/sec, 505 secs
lola: 111971697 markings, 185556367 edges, 217575 markings/sec, 510 secs
lola: 113041654 markings, 187330152 edges, 213991 markings/sec, 515 secs
lola: 114105184 markings, 189093075 edges, 212706 markings/sec, 520 secs
lola: 115164150 markings, 190849200 edges, 211793 markings/sec, 525 secs
lola: 116074355 markings, 192354812 edges, 182041 markings/sec, 530 secs
lola: 116779156 markings, 193522986 edges, 140960 markings/sec, 535 secs
lola: 117811685 markings, 195235283 edges, 206506 markings/sec, 540 secs
lola: 118841907 markings, 196942783 edges, 206044 markings/sec, 545 secs
lola: 119854733 markings, 198621894 edges, 202565 markings/sec, 550 secs
lola: 120897181 markings, 200347310 edges, 208490 markings/sec, 555 secs
lola: 121810391 markings, 201860987 edges, 182642 markings/sec, 560 secs
lola: 122823103 markings, 203540178 edges, 202542 markings/sec, 565 secs
lola: 123481591 markings, 204631757 edges, 131698 markings/sec, 570 secs
lola: 124500326 markings, 206321044 edges, 203747 markings/sec, 575 secs
lola: 125337084 markings, 207704989 edges, 167352 markings/sec, 580 secs
lola: 126235565 markings, 209194324 edges, 179696 markings/sec, 585 secs
lola: 127258935 markings, 210891265 edges, 204674 markings/sec, 590 secs
lola: 128288586 markings, 212598117 edges, 205930 markings/sec, 595 secs
lola: 129282745 markings, 214245899 edges, 198832 markings/sec, 600 secs
lola: 130388989 markings, 216077516 edges, 221249 markings/sec, 605 secs
lola: 131412296 markings, 217773735 edges, 204661 markings/sec, 610 secs
lola: 132429324 markings, 219459754 edges, 203406 markings/sec, 615 secs
lola: 133453715 markings, 221158422 edges, 204878 markings/sec, 620 secs
lola: 134494375 markings, 222880406 edges, 208132 markings/sec, 625 secs
lola: 135488219 markings, 224527850 edges, 198769 markings/sec, 630 secs
lola: 136504734 markings, 226213450 edges, 203303 markings/sec, 635 secs
lola: 137494800 markings, 227854465 edges, 198013 markings/sec, 640 secs
lola: 138534474 markings, 229575015 edges, 207935 markings/sec, 645 secs
lola: 139548367 markings, 231256282 edges, 202779 markings/sec, 650 secs
lola: 140516480 markings, 232860832 edges, 193623 markings/sec, 655 secs
lola: 141530545 markings, 234542481 edges, 202813 markings/sec, 660 secs
lola: 142024961 markings, 235362001 edges, 98883 markings/sec, 665 secs
lola: 142025160 markings, 235362328 edges, 40 markings/sec, 670 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no no no unknown unknown
lola:
preliminary result: no no unknown no no no no no no no unknown unknown
lola: memory consumption: 3444 KB
lola: time consumption: 3056 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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r094-tall-162048902500210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 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 ;