Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882800764.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591239130820

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:52:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:52:12] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-04 02:52:12] [INFO ] Transformed 163 places.
[2020-06-04 02:52:12] [INFO ] Transformed 148 transitions.
[2020-06-04 02:52:12] [INFO ] Parsed PT model containing 163 places and 148 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 3318 resets, run finished after 260 ms. (steps per millisecond=384 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 148 rows 163 cols
[2020-06-04 02:52:12] [INFO ] Computed 19 place invariants in 32 ms
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 75 places in 84 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 64 places in 57 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 42 places in 36 ms
[2020-06-04 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2020-06-04 02:52:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 75 places in 51 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 64 places in 49 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 42 places in 24 ms
[2020-06-04 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2020-06-04 02:52:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 21 ms.
[2020-06-04 02:52:14] [INFO ] Added : 145 causal constraints over 29 iterations in 406 ms. Result :sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 14 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-04 02:52:14] [INFO ] Deduced a trap composed of 47 places in 76 ms
[2020-06-04 02:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-06-04 02:52:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 47 places in 63 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2020-06-04 02:52:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 22 ms.
[2020-06-04 02:52:15] [INFO ] Added : 143 causal constraints over 29 iterations in 526 ms. Result :sat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 53 places in 79 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-06-04 02:52:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-04 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2020-06-04 02:52:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 16 ms.
[2020-06-04 02:52:16] [INFO ] Added : 145 causal constraints over 29 iterations in 438 ms. Result :sat
[2020-06-04 02:52:16] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:16] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 37 places in 61 ms
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 59 places in 48 ms
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 55 places in 46 ms
[2020-06-04 02:52:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2020-06-04 02:52:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 37 places in 68 ms
[2020-06-04 02:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-06-04 02:52:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-06-04 02:52:17] [INFO ] Added : 97 causal constraints over 20 iterations in 278 ms. Result :sat
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-04 02:52:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-06-04 02:52:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:18] [INFO ] Added : 142 causal constraints over 29 iterations in 415 ms. Result :sat
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-04 02:52:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-06-04 02:52:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:19] [INFO ] Added : 143 causal constraints over 30 iterations in 362 ms. Result :sat
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 48 places in 55 ms
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 56 places in 47 ms
[2020-06-04 02:52:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2020-06-04 02:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 48 places in 66 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 65 places in 61 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 56 places in 45 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2020-06-04 02:52:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:20] [INFO ] Added : 141 causal constraints over 29 iterations in 416 ms. Result :sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 65 places in 91 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 42 places in 36 ms
[2020-06-04 02:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-06-04 02:52:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 42 places in 29 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 43 places in 112 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 72 places in 70 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 37 places in 92 ms
[2020-06-04 02:52:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 357 ms
[2020-06-04 02:52:21] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:22] [INFO ] Added : 143 causal constraints over 29 iterations in 436 ms. Result :sat
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 24 places in 63 ms
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-04 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 75 places in 64 ms
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 64 places in 53 ms
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 42 places in 25 ms
[2020-06-04 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2020-06-04 02:52:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 75 places in 93 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 64 places in 62 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 42 places in 24 ms
[2020-06-04 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2020-06-04 02:52:23] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:23] [INFO ] Added : 145 causal constraints over 29 iterations in 358 ms. Result :sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 73 places in 61 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 67 places in 61 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 74 places in 80 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 53 places in 60 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 74 places in 52 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 82 places in 51 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 79 places in 49 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 82 places in 80 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 85 places in 63 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 660 ms
[2020-06-04 02:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 73 places in 77 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 58 places in 73 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 74 places in 75 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 42 places in 80 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 29 places in 63 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 76 places in 80 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 76 places in 76 ms
[2020-06-04 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 595 ms
[2020-06-04 02:52:25] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 14 ms.
[2020-06-04 02:52:25] [INFO ] Added : 140 causal constraints over 28 iterations in 414 ms. Result :sat
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 80 places in 76 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 74 places in 64 ms
[2020-06-04 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-04 02:52:25] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 27 ms returned sat
[2020-06-04 02:52:26] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 16 ms returned sat
[2020-06-04 02:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:26] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-06-04 02:52:26] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 ms.
[2020-06-04 02:52:26] [INFO ] Added : 98 causal constraints over 20 iterations in 358 ms. Result :sat
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 58 places in 62 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 77 places in 76 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 81 places in 56 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 86 places in 79 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 79 places in 77 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 85 places in 56 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 77 places in 46 ms
[2020-06-04 02:52:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 596 ms
[2020-06-04 02:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:27] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:27] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 58 places in 55 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 88 places in 55 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 62 places in 85 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 37 places in 63 ms
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 29 places in 73 ms
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 72 places in 40 ms
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 80 places in 72 ms
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 42 places in 18 ms
[2020-06-04 02:52:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 546 ms
[2020-06-04 02:52:28] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:28] [INFO ] Added : 145 causal constraints over 29 iterations in 465 ms. Result :sat
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 24 places in 88 ms
[2020-06-04 02:52:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2020-06-04 02:52:28] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:52:28] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:28] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 29 places in 48 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 42 places in 31 ms
[2020-06-04 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2020-06-04 02:52:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:52:29] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:29] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 42 places in 24 ms
[2020-06-04 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2020-06-04 02:52:29] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:29] [INFO ] Added : 143 causal constraints over 29 iterations in 382 ms. Result :sat
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 24 places in 61 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2020-06-04 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2020-06-04 02:52:30] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:30] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-06-04 02:52:30] [INFO ] Deduced a trap composed of 60 places in 68 ms
[2020-06-04 02:52:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-06-04 02:52:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:30] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:30] [INFO ] Deduced a trap composed of 60 places in 54 ms
[2020-06-04 02:52:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-06-04 02:52:30] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:30] [INFO ] Added : 139 causal constraints over 28 iterations in 397 ms. Result :sat
[2020-06-04 02:52:30] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:31] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 46 places in 89 ms
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 71 places in 60 ms
[2020-06-04 02:52:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2020-06-04 02:52:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:52:31] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:31] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 71 places in 59 ms
[2020-06-04 02:52:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2020-06-04 02:52:31] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-06-04 02:52:32] [INFO ] Added : 140 causal constraints over 28 iterations in 422 ms. Result :sat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:32] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 42 places in 48 ms
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-04 02:52:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2020-06-04 02:52:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:32] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 42 places in 62 ms
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-06-04 02:52:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2020-06-04 02:52:32] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:33] [INFO ] Added : 142 causal constraints over 29 iterations in 415 ms. Result :sat
[2020-06-04 02:52:33] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:33] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:33] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 56 places in 44 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 67 places in 41 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 69 places in 38 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 48 places in 30 ms
[2020-06-04 02:52:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 329 ms
[2020-06-04 02:52:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:52:33] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:33] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 48 places in 49 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 66 places in 60 ms
[2020-06-04 02:52:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2020-06-04 02:52:34] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:34] [INFO ] Added : 145 causal constraints over 29 iterations in 361 ms. Result :sat
[2020-06-04 02:52:34] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:34] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:34] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 42 places in 31 ms
[2020-06-04 02:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2020-06-04 02:52:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-04 02:52:34] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:34] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 42 places in 34 ms
[2020-06-04 02:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-06-04 02:52:35] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:35] [INFO ] Added : 143 causal constraints over 29 iterations in 467 ms. Result :sat
[2020-06-04 02:52:35] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-06-04 02:52:35] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:35] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:35] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-04 02:52:35] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-06-04 02:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2020-06-04 02:52:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 02:52:35] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:35] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-06-04 02:52:35] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2020-06-04 02:52:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2020-06-04 02:52:36] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:36] [INFO ] Added : 141 causal constraints over 29 iterations in 388 ms. Result :sat
[2020-06-04 02:52:36] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2020-06-04 02:52:36] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:36] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 42 places in 69 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 57 places in 66 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 58 places in 70 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 67 places in 50 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 78 places in 55 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 73 places in 52 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 48 places in 40 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 68 places in 53 ms
[2020-06-04 02:52:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 547 ms
[2020-06-04 02:52:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:52:37] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:37] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 73 places in 59 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 69 places in 54 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 68 places in 54 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 67 places in 54 ms
[2020-06-04 02:52:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 415 ms
[2020-06-04 02:52:37] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:38] [INFO ] Added : 129 causal constraints over 26 iterations in 346 ms. Result :sat
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 38 places in 55 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 73 places in 67 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 75 places in 56 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 66 places in 47 ms
[2020-06-04 02:52:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2020-06-04 02:52:38] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-06-04 02:52:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 02:52:38] [INFO ] Flatten gal took : 55 ms
[2020-06-04 02:52:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 02:52:38] [INFO ] Flatten gal took : 18 ms
FORMULA DoubleExponent-PT-003-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:52:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 02:52:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DoubleExponent-PT-003 @ 3570 seconds

