Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900482.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15

=== Now, execution of the tool begins

BK_START 1591157664179

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:14:25] [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-03 04:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:14:25] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-06-03 04:14:25] [INFO ] Transformed 368 places.
[2020-06-03 04:14:25] [INFO ] Transformed 319 transitions.
[2020-06-03 04:14:25] [INFO ] Found NUPN structural information;
[2020-06-03 04:14:25] [INFO ] Parsed PT model containing 368 places and 319 transitions in 114 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 946 resets, run finished after 259 ms. (steps per millisecond=386 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 318 rows 367 cols
[2020-06-03 04:14:26] [INFO ] Computed 57 place invariants in 26 ms
[2020-06-03 04:14:26] [INFO ] [Real]Absence check using 41 positive place invariants in 46 ms returned sat
[2020-06-03 04:14:26] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2020-06-03 04:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:14:26] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 16 places in 307 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 8 places in 124 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 23 places in 106 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 91 places in 119 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 31 places in 79 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 88 places in 95 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 83 places in 92 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 13 places in 234 ms
[2020-06-03 04:14:29] [INFO ] Deduced a trap composed of 14 places in 730 ms
[2020-06-03 04:14:29] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-06-03 04:14:30] [INFO ] Deduced a trap composed of 22 places in 501 ms
[2020-06-03 04:14:30] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2020-06-03 04:14:33] [INFO ] Deduced a trap composed of 18 places in 2474 ms
[2020-06-03 04:14:33] [INFO ] Deduced a trap composed of 23 places in 404 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 38 places in 1667 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 56 places in 119 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 51 places in 123 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 48 places in 86 ms
[2020-06-03 04:14:37] [INFO ] Deduced a trap composed of 37 places in 2137 ms
[2020-06-03 04:14:37] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10987 ms
[2020-06-03 04:14:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:14:38] [INFO ] [Nat]Absence check using 41 positive place invariants in 320 ms returned sat
[2020-06-03 04:14:38] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 105 ms returned sat
[2020-06-03 04:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:14:40] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2020-06-03 04:14:40] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2020-06-03 04:14:40] [INFO ] Deduced a trap composed of 8 places in 356 ms
[2020-06-03 04:14:41] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-06-03 04:14:41] [INFO ] Deduced a trap composed of 13 places in 821 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 18 places in 122 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 23 places in 138 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 14 places in 582 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 38 places in 138 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 40 places in 97 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 44 places in 82 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 23 places in 76 ms
[2020-06-03 04:14:45] [INFO ] Deduced a trap composed of 46 places in 2214 ms
[2020-06-03 04:14:46] [INFO ] Deduced a trap composed of 48 places in 771 ms
[2020-06-03 04:14:46] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 19 places in 4407 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 53 places in 99 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 23 places in 259 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 45 places in 83 ms
[2020-06-03 04:14:52] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-06-03 04:14:53] [INFO ] Deduced a trap composed of 30 places in 1889 ms
[2020-06-03 04:14:54] [INFO ] Deduced a trap composed of 29 places in 109 ms
[2020-06-03 04:14:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13801 ms
[2020-06-03 04:14:54] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 36 ms.
[2020-06-03 04:14:55] [INFO ] Added : 212 causal constraints over 43 iterations in 1672 ms. Result :sat
[2020-06-03 04:14:55] [INFO ] [Real]Absence check using 41 positive place invariants in 28 ms returned sat
[2020-06-03 04:14:56] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 113 ms returned sat
[2020-06-03 04:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:14:57] [INFO ] [Real]Absence check using state equation in 1780 ms returned sat
[2020-06-03 04:14:57] [INFO ] Deduced a trap composed of 9 places in 164 ms
[2020-06-03 04:14:58] [INFO ] Deduced a trap composed of 17 places in 595 ms
[2020-06-03 04:14:58] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 04:14:58] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-06-03 04:14:58] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2020-06-03 04:14:58] [INFO ] Deduced a trap composed of 89 places in 79 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 26 places in 51 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 35 places in 49 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 25 places in 237 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 28 places in 50 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 31 places in 47 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 04:14:59] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 94 places in 80 ms
[2020-06-03 04:15:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2318 ms
[2020-06-03 04:15:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:00] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:00] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:00] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2020-06-03 04:15:00] [INFO ] Deduced a trap composed of 29 places in 119 ms
[2020-06-03 04:15:01] [INFO ] Deduced a trap composed of 29 places in 989 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 12 places in 67 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 91 places in 68 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 92 places in 67 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 95 places in 64 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 50 places in 69 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-06-03 04:15:02] [INFO ] Deduced a trap composed of 19 places in 105 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 96 places in 85 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 94 places in 61 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-06-03 04:15:03] [INFO ] Deduced a trap composed of 20 places in 38 ms
[2020-06-03 04:15:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3104 ms
[2020-06-03 04:15:03] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 15 ms.
[2020-06-03 04:15:04] [INFO ] Added : 236 causal constraints over 48 iterations in 1144 ms. Result :sat
[2020-06-03 04:15:04] [INFO ] Deduced a trap composed of 94 places in 72 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 92 places in 74 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 96 places in 70 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 100 places in 71 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 93 places in 68 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 92 places in 79 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 88 places in 68 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 88 places in 78 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 93 places in 66 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 94 places in 68 ms
[2020-06-03 04:15:05] [INFO ] Deduced a trap composed of 98 places in 68 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 96 places in 67 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 98 places in 68 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 100 places in 76 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 100 places in 65 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 94 places in 64 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 95 places in 65 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 96 places in 60 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 95 places in 59 ms
[2020-06-03 04:15:06] [INFO ] Deduced a trap composed of 97 places in 65 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 95 places in 67 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 94 places in 63 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 98 places in 63 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 20 places in 66 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 101 places in 64 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 91 places in 74 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 100 places in 65 ms
[2020-06-03 04:15:07] [INFO ] Deduced a trap composed of 98 places in 61 ms
[2020-06-03 04:15:07] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3123 ms
[2020-06-03 04:15:08] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-06-03 04:15:08] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2020-06-03 04:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:08] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 86 places in 75 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-06-03 04:15:08] [INFO ] Deduced a trap composed of 15 places in 73 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 85 places in 74 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 91 places in 87 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 90 places in 73 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 90 places in 75 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 38 places in 77 ms
[2020-06-03 04:15:09] [INFO ] Deduced a trap composed of 36 places in 75 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 25 places in 76 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 96 places in 75 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 29 places in 73 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 88 places in 76 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 99 places in 73 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 93 places in 86 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 96 places in 72 ms
[2020-06-03 04:15:10] [INFO ] Deduced a trap composed of 93 places in 85 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 97 places in 86 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 93 places in 348 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 91 places in 72 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 101 places in 83 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 97 places in 75 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 99 places in 73 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 96 places in 81 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 37 places in 84 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 99 places in 72 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 94 places in 70 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 86 places in 73 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 83 places in 70 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 18 places in 70 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 91 places in 82 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 89 places in 71 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 96 places in 70 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 90 places in 61 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 94 places in 75 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 91 places in 71 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 95 places in 59 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 96 places in 59 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 91 places in 59 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 97 places in 59 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 94 places in 74 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 97 places in 57 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 93 places in 58 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 92 places in 58 ms
[2020-06-03 04:15:14] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 5820 ms
[2020-06-03 04:15:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:14] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:14] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 19 places in 83 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 18 places in 89 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 39 places in 87 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 91 places in 87 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 35 places in 109 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 92 places in 72 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 92 places in 68 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 90 places in 78 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 92 places in 84 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 98 places in 73 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 98 places in 79 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 90 places in 85 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 92 places in 98 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 90 places in 70 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 93 places in 67 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 96 places in 83 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 94 places in 91 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 93 places in 100 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 94 places in 68 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 96 places in 65 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 94 places in 80 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 99 places in 94 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 90 places in 69 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 94 places in 67 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 91 places in 68 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 95 places in 94 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 47 places in 86 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 93 places in 62 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 94 places in 73 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 93 places in 82 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 88 places in 67 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 88 places in 77 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 89 places in 70 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 88 places in 67 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 93 places in 77 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 92 places in 78 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 92 places in 65 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 12 places in 80 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 87 places in 63 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 41 places in 72 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 38 places in 69 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 95 places in 68 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 92 places in 68 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 95 places in 72 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 97 places in 62 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 91 places in 73 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 90 places in 72 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 91 places in 64 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 93 places in 71 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 92 places in 64 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 94 places in 78 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 88 places in 64 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 91 places in 84 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 93 places in 91 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 93 places in 59 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 95 places in 68 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 90 places in 62 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 88 places in 58 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 88 places in 66 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 90 places in 62 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 100 places in 67 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 105 places in 66 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 88 places in 64 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 53 places in 65 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 56 places in 64 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 112 places in 69 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 20 places in 65 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 89 places in 66 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 95 places in 67 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 103 places in 65 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 91 places in 64 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 25 places in 64 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 92 places in 61 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 95 places in 64 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 89 places in 66 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 90 places in 66 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 92 places in 76 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 90 places in 67 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 95 places in 66 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 83 places in 73 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 83 places in 66 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 85 places in 67 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 87 places in 61 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 90 places in 75 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 85 places in 75 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 81 places in 78 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 94 places in 75 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 88 places in 67 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 87 places in 75 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 85 places in 77 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 88 places in 79 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 90 places in 97 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 89 places in 74 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 59 places in 79 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 99 places in 62 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 93 places in 68 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 93 places in 66 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 83 places in 81 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 94 places in 62 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 98 places in 62 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 85 places in 62 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 99 places in 68 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 92 places in 62 ms
[2020-06-03 04:15:27] [INFO ] Deduced a trap composed of 91 places in 73 ms
[2020-06-03 04:15:27] [INFO ] Deduced a trap composed of 88 places in 57 ms
[2020-06-03 04:15:27] [INFO ] Deduced a trap composed of 93 places in 68 ms
[2020-06-03 04:15:27] [INFO ] Trap strengthening (SAT) tested/added 147/146 trap constraints in 12774 ms
[2020-06-03 04:15:27] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-06-03 04:15:28] [INFO ] Added : 187 causal constraints over 38 iterations in 954 ms. Result :sat
[2020-06-03 04:15:28] [INFO ] [Real]Absence check using 41 positive place invariants in 37 ms returned sat
[2020-06-03 04:15:28] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:28] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-06-03 04:15:28] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-06-03 04:15:28] [INFO ] Deduced a trap composed of 19 places in 110 ms
[2020-06-03 04:15:28] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 19 places in 104 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 23 places in 89 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 19 places in 85 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2020-06-03 04:15:29] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 25 places in 89 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 94 places in 86 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 95 places in 85 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 92 places in 78 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 91 places in 85 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 90 places in 131 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 93 places in 88 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2020-06-03 04:15:30] [INFO ] Deduced a trap composed of 94 places in 82 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 99 places in 83 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 91 places in 83 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 100 places in 82 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 96 places in 91 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 101 places in 91 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 94 places in 82 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 92 places in 90 ms
[2020-06-03 04:15:31] [INFO ] Deduced a trap composed of 94 places in 76 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 94 places in 81 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 94 places in 80 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 107 places in 74 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 95 places in 73 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 97 places in 71 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 96 places in 70 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 97 places in 68 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 95 places in 75 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 98 places in 70 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 99 places in 76 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 91 places in 85 ms
[2020-06-03 04:15:32] [INFO ] Deduced a trap composed of 96 places in 74 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 96 places in 72 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 93 places in 67 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 100 places in 73 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 95 places in 69 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 98 places in 73 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 98 places in 71 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 93 places in 89 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 94 places in 85 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-06-03 04:15:33] [INFO ] Deduced a trap composed of 100 places in 78 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 95 places in 69 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 98 places in 72 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 99 places in 64 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 94 places in 91 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 96 places in 62 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 105 places in 60 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 101 places in 73 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 103 places in 59 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 104 places in 61 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 88 places in 62 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 91 places in 58 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 85 places in 58 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 85 places in 58 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 86 places in 58 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 89 places in 58 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 85 places in 56 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 89 places in 60 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 89 places in 58 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 89 places in 58 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 93 places in 56 ms
[2020-06-03 04:15:35] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 6890 ms
[2020-06-03 04:15:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:35] [INFO ] [Nat]Absence check using 41 positive place invariants in 52 ms returned sat
[2020-06-03 04:15:35] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:35] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 28 places in 69 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 25 places in 68 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 94 places in 69 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 95 places in 67 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 91 places in 67 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 90 places in 69 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 93 places in 67 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 94 places in 68 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 92 places in 68 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 91 places in 71 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 93 places in 71 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 91 places in 64 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 90 places in 77 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 98 places in 67 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 103 places in 66 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 105 places in 68 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 93 places in 62 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 99 places in 66 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 32 places in 64 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 94 places in 62 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 97 places in 64 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 104 places in 61 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 32 places in 63 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 34 places in 60 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 28 places in 61 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 89 places in 66 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 92 places in 58 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 23 places in 61 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 83 places in 61 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 96 places in 74 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 101 places in 68 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 101 places in 72 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 90 places in 70 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 86 places in 60 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 95 places in 62 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 89 places in 65 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 92 places in 64 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 88 places in 60 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 95 places in 60 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 91 places in 58 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 97 places in 62 ms
[2020-06-03 04:15:41] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-06-03 04:15:41] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 5176 ms
[2020-06-03 04:15:41] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-06-03 04:15:41] [INFO ] Added : 196 causal constraints over 40 iterations in 879 ms. Result :sat
[2020-06-03 04:15:41] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2020-06-03 04:15:41] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:42] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 26 places in 44 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 23 places in 44 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 32 places in 44 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 32 places in 41 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 53 places in 39 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 56 places in 37 ms
[2020-06-03 04:15:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 684 ms
[2020-06-03 04:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:43] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2020-06-03 04:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:43] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 34 places in 50 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 25 places in 42 ms
[2020-06-03 04:15:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 371 ms
[2020-06-03 04:15:43] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-06-03 04:15:44] [INFO ] Added : 185 causal constraints over 38 iterations in 757 ms. Result :sat
[2020-06-03 04:15:44] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-06-03 04:15:44] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:44] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-06-03 04:15:44] [INFO ] Deduced a trap composed of 86 places in 64 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 13 places in 66 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 39 places in 77 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2020-06-03 04:15:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 941 ms
[2020-06-03 04:15:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:45] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:45] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-06-03 04:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:46] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 13 places in 69 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 58 places in 37 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 32 places in 36 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 46 places in 39 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 40 places in 36 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 14 places in 24 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 27 places in 17 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 26 places in 20 ms
[2020-06-03 04:15:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1139 ms
[2020-06-03 04:15:47] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 15 ms.
[2020-06-03 04:15:48] [INFO ] Added : 209 causal constraints over 43 iterations in 926 ms. Result :sat
[2020-06-03 04:15:48] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2020-06-03 04:15:48] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2020-06-03 04:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:48] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 13 places in 75 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 26 places in 47 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 21 places in 44 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 19 places in 45 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 21 places in 44 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 25 places in 45 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 34 places in 49 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 27 places in 42 ms
[2020-06-03 04:15:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 953 ms
[2020-06-03 04:15:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:49] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-06-03 04:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:49] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 13 places in 92 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 14 places in 44 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 31 places in 49 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 36 places in 42 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 32 places in 41 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 23 places in 40 ms
[2020-06-03 04:15:51] [INFO ] Deduced a trap composed of 35 places in 42 ms
[2020-06-03 04:15:51] [INFO ] Deduced a trap composed of 21 places in 30 ms
[2020-06-03 04:15:51] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2020-06-03 04:15:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1229 ms
[2020-06-03 04:15:51] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-06-03 04:15:52] [INFO ] Added : 205 causal constraints over 42 iterations in 949 ms. Result :sat
[2020-06-03 04:15:52] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-06-03 04:15:52] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:52] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 21 places in 67 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 43 places in 77 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 35 places in 62 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 39 places in 63 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 28 places in 66 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 33 places in 70 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 15 places in 61 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 47 places in 61 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 32 places in 73 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 47 places in 43 ms
[2020-06-03 04:15:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1527 ms
[2020-06-03 04:15:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:54] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2020-06-03 04:15:54] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:54] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 43 places in 68 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 19 places in 81 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 89 places in 65 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 35 places in 67 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 39 places in 60 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 46 places in 42 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 31 places in 40 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 44 places in 42 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2020-06-03 04:15:55] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1413 ms
[2020-06-03 04:15:55] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 14 ms.
[2020-06-03 04:15:56] [INFO ] Added : 188 causal constraints over 39 iterations in 801 ms. Result :sat
[2020-06-03 04:15:56] [INFO ] [Real]Absence check using 41 positive place invariants in 36 ms returned sat
[2020-06-03 04:15:56] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 04:15:56] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 04:15:56] [INFO ] Flatten gal took : 55 ms
FORMULA BusinessProcesses-PT-05-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:15:56] [INFO ] Applying decomposition
[2020-06-03 04:15:56] [INFO ] Flatten gal took : 22 ms
[2020-06-03 04:15:56] [INFO ] Decomposing Gal with order
[2020-06-03 04:15:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 04:15:56] [INFO ] Flatten gal took : 76 ms
[2020-06-03 04:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2020-06-03 04:15:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-03 04:15:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-05 @ 3570 seconds

FORMULA BusinessProcesses-PT-05-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1980
rslt: Output for LTLFireability @ BusinessProcesses-PT-05

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((G (((p310 <= 0))) OR (((p24 <= 0)) AND ((p310 <= 0))))))",
"processed_size": 63,
"rewrites": 93
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((X (((1 <= p149))) OR ((1 <= p149)))) AND ((p105 <= 0)))))",
"processed_size": 68,
"rewrites": 93
},
"result":
{
"edges": 134,
"markings": 125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (F (((F (((1 <= p117))) U G ((F (((1 <= p303))) AND (((1 <= p106) AND (1 <= p244) AND (1 <= p350)) OR ((1 <= p303)))))) OR ((1 <= p117))))) AND G (((1 <= p117)))))",
"processed_size": 169,
"rewrites": 93
},
"result":
{
"edges": 210,
"markings": 210,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G ((X (((1 <= p100) AND (1 <= p204) AND (p346 <= 1) AND (1 <= p346))) AND (((1 <= p35)) AND ((1 <= p306))))) AND (((1 <= p170)) AND (((1 <= p100)) AND (((1 <= p204)) AND ((p346 <= 1) AND (1 <= p346)))))))",
"processed_size": 208,
"rewrites": 93
},
"result":
{
"edges": 210,
"markings": 210,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 535
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))) OR (G (((p4 <= 0))) AND F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))))))",
"processed_size": 128,
"rewrites": 93
},
"result":
{
"edges": 162,
"markings": 143,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (G (((p185 <= 0) OR ((1 <= p73) AND (1 <= p209) AND (1 <= p324))))) U (X (((p241 <= 0))) AND (((1 <= p73)) AND (((1 <= p209)) AND ((1 <= p324))))))",
"processed_size": 151,
"rewrites": 93
},
"result":
{
"edges": 212,
"markings": 212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 802
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p318))))",
"processed_size": 21,
"rewrites": 93
},
"result":
{
"edges": 92,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1070
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"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": "(((1 <= p227)) U G (((p275 <= 0))))",
"processed_size": 35,
"rewrites": 93
},
"result":
{
"edges": 318,
"markings": 282,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3209
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((G (((p302 <= 0))) OR ((1 <= p44) AND (1 <= p174) AND (1 <= p298)))) OR (F (((p133 <= 0))) AND ((p302 <= 0)))))",
"processed_size": 118,
"rewrites": 93
},
"result":
{
"edges": 275,
"markings": 259,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"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": 3468,
"runtime": 1590.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G((G(*) OR **)) OR (F(*) AND **))) : (X(F((G(*) OR (* AND *)))) AND (* R F((X(*) OR *)))) : G(F((X((X(**) OR **)) AND **))) : G((X(F((* AND (F(*) OR G(*))))) OR (** OR (G(**) AND F((X(F((* AND (F(*) OR G(*))))) OR **)))))) : (** U G(**)) : X((F((G(**) AND X(**))) AND X(G((G(*) AND (** AND (** AND **))))))) : X((X(F(((F(**) U G((F(**) AND (** OR **)))) OR **))) AND G(**))) : X((G((X(**) AND (** AND **))) AND (** AND (** AND (** AND **))))) : X((F(**) OR (G(**) AND F(**)))) : F(G(**)) : G(F((F(**) OR **))) : (X(G(**)) U (X(*) AND (** AND (** AND **))))"
},
"net":
{
"arcs": 852,
"conflict_clusters": 289,
"places": 367,
"places_significant": 310,
"singleton_clusters": 0,
"transitions": 318
},
"result":
{
"preliminary_value": "no yes no unknown no no no no no no no no ",
"value": "no yes no unknown no 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: 685/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 367
lola: finding significant places
lola: 367 places, 318 transitions, 310 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p319 <= 1)
lola: LP says that atomic proposition is always true: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p319 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p366 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: G ((G ((G (NOT(F (((1 <= p302))))) OR ((1 <= p44) AND (1 <= p174) AND (1 <= p298)))) OR (NOT(G (((1 <= p133)))) AND ((p302 <= 0))))) : (NOT(X (G ((((1 <= p24)) U ((1 <= p310)))))) AND NOT((((1 <= p281)) U G ((X (((1 <= p281))) AND ((1 <= p310))))))) : NOT(F (NOT(X (G (F ((X ((X (((1 <= p149))) OR ((1 <= p149)))) AND ((p105 <= 0))))))))) : G ((G (((1 <= p288))) U (F (X (F (NOT((G (((1 <= p5))) U ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))))) OR ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))) : (((1 <= p227)) U G (((p275 <= 0)))) : X ((F ((G (((1 <= p68) AND (1 <= p219) AND (1 <= p319))) AND X (((1 <= p348))))) AND G (X ((((NOT(F (((1 <= p323)))) AND ((1 <= p68))) AND ((1 <= p219))) AND ((1 <= p319))))))) : X ((X (F (((F (((1 <= p117))) U G ((((1 <= p106) AND (1 <= p244) AND (1 <= p350)) U ((1 <= p303))))) OR ((1 <= p117))))) AND G (((1 <= p117))))) : X ((((((G ((X (((1 <= p100) AND (1 <= p204) AND (p346 <= 1) AND (1 <= p346))) AND ((1 <= p35)))) AND G (((1 <= p306)))) AND ((1 <= p170))) AND ((1 <= p100))) AND ((1 <= p204))) AND ((p346 <= 1) AND (1 <= p346)))) : X ((G (((p4 <= 0))) U F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))))) : F (G (((1 <= p318)))) : NOT(F (NOT(F (X ((F (((1 <= p269))) OR ((1 <= p112) AND (1 <= p254) AND (1 <= p354)))))))) : (G (X (((p185 <= 0) OR ((1 <= p73) AND (1 <= p209) AND (1 <= p324))))) U (((NOT(X (((1 <= p241)))) AND ((1 <= p73))) AND ((1 <= p209))) AND ((1 <= p324))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((p310 <= 0))) OR (((p24 <= 0)) AND ((p310 <= 0)))))) AND (((p281 <= 0)) R F ((X (((p281 <= 0))) OR ((p310 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p281 <= 0)) R F ((X (((p281 <= 0))) OR ((p310 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p281 <= 0)) R F ((X (((p281 <= 0))) OR ((p310 <= 0)))))
lola: processed formula length: 58
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p310 <= 0))) OR (((p24 <= 0)) AND ((p310 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p310 <= 0))) OR (((p24 <= 0)) AND ((p310 <= 0))))))
lola: processed formula length: 63
lola: 93 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((X (((1 <= p149))) OR ((1 <= p149)))) AND ((p105 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((X (((1 <= p149))) OR ((1 <= p149)))) AND ((p105 <= 0)))))
lola: processed formula length: 68
lola: 93 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: 125 markings, 134 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR (((1 <= p30) AND (1 <= p164) AND (1 <= p285)) OR (G (((1 <= p288))) AND F ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR (((1 <= p30) AND (1 <= p164) AND (1 <= p285)) OR (G (((1 <= p288))) AND F ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))))))
lola: processed formula length: 394
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 632525 markings, 2542718 edges, 126505 markings/sec, 0 secs
lola: 1213158 markings, 5085020 edges, 116127 markings/sec, 5 secs
lola: 1755945 markings, 7628930 edges, 108557 markings/sec, 10 secs
lola: 2303869 markings, 10170475 edges, 109585 markings/sec, 15 secs
lola: 2862143 markings, 12705922 edges, 111655 markings/sec, 20 secs
lola: 3393029 markings, 15246824 edges, 106177 markings/sec, 25 secs
lola: 3886241 markings, 17779692 edges, 98642 markings/sec, 30 secs
lola: 4387262 markings, 20315443 edges, 100204 markings/sec, 35 secs
lola: 4867129 markings, 22833337 edges, 95973 markings/sec, 40 secs
lola: 5413161 markings, 25344076 edges, 109206 markings/sec, 45 secs
lola: 5928843 markings, 27813705 edges, 103136 markings/sec, 50 secs
lola: 6407146 markings, 30275926 edges, 95661 markings/sec, 55 secs
lola: 6899859 markings, 32754091 edges, 98543 markings/sec, 60 secs
lola: 7375839 markings, 35285549 edges, 95196 markings/sec, 65 secs
lola: 7932559 markings, 37827889 edges, 111344 markings/sec, 70 secs
lola: 8458157 markings, 40338167 edges, 105120 markings/sec, 75 secs
lola: 8935771 markings, 42833942 edges, 95523 markings/sec, 80 secs
lola: 9440920 markings, 45357245 edges, 101030 markings/sec, 85 secs
lola: 9910338 markings, 47827458 edges, 93884 markings/sec, 90 secs
lola: 10403878 markings, 50340493 edges, 98708 markings/sec, 95 secs
lola: 10882825 markings, 52859362 edges, 95789 markings/sec, 100 secs
lola: 11327663 markings, 55382163 edges, 88968 markings/sec, 105 secs
lola: 11781930 markings, 57904199 edges, 90853 markings/sec, 110 secs
lola: 12215397 markings, 60387428 edges, 86693 markings/sec, 115 secs
lola: 12705598 markings, 62894026 edges, 98040 markings/sec, 120 secs
lola: 13177343 markings, 65407263 edges, 94349 markings/sec, 125 secs
lola: 13636674 markings, 67932511 edges, 91866 markings/sec, 130 secs
lola: 14085189 markings, 70459720 edges, 89703 markings/sec, 135 secs
lola: 14530535 markings, 72985718 edges, 89069 markings/sec, 140 secs
lola: 15029569 markings, 75516701 edges, 99807 markings/sec, 145 secs
lola: 15565627 markings, 78057741 edges, 107212 markings/sec, 150 secs
lola: 16075529 markings, 80589595 edges, 101980 markings/sec, 155 secs
lola: 16568817 markings, 83119678 edges, 98658 markings/sec, 160 secs
lola: 17060991 markings, 85652996 edges, 98435 markings/sec, 165 secs
lola: 17562896 markings, 88183567 edges, 100381 markings/sec, 170 secs
lola: 18041299 markings, 90707767 edges, 95681 markings/sec, 175 secs
lola: 18506455 markings, 93227160 edges, 93031 markings/sec, 180 secs
lola: 18940548 markings, 95737532 edges, 86819 markings/sec, 185 secs
lola: 19397723 markings, 98258163 edges, 91435 markings/sec, 190 secs
lola: 19855845 markings, 100774079 edges, 91624 markings/sec, 195 secs
lola: 20349123 markings, 103312482 edges, 98656 markings/sec, 200 secs
lola: 20822315 markings, 105837991 edges, 94638 markings/sec, 205 secs
lola: 21260169 markings, 108346049 edges, 87571 markings/sec, 210 secs
lola: 21720443 markings, 110869898 edges, 92055 markings/sec, 215 secs
lola: 22153869 markings, 113387147 edges, 86685 markings/sec, 220 secs
lola: 22565187 markings, 115342007 edges, 82264 markings/sec, 225 secs
lola: 22941793 markings, 117244661 edges, 75321 markings/sec, 230 secs
lola: 23317670 markings, 119151925 edges, 75175 markings/sec, 235 secs
lola: 23722053 markings, 121050896 edges, 80877 markings/sec, 240 secs
lola: 24104386 markings, 122967039 edges, 76467 markings/sec, 245 secs
lola: 24482413 markings, 124891770 edges, 75605 markings/sec, 250 secs
lola: 25005637 markings, 127291725 edges, 104645 markings/sec, 255 secs
lola: 25535291 markings, 129823690 edges, 105931 markings/sec, 260 secs
lola: 26025059 markings, 132347510 edges, 97954 markings/sec, 265 secs
lola: 26528351 markings, 134875760 edges, 100658 markings/sec, 270 secs
lola: 27001999 markings, 137395844 edges, 94730 markings/sec, 275 secs
lola: 27506956 markings, 139918506 edges, 100991 markings/sec, 280 secs
lola: 27985814 markings, 142435713 edges, 95772 markings/sec, 285 secs
lola: 28430439 markings, 144953348 edges, 88925 markings/sec, 290 secs
lola: 28882809 markings, 147466457 edges, 90474 markings/sec, 295 secs
lola: 29325404 markings, 149980290 edges, 88519 markings/sec, 300 secs
lola: 29806407 markings, 152485140 edges, 96201 markings/sec, 305 secs
lola: 30282500 markings, 155010547 edges, 95219 markings/sec, 310 secs
lola: 30745721 markings, 157523652 edges, 92644 markings/sec, 315 secs
lola: 31184985 markings, 160045050 edges, 87853 markings/sec, 320 secs
lola: 31638729 markings, 162560222 edges, 90749 markings/sec, 325 secs
lola: 32098921 markings, 165075111 edges, 92038 markings/sec, 330 secs
lola: 32589556 markings, 167602916 edges, 98127 markings/sec, 335 secs
lola: 33059315 markings, 170116404 edges, 93952 markings/sec, 340 secs
lola: 33495861 markings, 172617430 edges, 87309 markings/sec, 345 secs
lola: 33954019 markings, 175127706 edges, 91632 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6111552 KB
lola: time consumption: 360 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G (((1 <= p68) AND (1 <= p219) AND (1 <= p319))) AND X (((1 <= p348))))) AND X (G ((G (((p323 <= 0))) AND (((1 <= p68)) AND (((1 <= p219)) AND ((1 <= p319)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G (((1 <= p68) AND (1 <= p219) AND (1 <= p319))) AND X (((1 <= p348))))) AND X (G ((G (((p323 <= 0))) AND (((1 <= p68)) AND (((1 <= p219)) AND ((1 <= p319)))))))))
lola: processed formula length: 171
lola: 93 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: 210 markings, 210 edges
lola: ========================================
lola: subprocess 4 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((F (((1 <= p117))) U G ((F (((1 <= p303))) AND (((1 <= p106) AND (1 <= p244) AND (1 <= p350)) OR ((1 <= p303)))))) OR ((1 <= p117))))) AND G (((1 <= p117)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((F (((1 <= p117))) U G ((F (((1 <= p303))) AND (((1 <= p106) AND (1 <= p244) AND (1 <= p350)) OR ((1 <= p303)))))) OR ((1 <= p117))))) AND G (((1 <= p117)))))
lola: processed formula length: 169
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 210 markings, 210 edges
lola: ========================================
lola: subprocess 5 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X (((1 <= p100) AND (1 <= p204) AND (p346 <= 1) AND (1 <= p346))) AND (((1 <= p35)) AND ((1 <= p306))))) AND (((1 <= p170)) AND (((1 <= p100)) AND (((1 <= p204)) AND ((p346 <= 1) AND (1 <= p346)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (((1 <= p100) AND (1 <= p204) AND (p346 <= 1) AND (1 <= p346))) AND (((1 <= p35)) AND ((1 <= p306))))) AND (((1 <= p170)) AND (((1 <= p100)) AND (((1 <= p204)) AND ((p346 <= 1) AND (1 <= p346)))))))
lola: processed formula length: 208
lola: 93 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: 210 markings, 210 edges
lola: ========================================
lola: subprocess 6 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))) OR (G (((p4 <= 0))) AND F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))) OR (G (((p4 <= 0))) AND F (((1 <= p25) AND (1 <= p158) AND (1 <= p366))))))
lola: processed formula length: 128
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 143 markings, 162 edges
lola: subprocess 7 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p185 <= 0) OR ((1 <= p73) AND (1 <= p209) AND (1 <= p324))))) U (X (((p241 <= 0))) AND (((1 <= p73)) AND (((1 <= p209)) AND ((1 <= p324))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p185 <= 0) OR ((1 <= p73) AND (1 <= p209) AND (1 <= p324))))) U (X (((p241 <= 0))) AND (((1 <= p73)) AND (((1 <= p209)) AND ((1 <= p324))))))
lola: processed formula length: 151
lola: 93 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: 212 markings, 212 edges
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p318))))
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 (((1 <= p318))))
lola: processed formula length: 21
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 91 markings, 92 edges
lola: ========================================
lola: subprocess 9 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p227)) U G (((p275 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p227)) U G (((p275 <= 0))))
lola: processed formula length: 35
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 282 markings, 318 edges
lola: ========================================
lola: subprocess 10 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((1 <= p269))) OR ((1 <= p112) AND (1 <= p254) AND (1 <= p354)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((1 <= p269))) OR ((1 <= p112) AND (1 <= p254) AND (1 <= p354)))))
lola: processed formula length: 76
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 90 markings, 90 edges
lola: ========================================
lola: subprocess 11 will run for 3209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G (((p302 <= 0))) OR ((1 <= p44) AND (1 <= p174) AND (1 <= p298)))) OR (F (((p133 <= 0))) AND ((p302 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G (((p302 <= 0))) OR ((1 <= p44) AND (1 <= p174) AND (1 <= p298)))) OR (F (((p133 <= 0))) AND ((p302 <= 0)))))
lola: processed formula length: 118
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 259 markings, 275 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR (((1 <= p30) AND (1 <= p164) AND (1 <= p285)) OR (G (((1 <= p288))) AND F ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR (((1 <= p30) AND (1 <= p164) AND (1 <= p285)) OR (G (((1 <= p288))) AND F ((X (F ((((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0)) AND (F (((p5 <= 0))) OR G (((p30 <= 0) OR (p164 <= 0) OR (p285 <= 0))))))) OR ((1 <= p30) AND (1 <= p164) AND (1 <= p285))))))))
lola: processed formula length: 394
lola: 93 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 635675 markings, 2556387 edges, 127135 markings/sec, 0 secs
lola: 1217737 markings, 5107924 edges, 116412 markings/sec, 5 secs
lola: 1763415 markings, 7660514 edges, 109136 markings/sec, 10 secs
lola: 2312334 markings, 10210567 edges, 109784 markings/sec, 15 secs
lola: 2872803 markings, 12757158 edges, 112094 markings/sec, 20 secs
lola: 3404406 markings, 15301191 edges, 106321 markings/sec, 25 secs
lola: 3897581 markings, 17839997 edges, 98635 markings/sec, 30 secs
lola: 4402373 markings, 20383561 edges, 100958 markings/sec, 35 secs
lola: 4883133 markings, 22919225 edges, 96152 markings/sec, 40 secs
lola: 5438655 markings, 25469900 edges, 111104 markings/sec, 45 secs
lola: 5971059 markings, 28014857 edges, 106481 markings/sec, 50 secs
lola: 6458833 markings, 30559106 edges, 97555 markings/sec, 55 secs
lola: 6967099 markings, 33099023 edges, 101653 markings/sec, 60 secs
lola: 7455515 markings, 35636747 edges, 97683 markings/sec, 65 secs
lola: 8011916 markings, 38190134 edges, 111280 markings/sec, 70 secs
lola: 8537672 markings, 40729021 edges, 105151 markings/sec, 75 secs
lola: 9014299 markings, 43263583 edges, 95325 markings/sec, 80 secs
lola: 9522067 markings, 45801445 edges, 101554 markings/sec, 85 secs
lola: 10016991 markings, 48336631 edges, 98985 markings/sec, 90 secs
lola: 10509195 markings, 50871911 edges, 98441 markings/sec, 95 secs
lola: 10983186 markings, 53404689 edges, 94798 markings/sec, 100 secs
lola: 11419278 markings, 55926635 edges, 87218 markings/sec, 105 secs
lola: 11883135 markings, 58456689 edges, 92771 markings/sec, 110 secs
lola: 12314403 markings, 60976588 edges, 86254 markings/sec, 115 secs
lola: 12812937 markings, 63474792 edges, 99707 markings/sec, 120 secs
lola: 13286975 markings, 65965848 edges, 94808 markings/sec, 125 secs
lola: 13720417 markings, 68424517 edges, 86688 markings/sec, 130 secs
lola: 14170377 markings, 70926951 edges, 89992 markings/sec, 135 secs
lola: 14615485 markings, 73450299 edges, 89022 markings/sec, 140 secs
lola: 15133045 markings, 75982109 edges, 103512 markings/sec, 145 secs
lola: 15661211 markings, 78512456 edges, 105633 markings/sec, 150 secs
lola: 16159217 markings, 81044022 edges, 99601 markings/sec, 155 secs
lola: 16660365 markings, 83573096 edges, 100230 markings/sec, 160 secs
lola: 17145713 markings, 86103848 edges, 97070 markings/sec, 165 secs
lola: 17652129 markings, 88634308 edges, 101283 markings/sec, 170 secs
lola: 18126150 markings, 91152873 edges, 94804 markings/sec, 175 secs
lola: 18581755 markings, 93672591 edges, 91121 markings/sec, 180 secs
lola: 19029425 markings, 96189961 edges, 89534 markings/sec, 185 secs
lola: 19474076 markings, 98708721 edges, 88930 markings/sec, 190 secs
lola: 19947921 markings, 101230348 edges, 94769 markings/sec, 195 secs
lola: 20433915 markings, 103762473 edges, 97199 markings/sec, 200 secs
lola: 20903824 markings, 106279176 edges, 93982 markings/sec, 205 secs
lola: 21336919 markings, 108799238 edges, 86619 markings/sec, 210 secs
lola: 21799693 markings, 111327677 edges, 92555 markings/sec, 215 secs
lola: 22232867 markings, 113805246 edges, 86635 markings/sec, 220 secs
lola: 22639575 markings, 115691935 edges, 81342 markings/sec, 225 secs
lola: 23011957 markings, 117600301 edges, 74476 markings/sec, 230 secs
lola: 23385482 markings, 119521030 edges, 74705 markings/sec, 235 secs
lola: 23799525 markings, 121420025 edges, 82809 markings/sec, 240 secs
lola: 24174327 markings, 123346533 edges, 74960 markings/sec, 245 secs
lola: 24553588 markings, 125278769 edges, 75852 markings/sec, 250 secs
lola: 25108515 markings, 127805621 edges, 110985 markings/sec, 255 secs
lola: 25640109 markings, 130343076 edges, 106319 markings/sec, 260 secs
lola: 26122527 markings, 132874825 edges, 96484 markings/sec, 265 secs
lola: 26630109 markings, 135410991 edges, 101516 markings/sec, 270 secs
lola: 27118043 markings, 137945377 edges, 97587 markings/sec, 275 secs
lola: 27613132 markings, 140477932 edges, 99018 markings/sec, 280 secs
lola: 28089283 markings, 143003201 edges, 95230 markings/sec, 285 secs
lola: 28532197 markings, 145526093 edges, 88583 markings/sec, 290 secs
lola: 28989840 markings, 148048482 edges, 91529 markings/sec, 295 secs
lola: 29423975 markings, 150565308 edges, 86827 markings/sec, 300 secs
lola: 29922506 markings, 153095004 edges, 99706 markings/sec, 305 secs
lola: 30401471 markings, 155623947 edges, 95793 markings/sec, 310 secs
lola: 30849347 markings, 158139638 edges, 89575 markings/sec, 315 secs
lola: 31301225 markings, 160659608 edges, 90376 markings/sec, 320 secs
lola: 31746625 markings, 163178918 edges, 89080 markings/sec, 325 secs
lola: 32224533 markings, 165703653 edges, 95582 markings/sec, 330 secs
lola: 32707391 markings, 168236683 edges, 96572 markings/sec, 335 secs
lola: 33175678 markings, 170754168 edges, 93657 markings/sec, 340 secs
lola: 33603685 markings, 173263157 edges, 85601 markings/sec, 345 secs
lola: 34066695 markings, 175794784 edges, 92602 markings/sec, 350 secs
lola: 34515417 markings, 178333937 edges, 89744 markings/sec, 355 secs
lola: 34966757 markings, 180874366 edges, 90268 markings/sec, 360 secs
lola: 35402880 markings, 183377652 edges, 87225 markings/sec, 365 secs
lola: 35803815 markings, 185861967 edges, 80187 markings/sec, 370 secs
lola: 36221913 markings, 188389744 edges, 83620 markings/sec, 375 secs
lola: 36624210 markings, 190883900 edges, 80459 markings/sec, 380 secs
lola: 37046184 markings, 193361475 edges, 84395 markings/sec, 385 secs
lola: 37479427 markings, 195812417 edges, 86649 markings/sec, 390 secs
lola: 37891517 markings, 198196992 edges, 82418 markings/sec, 395 secs
lola: 38267985 markings, 200532744 edges, 75294 markings/sec, 400 secs
lola: 38678785 markings, 203014460 edges, 82160 markings/sec, 405 secs
lola: 39078069 markings, 205482715 edges, 79857 markings/sec, 410 secs
lola: 39487999 markings, 207849290 edges, 81986 markings/sec, 415 secs
lola: 39974867 markings, 210357441 edges, 97374 markings/sec, 420 secs
lola: 40440725 markings, 212835403 edges, 93172 markings/sec, 425 secs
lola: 40875715 markings, 215319867 edges, 86998 markings/sec, 430 secs
lola: 41322231 markings, 217775175 edges, 89303 markings/sec, 435 secs
lola: 41751525 markings, 220263690 edges, 85859 markings/sec, 440 secs
lola: 42222200 markings, 222834264 edges, 94135 markings/sec, 445 secs
lola: 42657169 markings, 225385368 edges, 86994 markings/sec, 450 secs
lola: 43089773 markings, 227945710 edges, 86521 markings/sec, 455 secs
lola: 43494668 markings, 230494855 edges, 80979 markings/sec, 460 secs
lola: 43919421 markings, 233027097 edges, 84951 markings/sec, 465 secs
lola: 44325801 markings, 235561177 edges, 81276 markings/sec, 470 secs
lola: 44793811 markings, 238143523 edges, 93602 markings/sec, 475 secs
lola: 45237318 markings, 240694597 edges, 88701 markings/sec, 480 secs
lola: 45651048 markings, 243242556 edges, 82746 markings/sec, 485 secs
lola: 46073813 markings, 245810002 edges, 84553 markings/sec, 490 secs
lola: 46488681 markings, 248379316 edges, 82974 markings/sec, 495 secs
lola: 46892339 markings, 250726219 edges, 80732 markings/sec, 500 secs
lola: 47264941 markings, 252678598 edges, 74520 markings/sec, 505 secs
lola: 47615132 markings, 254646970 edges, 70038 markings/sec, 510 secs
lola: 47966271 markings, 256623897 edges, 70228 markings/sec, 515 secs
lola: 48349329 markings, 258590131 edges, 76612 markings/sec, 520 secs
lola: 48704687 markings, 260574320 edges, 71072 markings/sec, 525 secs
lola: 49062573 markings, 262565864 edges, 71577 markings/sec, 530 secs
lola: 49598500 markings, 265054659 edges, 107185 markings/sec, 535 secs
lola: 50141697 markings, 267656553 edges, 108639 markings/sec, 540 secs
lola: 50641847 markings, 270248451 edges, 100030 markings/sec, 545 secs
lola: 51159169 markings, 272841590 edges, 103464 markings/sec, 550 secs
lola: 51653953 markings, 275437998 edges, 98957 markings/sec, 555 secs
lola: 52157049 markings, 278003420 edges, 100619 markings/sec, 560 secs
lola: 52645288 markings, 280577859 edges, 97648 markings/sec, 565 secs
lola: 53098601 markings, 283161870 edges, 90663 markings/sec, 570 secs
lola: 53568633 markings, 285754214 edges, 94006 markings/sec, 575 secs
lola: 54013345 markings, 288333830 edges, 88942 markings/sec, 580 secs
lola: 54526307 markings, 290934991 edges, 102592 markings/sec, 585 secs
lola: 55015904 markings, 293506909 edges, 97919 markings/sec, 590 secs
lola: 55465489 markings, 296050843 edges, 89917 markings/sec, 595 secs
lola: 55922907 markings, 298591128 edges, 91484 markings/sec, 600 secs
lola: 56368805 markings, 301127150 edges, 89180 markings/sec, 605 secs
lola: 56859148 markings, 303672858 edges, 98069 markings/sec, 610 secs
lola: 57336521 markings, 306214522 edges, 95475 markings/sec, 615 secs
lola: 57807177 markings, 308785817 edges, 94131 markings/sec, 620 secs
lola: 58262519 markings, 311362487 edges, 91068 markings/sec, 625 secs
lola: 58718190 markings, 313934685 edges, 91134 markings/sec, 630 secs
lola: 59180213 markings, 316503539 edges, 92405 markings/sec, 635 secs
lola: 59621146 markings, 318994794 edges, 88187 markings/sec, 640 secs
lola: 60048278 markings, 321480064 edges, 85426 markings/sec, 645 secs
lola: 60449850 markings, 323969334 edges, 80314 markings/sec, 650 secs
lola: 60862511 markings, 326463465 edges, 82532 markings/sec, 655 secs
lola: 61274095 markings, 329014211 edges, 82317 markings/sec, 660 secs
lola: 61715043 markings, 331555789 edges, 88190 markings/sec, 665 secs
lola: 62159883 markings, 334101409 edges, 88968 markings/sec, 670 secs
lola: 62595187 markings, 336642533 edges, 87061 markings/sec, 675 secs
lola: 62999651 markings, 339184573 edges, 80893 markings/sec, 680 secs
lola: 63430007 markings, 341752161 edges, 86071 markings/sec, 685 secs
lola: 63834027 markings, 344299395 edges, 80804 markings/sec, 690 secs
lola: 64324767 markings, 346836243 edges, 98148 markings/sec, 695 secs
lola: 64810425 markings, 349414257 edges, 97132 markings/sec, 700 secs
lola: 65271109 markings, 351987488 edges, 92137 markings/sec, 705 secs
lola: 65731761 markings, 354558949 edges, 92130 markings/sec, 710 secs
lola: 66187361 markings, 357135525 edges, 91120 markings/sec, 715 secs
lola: 66650282 markings, 359705711 edges, 92584 markings/sec, 720 secs
lola: 67097487 markings, 362267891 edges, 89441 markings/sec, 725 secs
lola: 67536175 markings, 364827260 edges, 87738 markings/sec, 730 secs
lola: 67941007 markings, 367378402 edges, 80966 markings/sec, 735 secs
lola: 68371323 markings, 369940645 edges, 86063 markings/sec, 740 secs
lola: 68775428 markings, 372490608 edges, 80821 markings/sec, 745 secs
lola: 69238473 markings, 375059937 edges, 92609 markings/sec, 750 secs
lola: 69677537 markings, 377630924 edges, 87813 markings/sec, 755 secs
lola: 70110277 markings, 380187734 edges, 86548 markings/sec, 760 secs
lola: 70505859 markings, 382700179 edges, 79116 markings/sec, 765 secs
lola: 70939941 markings, 385267827 edges, 86816 markings/sec, 770 secs
lola: 71342445 markings, 387799742 edges, 80501 markings/sec, 775 secs
lola: 71724647 markings, 389760879 edges, 76440 markings/sec, 780 secs
lola: 72080371 markings, 391736630 edges, 71145 markings/sec, 785 secs
lola: 72437491 markings, 393723128 edges, 71424 markings/sec, 790 secs
lola: 72816583 markings, 395693899 edges, 75818 markings/sec, 795 secs
lola: 73180161 markings, 397686273 edges, 72716 markings/sec, 800 secs
lola: 73539591 markings, 399692919 edges, 71886 markings/sec, 805 secs
lola: 74032593 markings, 402046965 edges, 98600 markings/sec, 810 secs
lola: 74575243 markings, 404647765 edges, 108530 markings/sec, 815 secs
lola: 75080499 markings, 407223687 edges, 101051 markings/sec, 820 secs
lola: 75591161 markings, 409800708 edges, 102132 markings/sec, 825 secs
lola: 76081606 markings, 412372488 edges, 98089 markings/sec, 830 secs
lola: 76594799 markings, 414944021 edges, 102639 markings/sec, 835 secs
lola: 77081345 markings, 417507700 edges, 97309 markings/sec, 840 secs
lola: 77528771 markings, 420042637 edges, 89485 markings/sec, 845 secs
lola: 77986483 markings, 422586261 edges, 91542 markings/sec, 850 secs
lola: 78435722 markings, 425124728 edges, 89848 markings/sec, 855 secs
lola: 78926793 markings, 427692177 edges, 98214 markings/sec, 860 secs
lola: 79415099 markings, 430279957 edges, 97661 markings/sec, 865 secs
lola: 79889589 markings, 432859809 edges, 94898 markings/sec, 870 secs
lola: 80338891 markings, 435421994 edges, 89860 markings/sec, 875 secs
lola: 80796642 markings, 437986127 edges, 91550 markings/sec, 880 secs
lola: 81274395 markings, 440564253 edges, 95551 markings/sec, 885 secs
lola: 81778187 markings, 443163354 edges, 100758 markings/sec, 890 secs
lola: 82259343 markings, 445746556 edges, 96231 markings/sec, 895 secs
lola: 82701642 markings, 448321708 edges, 88460 markings/sec, 900 secs
lola: 83173361 markings, 450903191 edges, 94344 markings/sec, 905 secs
lola: 83624397 markings, 453480136 edges, 90207 markings/sec, 910 secs
lola: 84085546 markings, 456060575 edges, 92230 markings/sec, 915 secs
lola: 84532759 markings, 458631788 edges, 89443 markings/sec, 920 secs
lola: 84947829 markings, 461192527 edges, 83014 markings/sec, 925 secs
lola: 85370457 markings, 463756202 edges, 84526 markings/sec, 930 secs
lola: 85786396 markings, 466319553 edges, 83188 markings/sec, 935 secs
lola: 86226333 markings, 468888119 edges, 87987 markings/sec, 940 secs
lola: 86682539 markings, 471475003 edges, 91241 markings/sec, 945 secs
lola: 87120692 markings, 474044937 edges, 87631 markings/sec, 950 secs
lola: 87534065 markings, 476609632 edges, 82675 markings/sec, 955 secs
lola: 87961487 markings, 479181076 edges, 85484 markings/sec, 960 secs
lola: 88371802 markings, 481748174 edges, 82063 markings/sec, 965 secs
lola: 88864883 markings, 484333701 edges, 98616 markings/sec, 970 secs
lola: 89346457 markings, 486894069 edges, 96315 markings/sec, 975 secs
lola: 89804737 markings, 489423073 edges, 91656 markings/sec, 980 secs
lola: 90253773 markings, 491948580 edges, 89807 markings/sec, 985 secs
lola: 90700807 markings, 494479610 edges, 89407 markings/sec, 990 secs
lola: 91122589 markings, 496826845 edges, 84356 markings/sec, 995 secs
lola: 91568215 markings, 499349038 edges, 89125 markings/sec, 1000 secs
lola: 92001807 markings, 501862926 edges, 86718 markings/sec, 1005 secs
lola: 92407257 markings, 504373652 edges, 81090 markings/sec, 1010 secs
lola: 92820972 markings, 506878136 edges, 82743 markings/sec, 1015 secs
lola: 93227455 markings, 509393739 edges, 81297 markings/sec, 1020 secs
lola: 93661847 markings, 511907619 edges, 86878 markings/sec, 1025 secs
lola: 94105883 markings, 514436215 edges, 88807 markings/sec, 1030 secs
lola: 94534913 markings, 516950301 edges, 85806 markings/sec, 1035 secs
lola: 94937365 markings, 519457114 edges, 80490 markings/sec, 1040 secs
lola: 95355515 markings, 521973666 edges, 83630 markings/sec, 1045 secs
lola: 95759008 markings, 524485503 edges, 80699 markings/sec, 1050 secs
lola: 96143779 markings, 526614648 edges, 76954 markings/sec, 1055 secs
lola: 96506479 markings, 528564534 edges, 72540 markings/sec, 1060 secs
lola: 96857953 markings, 530519555 edges, 70295 markings/sec, 1065 secs
lola: 97220569 markings, 532478449 edges, 72523 markings/sec, 1070 secs
lola: 97591663 markings, 534437148 edges, 74219 markings/sec, 1075 secs
lola: 97942855 markings, 536410863 edges, 70238 markings/sec, 1080 secs
lola: 98314053 markings, 538455719 edges, 74240 markings/sec, 1085 secs
lola: 98812832 markings, 541002686 edges, 99756 markings/sec, 1090 secs
lola: 99296865 markings, 543547921 edges, 96807 markings/sec, 1095 secs
lola: 99742033 markings, 546080724 edges, 89034 markings/sec, 1100 secs
lola: 100193765 markings, 548579880 edges, 90346 markings/sec, 1105 secs
lola: 100620327 markings, 551040607 edges, 85312 markings/sec, 1110 secs
lola: 101071828 markings, 553507532 edges, 90300 markings/sec, 1115 secs
lola: 101503661 markings, 556020819 edges, 86367 markings/sec, 1120 secs
lola: 101931592 markings, 558533941 edges, 85586 markings/sec, 1125 secs
lola: 102321041 markings, 560998361 edges, 77890 markings/sec, 1130 secs
lola: 102733801 markings, 563445650 edges, 82552 markings/sec, 1135 secs
lola: 103118711 markings, 565875504 edges, 76982 markings/sec, 1140 secs
lola: 103574761 markings, 568398843 edges, 91210 markings/sec, 1145 secs
lola: 104004624 markings, 570917616 edges, 85973 markings/sec, 1150 secs
lola: 104422536 markings, 573373439 edges, 83582 markings/sec, 1155 secs
lola: 104816763 markings, 575877000 edges, 78845 markings/sec, 1160 secs
lola: 105239647 markings, 578372723 edges, 84577 markings/sec, 1165 secs
lola: 105626278 markings, 580828204 edges, 77326 markings/sec, 1170 secs
lola: 106077655 markings, 583301054 edges, 90275 markings/sec, 1175 secs
lola: 106497841 markings, 585748588 edges, 84037 markings/sec, 1180 secs
lola: 106910358 markings, 588201418 edges, 82503 markings/sec, 1185 secs
lola: 107299263 markings, 590670397 edges, 77781 markings/sec, 1190 secs
lola: 107721178 markings, 593158289 edges, 84383 markings/sec, 1195 secs
lola: 108110737 markings, 595629745 edges, 77912 markings/sec, 1200 secs
lola: 108532239 markings, 598115304 edges, 84300 markings/sec, 1205 secs
lola: 108922697 markings, 600594695 edges, 78092 markings/sec, 1210 secs
lola: 109311527 markings, 603064244 edges, 77766 markings/sec, 1215 secs
lola: 109608126 markings, 605072487 edges, 59320 markings/sec, 1220 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no no no no no no no no
lola:
preliminary result: no yes no unknown no no no no no no no no
lola: memory consumption: 3468 KB
lola: time consumption: 1590 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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r182-oct2-158987913900482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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