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-158987882800762.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800762
=====================================================================

--------------------
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-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15

=== Now, execution of the tool begins

BK_START 1591239129449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:52:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:52:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:52:11] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-04 02:52:11] [INFO ] Transformed 163 places.
[2020-06-04 02:52:11] [INFO ] Transformed 148 transitions.
[2020-06-04 02:52:11] [INFO ] Parsed PT model containing 163 places and 148 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3325 resets, run finished after 208 ms. (steps per millisecond=480 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 148 rows 163 cols
[2020-06-04 02:52:11] [INFO ] Computed 19 place invariants in 11 ms
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-04 02:52:11] [INFO ] Deduced a trap composed of 40 places in 91 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 48 places in 38 ms
[2020-06-04 02:52:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2020-06-04 02:52:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 40 places in 56 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 48 places in 33 ms
[2020-06-04 02:52:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2020-06-04 02:52:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:12] [INFO ] Added : 145 causal constraints over 30 iterations in 335 ms. Result :sat
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 50 places in 28 ms
[2020-06-04 02:52:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:12] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-06-04 02:52:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 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 13 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 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 94 ms returned sat
[2020-06-04 02:52:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 17 ms.
[2020-06-04 02:52:13] [INFO ] Added : 145 causal constraints over 29 iterations in 452 ms. Result :sat
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 53 places in 59 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2020-06-04 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-06-04 02:52:14] [INFO ] Deduced a trap composed of 45 places in 42 ms
[2020-06-04 02:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 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 19 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 127 ms returned sat
[2020-06-04 02:52:14] [INFO ] Deduced a trap composed of 45 places in 52 ms
[2020-06-04 02:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-06-04 02:52:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 14 ms.
[2020-06-04 02:52:14] [INFO ] Added : 145 causal constraints over 29 iterations in 474 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 9 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 47 places in 56 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 50 places in 43 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2020-06-04 02:52:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 47 places in 39 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 49 places in 44 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2020-06-04 02:52:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:15] [INFO ] Added : 143 causal constraints over 29 iterations in 473 ms. Result :sat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:16] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 75 places in 76 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 64 places in 60 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 42 places in 28 ms
[2020-06-04 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2020-06-04 02:52:16] [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 15 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 113 ms returned sat
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 75 places in 90 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 64 places in 74 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2020-06-04 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2020-06-04 02:52:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-06-04 02:52:17] [INFO ] Added : 145 causal constraints over 29 iterations in 383 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 7 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 119 ms returned sat
[2020-06-04 02:52:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 14 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 16 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 121 ms returned sat
[2020-06-04 02:52:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:17] [INFO ] Added : 110 causal constraints over 22 iterations in 392 ms. Result :sat
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 9 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 124 ms returned sat
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 45 places in 41 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 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 16 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 124 ms returned sat
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 43 places in 46 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 45 places in 43 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2020-06-04 02:52:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-06-04 02:52:19] [INFO ] Added : 131 causal constraints over 27 iterations in 425 ms. Result :sat
[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 125 ms returned sat
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-06-04 02:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 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 6 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-06-04 02:52:19] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2020-06-04 02:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2020-06-04 02:52:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:20] [INFO ] Added : 145 causal constraints over 29 iterations in 400 ms. Result :sat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 65 places in 72 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 66 places in 62 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
[2020-06-04 02:52:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 65 places in 85 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 66 places in 69 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2020-06-04 02:52:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 16 ms.
[2020-06-04 02:52:21] [INFO ] Added : 138 causal constraints over 28 iterations in 424 ms. Result :sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 71 places in 58 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 75 places in 59 ms
[2020-06-04 02:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 48 places in 45 ms
[2020-06-04 02:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 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 11 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 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 85 ms returned sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 16 places in 70 ms
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 48 places in 57 ms
[2020-06-04 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2020-06-04 02:52:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:22] [INFO ] Added : 145 causal constraints over 29 iterations in 280 ms. Result :sat
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 56 places in 71 ms
[2020-06-04 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 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 84 ms returned sat
[2020-06-04 02:52:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 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 16 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 114 ms returned sat
[2020-06-04 02:52:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-06-04 02:52:23] [INFO ] Added : 145 causal constraints over 29 iterations in 290 ms. Result :sat
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 53 places in 94 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2020-06-04 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 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 124 ms returned sat
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 48 places in 41 ms
[2020-06-04 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2020-06-04 02:52:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 48 places in 63 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2020-06-04 02:52:24] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 13 ms.
[2020-06-04 02:52:24] [INFO ] Added : 145 causal constraints over 29 iterations in 443 ms. Result :sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 73 places in 79 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 73 places in 62 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 85 places in 53 ms
[2020-06-04 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 476 ms
[2020-06-04 02:52:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 71 places in 52 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 73 places in 72 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 85 places in 71 ms
[2020-06-04 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 380 ms
[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 ] Added : 145 causal constraints over 29 iterations in 700 ms. Result :sat
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 65 places in 158 ms
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 48 places in 88 ms
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 79 places in 75 ms
[2020-06-04 02:52:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 392 ms
[2020-06-04 02:52:27] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:27] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 12 ms returned sat
[2020-06-04 02:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:27] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 45 places in 57 ms
[2020-06-04 02:52:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 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 18 ms returned sat
[2020-06-04 02:52:27] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 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 140 ms returned sat
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 39 places in 48 ms
[2020-06-04 02:52:27] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2020-06-04 02:52:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2020-06-04 02:52:27] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-06-04 02:52:28] [INFO ] Added : 140 causal constraints over 28 iterations in 435 ms. Result :sat
[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 14 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 243 ms returned sat
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 48 places in 85 ms
[2020-06-04 02:52:28] [INFO ] Deduced a trap composed of 18 places in 59 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2020-06-04 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 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 32 ms returned sat
[2020-06-04 02:52:29] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 241 ms returned sat
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-06-04 02:52:29] [INFO ] Deduced a trap composed of 45 places in 52 ms
[2020-06-04 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2020-06-04 02:52:29] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 ms.
[2020-06-04 02:52:30] [INFO ] Added : 108 causal constraints over 22 iterations in 405 ms. Result :sat
[2020-06-04 02:52:30] [INFO ] Deduced a trap composed of 24 places in 75 ms
[2020-06-04 02:52:30] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-04 02:52:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 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 58 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 221 ms returned sat
[2020-06-04 02:52:30] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 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 47 ms returned sat
[2020-06-04 02:52:30] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 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 130 ms returned sat
[2020-06-04 02:52:30] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:31] [INFO ] Added : 145 causal constraints over 29 iterations in 429 ms. Result :sat
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 24 places in 99 ms
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-06-04 02:52:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2020-06-04 02:52:31] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:31] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:31] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 53 places in 74 ms
[2020-06-04 02:52:31] [INFO ] Deduced a trap composed of 47 places in 128 ms
[2020-06-04 02:52:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2020-06-04 02:52:31] [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 29 ms returned sat
[2020-06-04 02:52:32] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 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 181 ms returned sat
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 57 places in 79 ms
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 56 places in 56 ms
[2020-06-04 02:52:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2020-06-04 02:52:32] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:32] [INFO ] Added : 143 causal constraints over 29 iterations in 420 ms. Result :sat
[2020-06-04 02:52:32] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 68 places in 69 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 25 places in 68 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 29 places in 78 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 75 places in 68 ms
[2020-06-04 02:52:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 580 ms
[2020-06-04 02:52:33] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 02:52:33] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 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 116 ms returned sat
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 45 places in 88 ms
[2020-06-04 02:52:33] [INFO ] Deduced a trap composed of 64 places in 72 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 42 places in 72 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 64 places in 99 ms
[2020-06-04 02:52:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 480 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 24 ms returned sat
[2020-06-04 02:52:34] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 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 16 places in 146 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 45 places in 102 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 56 places in 76 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 62 places in 84 ms
[2020-06-04 02:52:34] [INFO ] Deduced a trap composed of 56 places in 76 ms
[2020-06-04 02:52:35] [INFO ] Deduced a trap composed of 71 places in 578 ms
[2020-06-04 02:52:35] [INFO ] Deduced a trap composed of 64 places in 57 ms
[2020-06-04 02:52:35] [INFO ] Deduced a trap composed of 69 places in 231 ms
[2020-06-04 02:52:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1455 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:36] [INFO ] Added : 145 causal constraints over 29 iterations in 659 ms. Result :sat
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2020-06-04 02:52:36] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2020-06-04 02:52:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2020-06-04 02:52:36] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:36] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 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 123 ms returned sat
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 16 places in 146 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 45 places in 88 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 64 places in 83 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 42 places in 70 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 64 places in 66 ms
[2020-06-04 02:52:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 493 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 15 ms returned sat
[2020-06-04 02:52:37] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 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 117 ms returned sat
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 45 places in 70 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 56 places in 70 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 62 places in 106 ms
[2020-06-04 02:52:37] [INFO ] Deduced a trap composed of 56 places in 92 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 71 places in 67 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 64 places in 66 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 69 places in 78 ms
[2020-06-04 02:52:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 734 ms
[2020-06-04 02:52:38] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:38] [INFO ] Added : 145 causal constraints over 29 iterations in 419 ms. Result :sat
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2020-06-04 02:52:38] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-04 02:52:39] [INFO ] Deduced a trap composed of 37 places in 483 ms
[2020-06-04 02:52:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
[2020-06-04 02:52:39] [INFO ] [Real]Absence check using 5 positive place invariants in 53 ms returned sat
[2020-06-04 02:52:39] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 104 ms returned sat
[2020-06-04 02:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:39] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-04 02:52:39] [INFO ] Deduced a trap composed of 60 places in 67 ms
[2020-06-04 02:52:39] [INFO ] Deduced a trap composed of 57 places in 60 ms
[2020-06-04 02:52:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2020-06-04 02:52:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:40] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:40] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-06-04 02:52:40] [INFO ] Deduced a trap composed of 60 places in 105 ms
[2020-06-04 02:52:40] [INFO ] Deduced a trap composed of 57 places in 75 ms
[2020-06-04 02:52:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2020-06-04 02:52:40] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:40] [INFO ] Added : 143 causal constraints over 29 iterations in 453 ms. Result :sat
[2020-06-04 02:52:40] [INFO ] [Real]Absence check using 5 positive place invariants in 53 ms returned sat
[2020-06-04 02:52:40] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 105 ms returned sat
[2020-06-04 02:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:41] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 73 places in 141 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 67 places in 93 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 74 places in 102 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 53 places in 87 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 74 places in 103 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 82 places in 103 ms
[2020-06-04 02:52:41] [INFO ] Deduced a trap composed of 79 places in 115 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 82 places in 106 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 85 places in 104 ms
[2020-06-04 02:52:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1041 ms
[2020-06-04 02:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:52:42] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:42] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 73 places in 69 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 58 places in 73 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 74 places in 84 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2020-06-04 02:52:42] [INFO ] Deduced a trap composed of 76 places in 107 ms
[2020-06-04 02:52:43] [INFO ] Deduced a trap composed of 76 places in 123 ms
[2020-06-04 02:52:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 718 ms
[2020-06-04 02:52:43] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:43] [INFO ] Added : 140 causal constraints over 28 iterations in 426 ms. Result :sat
[2020-06-04 02:52:43] [INFO ] Deduced a trap composed of 80 places in 73 ms
[2020-06-04 02:52:43] [INFO ] Deduced a trap composed of 74 places in 83 ms
[2020-06-04 02:52:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 02:52:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 02:52:43] [INFO ] Flatten gal took : 81 ms
FORMULA DoubleExponent-PT-003-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:52:43] [INFO ] Flatten gal took : 17 ms
[2020-06-04 02:52:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-04 02:52:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-003 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3454
rslt: Output for LTLFireability @ 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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:52:44 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 346
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"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": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((X (X ((1 <= p86))) OR (((1 <= p66) AND (1 <= p159)) OR (1 <= p86))))",
"processed_size": 72,
"rewrites": 77
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X ((F ((1 <= p131)) AND F (((1 <= p115) AND (1 <= p136))))) OR F (((1 <= p9) AND (1 <= p158)))))",
"processed_size": 100,
"rewrites": 77
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 577
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p53 <= 0) R X (X (X (G (((p3 <= 0) OR (p120 <= 0))))))) U ((1 <= p59) AND (1 <= p115)))",
"processed_size": 91,
"rewrites": 77
},
"result":
{
"edges": 184,
"markings": 175,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 866
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "G (F ((p148 <= 0)))",
"processed_size": 19,
"rewrites": 77
},
"result":
{
"edges": 2644419,
"markings": 2390248,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "F (G ((((p78 <= 0) OR (p87 <= 0)) AND (p140 <= 0))))",
"processed_size": 53,
"rewrites": 77
},
"result":
{
"edges": 2702567,
"markings": 2416734,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3454
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F ((p77 <= 0)) U (((1 <= p59) AND (1 <= p115)) U (((1 <= p59) AND (1 <= p115)) OR (G (((1 <= p132) AND (1 <= p159))) AND F (((1 <= p59) AND (1 <= p115)))))))",
"processed_size": 158,
"rewrites": 77
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30864,
"runtime": 116.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G((F(**) AND (** OR **))) OR (G(**) OR X(F(**))))) : F(G(*)) : (G(F((F(G(**)) AND (** AND **)))) AND X(X(X(**)))) : F((X((* R *)) AND (G((X(**) AND *)) R *))) : (F(*) U (** U (** OR (G(**) AND F(**))))) : G(F(*)) : (X((X(X(**)) OR (** OR **))) OR (G(*) AND (** AND **))) : G((X(G(*)) AND *)) : ((G(F(*)) AND (** AND **)) U X(F(**))) : F((X((F(*) AND F(**))) OR F(**))) : G(F((G(**) AND (** AND **)))) : ((* R X(X(X(G(*))))) U **) : F((X((X(**) AND (** AND **))) AND (** AND **)))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "no yes no yes no yes no no no no no no no ",
"value": "no yes no yes no yes no no no 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 LTLFireability.xml
lola: (X ((G ((((1 <= p66) AND (1 <= p151)) U (1 <= p134))) OR G ((1 <= p134)))) OR X (X (F (((1 <= p66) AND (1 <= p151)))))) : NOT(G (F ((((1 <= p78) AND (1 <= p87)) OR (1 <= p140))))) : (G (F (((X (X (G (F (G ((1 <= p86)))))) AND (1 <= p129)) AND (1 <= p138)))) AND X (X (X ((1 <= p150))))) : NOT(G ((X (((1 <= p119) U ((1 <= p8) AND (1 <= p107)))) OR (F ((NOT(X (((1 <= p8) AND (1 <= p107)))) OR (p92 <= 0))) U (1 <= p92))))) : (NOT(G ((1 <= p77))) U (((1 <= p59) AND (1 <= p115)) U (G (((1 <= p132) AND (1 <= p159))) U ((1 <= p59) AND (1 <= p115))))) : X (NOT((X ((F (((1 <= p116) AND (1 <= p143))) U X (((1 <= p116) AND (1 <= p143))))) U G (F (G ((1 <= p148))))))) : (X (((X (X ((1 <= p86))) OR ((1 <= p66) AND (1 <= p159))) OR (1 <= p86))) OR ((NOT(F ((1 <= p157))) AND (1 <= p59)) AND (1 <= p115))) : NOT(F ((F (X (((p96 <= 0) U (p150 <= 0)))) OR (1 <= p125)))) : (((((1 <= p79) U G (NOT(G (((p64 <= 0) OR (p146 <= 0)))))) AND (1 <= p64)) AND (1 <= p146)) U F (X (((1 <= p1) AND (1 <= p84))))) : F ((X ((NOT(G ((p131 <= 0))) AND F (((1 <= p115) AND (1 <= p136))))) OR F (((1 <= p9) AND (1 <= p158))))) : F (G (F (G (F (((G ((1 <= p77)) AND (1 <= p129)) AND (1 <= p146))))))) : (NOT(((1 <= p53) U NOT(X (G (NOT(X (X (((1 <= p3) AND (1 <= p120)))))))))) U ((1 <= p59) AND (1 <= p115))) : F (((X (((X ((1 <= p150)) AND (1 <= p12)) AND (1 <= p88))) AND (1 <= p12)) AND (1 <= p88)))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((F ((1 <= p134)) AND (((1 <= p66) AND (1 <= p151)) OR (1 <= p134)))) OR (G ((1 <= p134)) OR X (F (((1 <= p66) AND (1 <= p151)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F ((1 <= p134)) AND (((1 <= p66) AND (1 <= p151)) OR (1 <= p134)))) OR (G ((1 <= p134)) OR X (F (((1 <= p66) AND (1 <= p151)))))))
lola: processed formula length: 138
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F (G ((1 <= p86))) AND ((1 <= p129) AND (1 <= p138))))) AND X (X (X ((1 <= p150)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((1 <= p86))) AND ((1 <= p129) AND (1 <= p138)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((1 <= p86))) AND ((1 <= p129) AND (1 <= p138)))))
lola: processed formula length: 62
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p119 <= 0) R ((p8 <= 0) OR (p107 <= 0)))) AND (G ((X (((1 <= p8) AND (1 <= p107))) AND (1 <= p92))) R (p92 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p119 <= 0) R ((p8 <= 0) OR (p107 <= 0)))) AND (G ((X (((1 <= p8) AND (1 <= p107))) AND (1 <= p92))) R (p92 <= 0))))
lola: processed formula length: 125
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 25 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 866542 markings, 2830795 edges, 173308 markings/sec, 0 secs
lola: 1870362 markings, 6114713 edges, 200764 markings/sec, 5 secs
lola: 2905671 markings, 9500265 edges, 207062 markings/sec, 10 secs
lola: 3982653 markings, 13022745 edges, 215396 markings/sec, 15 secs
lola: 5056992 markings, 16538158 edges, 214868 markings/sec, 20 secs
lola: 6075066 markings, 19868003 edges, 203615 markings/sec, 25 secs
lola: 6952260 markings, 22736770 edges, 175439 markings/sec, 30 secs
lola: 7953584 markings, 26013711 edges, 200265 markings/sec, 35 secs
lola: 8927564 markings, 29202860 edges, 194796 markings/sec, 40 secs
lola: 9918171 markings, 32442196 edges, 198121 markings/sec, 45 secs
lola: 10996752 markings, 35969871 edges, 215716 markings/sec, 50 secs
lola: 12073301 markings, 39490077 edges, 215310 markings/sec, 55 secs
lola: 13166532 markings, 43067181 edges, 218646 markings/sec, 60 secs
lola: 14163499 markings, 46329084 edges, 199393 markings/sec, 65 secs
lola: 15264928 markings, 49933359 edges, 220286 markings/sec, 70 secs
lola: 16362301 markings, 53523800 edges, 219475 markings/sec, 75 secs
lola: 17471178 markings, 57154872 edges, 221775 markings/sec, 80 secs
lola: 18576459 markings, 60771107 edges, 221056 markings/sec, 85 secs
lola: 19569897 markings, 64117236 edges, 198688 markings/sec, 90 secs
lola: 20560677 markings, 67577719 edges, 198156 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 20766791 markings, 68300512 edges
lola: ========================================
lola: subprocess 3 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X ((1 <= p86))) OR (((1 <= p66) AND (1 <= p159)) OR (1 <= p86)))) OR (G ((p157 <= 0)) AND ((1 <= p59) AND (1 <= p115))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p59) AND (1 <= p115))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p59) AND (1 <= p115))
lola: processed formula length: 28
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((1 <= p86))) OR (((1 <= p66) AND (1 <= p159)) OR (1 <= p86))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((1 <= p86))) OR (((1 <= p66) AND (1 <= p159)) OR (1 <= p86))))
lola: processed formula length: 72
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((1 <= p150))) AND (p125 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((1 <= p150))) AND (p125 <= 0)))
lola: processed formula length: 41
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F (((1 <= p64) AND (1 <= p146)))) AND ((1 <= p64) AND (1 <= p146))) U X (F (((1 <= p1) AND (1 <= p84)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F (((1 <= p64) AND (1 <= p146)))) AND ((1 <= p64) AND (1 <= p146))) U X (F (((1 <= p1) AND (1 <= p84)))))
lola: processed formula length: 110
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: subprocess 6 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((F ((1 <= p131)) AND F (((1 <= p115) AND (1 <= p136))))) OR F (((1 <= p9) AND (1 <= p158)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((F ((1 <= p131)) AND F (((1 <= p115) AND (1 <= p136))))) OR F (((1 <= p9) AND (1 <= p158)))))
lola: processed formula length: 100
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p53 <= 0) R X (X (X (G (((p3 <= 0) OR (p120 <= 0))))))) U ((1 <= p59) AND (1 <= p115)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p53 <= 0) R X (X (X (G (((p3 <= 0) OR (p120 <= 0))))))) U ((1 <= p59) AND (1 <= p115)))
lola: processed formula length: 91
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 175 markings, 184 edges
lola: ========================================
lola: subprocess 8 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((X ((1 <= p150)) AND ((1 <= p12) AND (1 <= p88)))) AND ((1 <= p12) AND (1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((X ((1 <= p150)) AND ((1 <= p12) AND (1 <= p88)))) AND ((1 <= p12) AND (1 <= p88))))
lola: processed formula length: 91
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p148 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p148 <= 0)))
lola: processed formula length: 19
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2075120 markings, 2295177 edges, 415024 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2390248 markings, 2644419 edges
lola: ========================================
lola: subprocess 10 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p78 <= 0) OR (p87 <= 0)) AND (p140 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p78 <= 0) OR (p87 <= 0)) AND (p140 <= 0))))
lola: processed formula length: 53
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2322051 markings, 2595952 edges, 464410 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2416734 markings, 2702567 edges
lola: ========================================
lola: subprocess 11 will run for 1727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p77)) AND ((1 <= p129) AND (1 <= p146)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p77)) AND ((1 <= p129) AND (1 <= p146)))))
lola: processed formula length: 58
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 30 edges
lola: ========================================
lola: subprocess 12 will run for 3454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p77 <= 0)) U (((1 <= p59) AND (1 <= p115)) U (((1 <= p59) AND (1 <= p115)) OR (G (((1 <= p132) AND (1 <= p159))) AND F (((1 <= p59) AND (1 <= p115)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p77 <= 0)) U (((1 <= p59) AND (1 <= p115)) U (((1 <= p59) AND (1 <= p115)) OR (G (((1 <= p132) AND (1 <= p159))) AND F (((1 <= p59) AND (1 <= p115)))))))
lola: processed formula length: 158
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no yes no no no no no no no
lola:
preliminary result: no yes no yes no yes no no no no no no no
lola: memory consumption: 30864 KB
lola: time consumption: 116 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882800762"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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