FORMULA DoubleExponent-PT-003-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA DoubleExponent-PT-003-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-003-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-003-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3556
rslt: Output for CTLFireability @ DoubleExponent-PT-003

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:52:39 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX(EG(((1 <= p75) OR (1 <= p7) OR (p118 <= 0) OR (p139 <= 0))))",
"processed_size": 66,
"rewrites": 14
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 4,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(E(EF((1 <= p40)) U EG((1 <= p144))) OR (AX(((1 <= p34) AND (1 <= p91))) AND E((1 <= p72) U (1 <= p43))))",
"processed_size": 105,
"rewrites": 17
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 2470856,
"markings": 2385072,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p77) OR (p26 <= 0) OR (p42 <= 0))",
"processed_size": 42,
"rewrites": 15
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(AF(EX(((1 <= p114) AND (1 <= p121)))))",
"processed_size": 41,
"rewrites": 15
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p114 <= 0) OR (p121 <= 0))",
"processed_size": 29,
"rewrites": 15
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p59) AND (1 <= p115))",
"processed_size": 28,
"rewrites": 16
},
"result":
{
"edges": 2156525,
"markings": 2156526,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p28) AND (1 <= p48))))",
"processed_size": 35,
"rewrites": 14
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 49,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(E((1 <= p4) U (1 <= p43)))",
"processed_size": 29,
"rewrites": 14
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 49,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A((EG((1 <= p99)) OR ((1 <= p82) OR (1 <= p37))) U EG((p20 <= 0)))",
"processed_size": 66,
"rewrites": 15
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((p75 <= 0)))",
"processed_size": 18,
"rewrites": 14
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p161 <= 0) U ((1 <= p101) AND (1 <= p152))))",
"processed_size": 49,
"rewrites": 17
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p59 <= 0) OR (p115 <= 0))",
"processed_size": 28,
"rewrites": 16
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p6 <= 0) OR (p94 <= 0))",
"processed_size": 26,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((1 <= p47)))",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 129949,
"markings": 129950,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 26928,
"runtime": 14.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(A(G(**)))) AND (** OR (A(G(**)) OR A((** U **))))) : A(X(E(G(**)))) : A(((E(G(**)) OR (** OR **)) U E(G(**)))) : A(G(A(F(**)))) : A(F(**)) : A(F(E((** U **)))) : (E((E(F(**)) U E(G(**)))) OR (A(X(**)) AND E((** U **)))) : (** OR (E(F(**)) AND **)) : A(X(A(F(**)))) : A(X(A(F(E(X(**)))))) : A(F(E(G(**)))) : A(F(**))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "no yes yes yes no no no yes no no no no ",
"value": "no yes yes yes no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 311/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 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 CTLFireability.xml
lola: (A (F (A (G (((1 <= p59) AND (1 <= p115)))))) AND (((1 <= p30) OR A (G ((p75 <= 0)))) OR A (((p161 <= 0) U ((1 <= p101) AND (1 <= p152)))))) : A (X (E (G (((1 <= p75) OR (1 <= p7) OR (p118 <= 0) OR (p139 <= 0)))))) : A ((((E (G ((1 <= p99))) OR (1 <= p82)) OR (1 <= p37)) U E (G ((p20 <= 0))))) : A (G ((A (F (((p59 <= 0) OR (p115 <= 0)))) OR E (G ((1 <= 0)))))) : A (F (A ((((1 <= p3) AND (1 <= p120)) U ((1 <= p114) AND (1 <= p121)))))) : A (F ((E (X ((1 <= 0))) OR E (((1 <= p4) U (1 <= p43)))))) : (E ((E (F ((1 <= p40))) U E (G ((1 <= p144))))) OR (A (X (((1 <= p34) AND (1 <= p91)))) AND E (((1 <= p72) U (1 <= p43))))) : (((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0))) OR (E (F ((1 <= p47))) AND ((p6 <= 0) OR (p94 <= 0)))) : A (X (A (F (((p77 <= 0) AND (1 <= p26) AND (1 <= p42)))))) : A (X (A (F (E (X (((1 <= p114) AND (1 <= p121)))))))) : A (F (E (G (E (G (((1 <= p28) AND (1 <= p48)))))))) : A ((E (G (((p10 <= 0) OR (p46 <= 0)))) U A (F (((1 <= p6) AND (1 <= p87))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((1 <= p75) OR (1 <= p7) OR (p118 <= 0) OR (p139 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((1 <= p75) OR (1 <= p7) OR (p118 <= 0) OR (p139 <= 0))))
lola: processed formula length: 66
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (F ((1 <= p40))) U E (G ((1 <= p144))))) OR (A (X (((1 <= p34) AND (1 <= p91)))) AND E (((1 <= p72) U (1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(EF((1 <= p40)) U EG((1 <= p144))) OR (AX(((1 <= p34) AND (1 <= p91))) AND E((1 <= p72) U (1 <= p43))))
lola: processed formula length: 105
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2385072 markings, 2470856 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((p77 <= 0) AND (1 <= p26) AND (1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p77) OR (p26 <= 0) OR (p42 <= 0))
lola: processed formula length: 42
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p77 <= 0) AND (1 <= p26) AND (1 <= p42))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 3 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (E (X (((1 <= p114) AND (1 <= p121))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AF(EX(((1 <= p114) AND (1 <= p121)))))
lola: processed formula length: 41
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p114) AND (1 <= p121))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p114 <= 0) OR (p121 <= 0))
lola: processed formula length: 29
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p114) AND (1 <= p121))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p59 <= 0) OR (p115 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p59) AND (1 <= p115))
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p59 <= 0) OR (p115 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p59) AND (1 <= p115))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 9)

lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 1829906 markings, 1829906 edges, 365981 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 2156526 markings, 2156525 edges
lola: ========================================
lola: subprocess 6 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p6) AND (1 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p6 <= 0) OR (p87 <= 0))
lola: processed formula length: 26
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p87))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p28) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p28) AND (1 <= p48))))
lola: processed formula length: 35
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 49 edges
lola: ========================================
lola: subprocess 8 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= p4) U (1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((1 <= p4) U (1 <= p43)))
lola: processed formula length: 29
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 49 edges
lola: ========================================
lola: subprocess 9 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((E (G ((1 <= p99))) OR ((1 <= p82) OR (1 <= p37))) U E (G ((p20 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((EG((1 <= p99)) OR ((1 <= p82) OR (1 <= p37))) U EG((p20 <= 0)))
lola: processed formula length: 66
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 10 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0))) OR (E (F ((1 <= p47))) AND ((p6 <= 0) OR (p94 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) OR (p94 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p6 <= 0) OR (p94 <= 0))
lola: processed formula length: 26
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0)))
lola: processed formula length: 60
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G (((1 <= p59) AND (1 <= p115)))))) AND ((1 <= p30) OR (A (G ((p75 <= 0))) OR A (((p161 <= 0) U ((1 <= p101) AND (1 <= p152)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p75 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p75 <= 0)))
lola: processed formula length: 18
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p75)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p161 <= 0) U ((1 <= p101) AND (1 <= p152))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p161 <= 0) U ((1 <= p101) AND (1 <= p152))))
lola: processed formula length: 49
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p161 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p59) AND (1 <= p115))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p59 <= 0) OR (p115 <= 0))
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: The predicate is not eventually invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0))) OR (E (F ((1 <= p47))) AND ((p6 <= 0) OR (p94 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) OR (p94 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p6 <= 0) OR (p94 <= 0))
lola: processed formula length: 26
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p45) AND (1 <= p141) AND ((p78 <= 0) OR (p87 <= 0)))
lola: processed formula length: 60
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: E (F ((1 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p47)))
lola: processed formula length: 18
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p47)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 129950 markings, 129949 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no no yes no no no no
lola:
preliminary result: no yes yes yes no no no yes no no no no
lola: memory consumption: 26928 KB
lola: time consumption: 14 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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-003"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-003, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882800764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;