About the Execution of ITS-LoLa for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15788.690 | 3600000.00 | 1001055.00 | 7303.70 | FTFFTTFFFFFT?TTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900769.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900769
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 67K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15
=== Now, execution of the tool begins
BK_START 1591239217708
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:53:40] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-06-04 02:53:40] [INFO ] Transformed 216 places.
[2020-06-04 02:53:40] [INFO ] Transformed 198 transitions.
[2020-06-04 02:53:40] [INFO ] Parsed PT model containing 216 places and 198 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 75 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3326 resets, run finished after 330 ms. (steps per millisecond=303 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 198 rows 216 cols
[2020-06-04 02:53:40] [INFO ] Computed 24 place invariants in 25 ms
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 24 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-04 02:53:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:41] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-04 02:53:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 39 ms.
[2020-06-04 02:53:43] [INFO ] Added : 193 causal constraints over 40 iterations in 1397 ms. Result :sat
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 40 places in 119 ms
[2020-06-04 02:53:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2020-06-04 02:53:43] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned unsat
[2020-06-04 02:53:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:43] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-06-04 02:53:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 78 places in 242 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 57 places in 107 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 41 places in 109 ms
[2020-06-04 02:53:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2020-06-04 02:53:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:53:45] [INFO ] Added : 191 causal constraints over 39 iterations in 808 ms. Result :sat
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 26 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-06-04 02:53:45] [INFO ] Deduced a trap composed of 79 places in 153 ms
[2020-06-04 02:53:45] [INFO ] Deduced a trap composed of 90 places in 75 ms
[2020-06-04 02:53:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2020-06-04 02:53:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 02:53:46] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 21 ms returned sat
[2020-06-04 02:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:46] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 79 places in 1858 ms
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 87 places in 143 ms
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 83 places in 94 ms
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 88 places in 83 ms
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 85 places in 103 ms
[2020-06-04 02:53:48] [INFO ] Deduced a trap composed of 94 places in 109 ms
[2020-06-04 02:53:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2548 ms
[2020-06-04 02:53:48] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 21 ms.
[2020-06-04 02:53:49] [INFO ] Added : 160 causal constraints over 32 iterations in 683 ms. Result :sat
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-04 02:53:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:50] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-06-04 02:53:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:53:50] [INFO ] Added : 195 causal constraints over 39 iterations in 596 ms. Result :sat
[2020-06-04 02:53:50] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-06-04 02:53:50] [INFO ] Deduced a trap composed of 29 places in 70 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 62 places in 71 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2020-06-04 02:53:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 431 ms
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 36 places in 51 ms
[2020-06-04 02:53:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2020-06-04 02:53:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:51] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2020-06-04 02:53:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2020-06-04 02:53:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-06-04 02:53:52] [INFO ] Added : 195 causal constraints over 39 iterations in 484 ms. Result :sat
[2020-06-04 02:53:52] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2020-06-04 02:53:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:52] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-04 02:53:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 94 places in 129 ms
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 49 places in 85 ms
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 83 places in 60 ms
[2020-06-04 02:53:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 421 ms
[2020-06-04 02:53:53] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-06-04 02:53:54] [INFO ] Added : 188 causal constraints over 38 iterations in 763 ms. Result :sat
[2020-06-04 02:53:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:54] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-04 02:53:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-04 02:53:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:53:55] [INFO ] Added : 192 causal constraints over 39 iterations in 714 ms. Result :sat
[2020-06-04 02:53:55] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-06-04 02:53:55] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2020-06-04 02:53:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2020-06-04 02:53:55] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:55] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-04 02:53:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 02:53:55] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:56] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-04 02:53:56] [INFO ] Deduced a trap composed of 82 places in 70 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 77 places in 905 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 100 places in 120 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 100 places in 168 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 29 places in 116 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 109 places in 140 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 100 places in 119 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 109 places in 139 ms
[2020-06-04 02:53:57] [INFO ] Deduced a trap composed of 70 places in 117 ms
[2020-06-04 02:53:58] [INFO ] Deduced a trap composed of 81 places in 143 ms
[2020-06-04 02:53:58] [INFO ] Deduced a trap composed of 76 places in 145 ms
[2020-06-04 02:53:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 2298 ms
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 4 ms returned unsat
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:58] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-04 02:53:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:53:58] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:58] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-04 02:53:59] [INFO ] Deduced a trap composed of 74 places in 127 ms
[2020-06-04 02:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-06-04 02:53:59] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 73 ms.
[2020-06-04 02:54:00] [INFO ] Added : 195 causal constraints over 39 iterations in 1621 ms. Result :sat
[2020-06-04 02:54:00] [INFO ] Deduced a trap composed of 91 places in 123 ms
[2020-06-04 02:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-06-04 02:54:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-06-04 02:54:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-04 02:54:01] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:02] [INFO ] [Real]Absence check using state equation in 1825 ms returned sat
[2020-06-04 02:54:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:03] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 64 places in 104 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2020-06-04 02:54:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2020-06-04 02:54:03] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-06-04 02:54:03] [INFO ] Added : 146 causal constraints over 30 iterations in 515 ms. Result :sat
[2020-06-04 02:54:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:54:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:04] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2020-06-04 02:54:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 02:54:04] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:05] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 41 places in 71 ms
[2020-06-04 02:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-06-04 02:54:05] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:06] [INFO ] Added : 195 causal constraints over 39 iterations in 904 ms. Result :sat
[2020-06-04 02:54:06] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:06] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-06-04 02:54:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2020-06-04 02:54:06] [INFO ] Deduced a trap composed of 63 places in 111 ms
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 87 places in 98 ms
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 66 places in 99 ms
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 86 places in 83 ms
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 100 places in 109 ms
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 77 places in 104 ms
[2020-06-04 02:54:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 729 ms
[2020-06-04 02:54:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:54:08] [INFO ] Added : 191 causal constraints over 39 iterations in 883 ms. Result :sat
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 41 places in 174 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 67 places in 868 ms
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 43 places in 489 ms
[2020-06-04 02:54:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1588 ms
[2020-06-04 02:54:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 41 places in 215 ms
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 77 places in 94 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 43 places in 438 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 55 places in 158 ms
[2020-06-04 02:54:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1023 ms
[2020-06-04 02:54:11] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 30 ms.
[2020-06-04 02:54:13] [INFO ] Added : 190 causal constraints over 39 iterations in 1721 ms. Result :sat
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 47 places in 146 ms
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 89 places in 91 ms
[2020-06-04 02:54:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2020-06-04 02:54:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:54:13] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:14] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-06-04 02:54:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2020-06-04 02:54:14] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 76 ms returned sat
[2020-06-04 02:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:15] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2020-06-04 02:54:15] [INFO ] Deduced a trap composed of 55 places in 331 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 84 places in 521 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 74 places in 155 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 48 places in 114 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 77 places in 88 ms
[2020-06-04 02:54:17] [INFO ] Deduced a trap composed of 71 places in 379 ms
[2020-06-04 02:54:18] [INFO ] Deduced a trap composed of 63 places in 1162 ms
[2020-06-04 02:54:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3010 ms
[2020-06-04 02:54:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:54:19] [INFO ] Added : 193 causal constraints over 39 iterations in 1346 ms. Result :sat
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 89 places in 194 ms
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 107 places in 99 ms
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 108 places in 88 ms
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 46 places in 119 ms
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 58 places in 221 ms
[2020-06-04 02:54:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 971 ms
[2020-06-04 02:54:20] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-06-04 02:54:20] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 118 ms returned sat
[2020-06-04 02:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:21] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2020-06-04 02:54:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 02:54:21] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 48 ms returned sat
[2020-06-04 02:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:21] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2020-06-04 02:54:22] [INFO ] Deduced a trap composed of 47 places in 860 ms
[2020-06-04 02:54:22] [INFO ] Deduced a trap composed of 86 places in 151 ms
[2020-06-04 02:54:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1063 ms
[2020-06-04 02:54:22] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:23] [INFO ] Added : 156 causal constraints over 32 iterations in 644 ms. Result :sat
[2020-06-04 02:54:23] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2020-06-04 02:54:23] [INFO ] Deduced a trap composed of 25 places in 115 ms
[2020-06-04 02:54:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2020-06-04 02:54:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-04 02:54:24] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2020-06-04 02:54:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 159 ms returned sat
[2020-06-04 02:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:24] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-06-04 02:54:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:54:24] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 21 ms returned sat
[2020-06-04 02:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:25] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 73 places in 120 ms
[2020-06-04 02:54:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-06-04 02:54:25] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 33 ms.
[2020-06-04 02:54:25] [INFO ] Added : 138 causal constraints over 28 iterations in 574 ms. Result :sat
[2020-06-04 02:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 02:54:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:26] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-04 02:54:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 65 places in 147 ms
[2020-06-04 02:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2020-06-04 02:54:26] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-06-04 02:54:27] [INFO ] Added : 151 causal constraints over 31 iterations in 915 ms. Result :sat
[2020-06-04 02:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:27] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 32 ms returned sat
[2020-06-04 02:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:28] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-06-04 02:54:28] [INFO ] Deduced a trap composed of 54 places in 39 ms
[2020-06-04 02:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2020-06-04 02:54:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 59 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:29] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 54 places in 1036 ms
[2020-06-04 02:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1074 ms
[2020-06-04 02:54:30] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:54:31] [INFO ] Added : 195 causal constraints over 39 iterations in 891 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-04 02:54:31] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 02:54:31] [INFO ] Flatten gal took : 88 ms
FORMULA DoubleExponent-PT-004-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:54:31] [INFO ] Flatten gal took : 20 ms
[2020-06-04 02:54:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 02:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DoubleExponent-PT-004 @ 3570 seconds
FORMULA DoubleExponent-PT-004-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-004-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2713
rslt: Output for LTLCardinality @ DoubleExponent-PT-004
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:54:32 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p139 <= p138) U (p178 <= p92)))",
"processed_size": 36,
"rewrites": 28
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (((G ((p115 + 1 <= p194)) AND (p162 + 1 <= p60)) OR X ((p70 <= 0)))) AND ((p60 <= p162) U (1 <= p70))))",
"processed_size": 109,
"rewrites": 28
},
"result":
{
"edges": 27,
"markings": 27,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((F ((2 <= p128)) OR X (X ((p4 <= p114)))))",
"processed_size": 45,
"rewrites": 28
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p200 <= p9)))",
"processed_size": 20,
"rewrites": 28
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1045
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p72 + 1 <= p44)))",
"processed_size": 24,
"rewrites": 28
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((p163 + 1 <= p25)) OR (p33 + 1 <= p212)))",
"processed_size": 48,
"rewrites": 28
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 6,
"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": 3137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F ((p109 <= p8)) AND (p168 <= p205)) U G ((p168 <= p205)))",
"processed_size": 60,
"rewrites": 28
},
"result":
{
"edges": 47,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 3552,
"runtime": 857.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) AND **) U G(**)) : X((** U **)) : G((F(((G(*) AND *) OR X(*))) AND (** U **))) : G(F(*)) : F((F(*) OR **)) : F((F(**) OR X(X(**)))) : G(F((X(X(G(**))) AND (G(**) AND **)))) : X(F(**))"
},
"net":
{
"arcs": 558,
"conflict_clusters": 143,
"places": 216,
"places_significant": 192,
"singleton_clusters": 0,
"transitions": 198
},
"result":
{
"preliminary_value": "no yes no no no yes unknown yes ",
"value": "no yes no no no yes unknown yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 414/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 198 transitions, 192 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: ((F ((p109 <= p8)) AND (p168 <= p205)) U G ((p168 <= p205))) : (X ((p139 <= p138)) U X ((p178 <= p92))) : G ((NOT(G (((F ((p194 <= p115)) OR (p60 <= p162)) AND X ((1 <= p70))))) AND ((p60 <= p162) U (1 <= p70)))) : X (G (F (X (NOT(G ((p44 <= p72))))))) : F ((NOT(G ((p25 <= p163))) OR (p33 + 1 <= p212))) : (X ((p4 <= p114)) U F ((F ((2 <= p128)) OR NOT(X (NOT(X ((p4 <= p114)))))))) : X (G (F (((X (X (G ((p88 <= p58)))) AND G ((p33 <= p45))) AND (p33 <= p45))))) : X (F (((F ((p200 <= p9)) U G (X ((X ((p178 <= p46)) AND (1 <= p125))))) U (p200 <= p9))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p139 <= p138) U (p178 <= p92)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p139 <= p138) U (p178 <= p92)))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((G ((p115 + 1 <= p194)) AND (p162 + 1 <= p60)) OR X ((p70 <= 0)))) AND ((p60 <= p162) U (1 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((G ((p115 + 1 <= p194)) AND (p162 + 1 <= p60)) OR X ((p70 <= 0)))) AND ((p60 <= p162) U (1 <= p70))))
lola: processed formula length: 109
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((2 <= p128)) OR X (X ((p4 <= p114)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((2 <= p128)) OR X (X ((p4 <= p114)))))
lola: processed formula length: 45
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((p88 <= p58)))) AND (G ((p33 <= p45)) AND (p33 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((p88 <= p58)))) AND (G ((p33 <= p45)) AND (p33 <= p45)))))
lola: processed formula length: 74
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 2086472 markings, 2308221 edges, 417294 markings/sec, 0 secs
lola: 4017018 markings, 4890724 edges, 386109 markings/sec, 5 secs
lola: 5901281 markings, 7490266 edges, 376853 markings/sec, 10 secs
lola: 7839918 markings, 10172506 edges, 387727 markings/sec, 15 secs
lola: 9618088 markings, 12639277 edges, 355634 markings/sec, 20 secs
lola: 11509056 markings, 15228102 edges, 378194 markings/sec, 25 secs
lola: 13285055 markings, 17696335 edges, 355200 markings/sec, 30 secs
lola: 15167677 markings, 20312081 edges, 376524 markings/sec, 35 secs
lola: 17050664 markings, 22907083 edges, 376597 markings/sec, 40 secs
lola: 18650840 markings, 25130676 edges, 320035 markings/sec, 45 secs
lola: 20465482 markings, 27627536 edges, 362928 markings/sec, 50 secs
lola: 22280346 markings, 30150880 edges, 362973 markings/sec, 55 secs
lola: 24163883 markings, 32737545 edges, 376707 markings/sec, 60 secs
lola: 26019681 markings, 35311084 edges, 371160 markings/sec, 65 secs
lola: 27862700 markings, 37868149 edges, 368604 markings/sec, 70 secs
lola: 29758393 markings, 40458024 edges, 379139 markings/sec, 75 secs
lola: 31572539 markings, 42982320 edges, 362829 markings/sec, 80 secs
lola: 33402243 markings, 45538071 edges, 365941 markings/sec, 85 secs
lola: 35294913 markings, 48137171 edges, 378534 markings/sec, 90 secs
lola: 36957222 markings, 50422540 edges, 332462 markings/sec, 95 secs
lola: 38699372 markings, 52832823 edges, 348430 markings/sec, 100 secs
lola: 40580550 markings, 55429704 edges, 376236 markings/sec, 105 secs
lola: 42413503 markings, 57986137 edges, 366591 markings/sec, 110 secs
lola: 44235584 markings, 60519693 edges, 364416 markings/sec, 115 secs
lola: 46093953 markings, 63091492 edges, 371674 markings/sec, 120 secs
lola: 47957876 markings, 65667650 edges, 372785 markings/sec, 125 secs
lola: 49815001 markings, 68208527 edges, 371425 markings/sec, 130 secs
lola: 51664275 markings, 70750455 edges, 369855 markings/sec, 135 secs
lola: 53504449 markings, 73342119 edges, 368035 markings/sec, 140 secs
lola: 55388772 markings, 75917451 edges, 376865 markings/sec, 145 secs
lola: 57216354 markings, 78459381 edges, 365516 markings/sec, 150 secs
lola: 59043852 markings, 80990722 edges, 365500 markings/sec, 155 secs
lola: 60890483 markings, 83560922 edges, 369326 markings/sec, 160 secs
lola: 62786729 markings, 86163686 edges, 379249 markings/sec, 165 secs
lola: 64629242 markings, 88728050 edges, 368503 markings/sec, 170 secs
lola: 66469358 markings, 91272488 edges, 368023 markings/sec, 175 secs
lola: 68311461 markings, 93827518 edges, 368421 markings/sec, 180 secs
lola: 70196163 markings, 96424200 edges, 376940 markings/sec, 185 secs
lola: 72047584 markings, 98987505 edges, 370284 markings/sec, 190 secs
lola: 73882619 markings, 101513300 edges, 367007 markings/sec, 195 secs
lola: 75715068 markings, 104032308 edges, 366490 markings/sec, 200 secs
lola: 77526289 markings, 106572917 edges, 362244 markings/sec, 205 secs
lola: 79396241 markings, 109157608 edges, 373990 markings/sec, 210 secs
lola: 81265420 markings, 111730113 edges, 373836 markings/sec, 215 secs
lola: 83104820 markings, 114283997 edges, 367880 markings/sec, 220 secs
lola: 84948852 markings, 116815826 edges, 368806 markings/sec, 225 secs
lola: 86776406 markings, 119363220 edges, 365511 markings/sec, 230 secs
lola: 88631505 markings, 121936274 edges, 371020 markings/sec, 235 secs
lola: 90526442 markings, 124516971 edges, 378987 markings/sec, 240 secs
lola: 92234291 markings, 126887187 edges, 341570 markings/sec, 245 secs
lola: 94000730 markings, 129322757 edges, 353288 markings/sec, 250 secs
lola: 95829545 markings, 131843324 edges, 365763 markings/sec, 255 secs
lola: 97626375 markings, 134379130 edges, 359366 markings/sec, 260 secs
lola: 99468430 markings, 136928491 edges, 368411 markings/sec, 265 secs
lola: 101422489 markings, 139583211 edges, 390812 markings/sec, 270 secs
lola: 103291162 markings, 142190267 edges, 373735 markings/sec, 275 secs
lola: 105031535 markings, 144596996 edges, 348075 markings/sec, 280 secs
lola: 106847568 markings, 147109370 edges, 363207 markings/sec, 285 secs
lola: 108489871 markings, 149400511 edges, 328461 markings/sec, 290 secs
lola: 110180940 markings, 151742098 edges, 338214 markings/sec, 295 secs
lola: 112035590 markings, 154296026 edges, 370930 markings/sec, 300 secs
lola: 113924364 markings, 156882155 edges, 377755 markings/sec, 305 secs
lola: 115649351 markings, 159283944 edges, 344997 markings/sec, 310 secs
lola: 117351928 markings, 161633811 edges, 340515 markings/sec, 315 secs
lola: 119207047 markings, 164186128 edges, 371024 markings/sec, 320 secs
lola: 120686183 markings, 166223585 edges, 295827 markings/sec, 325 secs
lola: 122405575 markings, 168602695 edges, 343878 markings/sec, 330 secs
lola: 124092388 markings, 170990522 edges, 337363 markings/sec, 335 secs
lola: 125772356 markings, 173291166 edges, 335994 markings/sec, 340 secs
lola: 127240847 markings, 175308947 edges, 293698 markings/sec, 345 secs
lola: 128569462 markings, 177156059 edges, 265723 markings/sec, 350 secs
lola: 130028105 markings, 179185588 edges, 291729 markings/sec, 355 secs
lola: 131209558 markings, 180835292 edges, 236291 markings/sec, 360 secs
lola: 132668812 markings, 182825179 edges, 291851 markings/sec, 365 secs
lola: 134251885 markings, 185001649 edges, 316615 markings/sec, 370 secs
lola: 135603299 markings, 186882729 edges, 270283 markings/sec, 375 secs
lola: 136800992 markings, 188555395 edges, 239539 markings/sec, 380 secs
lola: 138167218 markings, 190452778 edges, 273245 markings/sec, 385 secs
lola: 139526751 markings, 192340898 edges, 271907 markings/sec, 390 secs
lola: 140942081 markings, 194280048 edges, 283066 markings/sec, 395 secs
lola: 142452897 markings, 196353082 edges, 302163 markings/sec, 400 secs
lola: 143499331 markings, 197803544 edges, 209287 markings/sec, 405 secs
lola: 145024839 markings, 199924540 edges, 305102 markings/sec, 410 secs
lola: 146715313 markings, 202243027 edges, 338095 markings/sec, 415 secs
lola: 148334293 markings, 204459280 edges, 323796 markings/sec, 420 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p200 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p200 <= p9)))
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p72 + 1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p72 + 1 <= p44)))
lola: processed formula length: 24
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p163 + 1 <= p25)) OR (p33 + 1 <= p212)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p163 + 1 <= p25)) OR (p33 + 1 <= p212)))
lola: processed formula length: 48
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 3137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p109 <= p8)) AND (p168 <= p205)) U G ((p168 <= p205)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p109 <= p8)) AND (p168 <= p205)) U G ((p168 <= p205)))
lola: processed formula length: 60
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 47 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((p88 <= p58)))) AND (G ((p33 <= p45)) AND (p33 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((p88 <= p58)))) AND (G ((p33 <= p45)) AND (p33 <= p45)))))
lola: processed formula length: 74
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 2141193 markings, 2368774 edges, 428239 markings/sec, 0 secs
lola: 4105889 markings, 5016454 edges, 392939 markings/sec, 5 secs
lola: 5933475 markings, 7535987 edges, 365517 markings/sec, 10 secs
lola: 7831243 markings, 10162851 edges, 379554 markings/sec, 15 secs
lola: 9706945 markings, 12760959 edges, 375140 markings/sec, 20 secs
lola: 11613543 markings, 15363326 edges, 381320 markings/sec, 25 secs
lola: 13476878 markings, 17974269 edges, 372667 markings/sec, 30 secs
lola: 15216562 markings, 20384458 edges, 347937 markings/sec, 35 secs
lola: 17130319 markings, 22995228 edges, 382751 markings/sec, 40 secs
lola: 18986581 markings, 25590905 edges, 371252 markings/sec, 45 secs
lola: 20875623 markings, 28174010 edges, 377808 markings/sec, 50 secs
lola: 22705418 markings, 30727390 edges, 365959 markings/sec, 55 secs
lola: 24596081 markings, 33324472 edges, 378133 markings/sec, 60 secs
lola: 26431973 markings, 35885281 edges, 367178 markings/sec, 65 secs
lola: 28281090 markings, 38445618 edges, 369823 markings/sec, 70 secs
lola: 30023626 markings, 40846419 edges, 348507 markings/sec, 75 secs
lola: 31829625 markings, 43361253 edges, 361200 markings/sec, 80 secs
lola: 33689642 markings, 45924478 edges, 372003 markings/sec, 85 secs
lola: 35540153 markings, 48491058 edges, 370102 markings/sec, 90 secs
lola: 37277087 markings, 50879745 edges, 347387 markings/sec, 95 secs
lola: 39095958 markings, 53413720 edges, 363774 markings/sec, 100 secs
lola: 41008888 markings, 56030856 edges, 382586 markings/sec, 105 secs
lola: 42852880 markings, 58579615 edges, 368798 markings/sec, 110 secs
lola: 44697908 markings, 61144100 edges, 369006 markings/sec, 115 secs
lola: 46569971 markings, 63748127 edges, 374413 markings/sec, 120 secs
lola: 48453106 markings, 66343735 edges, 376627 markings/sec, 125 secs
lola: 50306317 markings, 68909771 edges, 370642 markings/sec, 130 secs
lola: 52176818 markings, 71470861 edges, 374100 markings/sec, 135 secs
lola: 53932313 markings, 73916482 edges, 351099 markings/sec, 140 secs
lola: 55764701 markings, 76466473 edges, 366478 markings/sec, 145 secs
lola: 57614275 markings, 78987020 edges, 369915 markings/sec, 150 secs
lola: 59438719 markings, 81511565 edges, 364889 markings/sec, 155 secs
lola: 61279022 markings, 84094248 edges, 368061 markings/sec, 160 secs
lola: 63169459 markings, 86673399 edges, 378087 markings/sec, 165 secs
lola: 65009719 markings, 89230753 edges, 368052 markings/sec, 170 secs
lola: 66845582 markings, 91774273 edges, 367173 markings/sec, 175 secs
lola: 68706817 markings, 94338703 edges, 372247 markings/sec, 180 secs
lola: 70570520 markings, 96941727 edges, 372741 markings/sec, 185 secs
lola: 72433788 markings, 99502826 edges, 372654 markings/sec, 190 secs
lola: 74260222 markings, 102041417 edges, 365287 markings/sec, 195 secs
lola: 76077907 markings, 104558478 edges, 363537 markings/sec, 200 secs
lola: 77936510 markings, 107095080 edges, 371721 markings/sec, 205 secs
lola: 79773953 markings, 109682344 edges, 367489 markings/sec, 210 secs
lola: 81630114 markings, 112211315 edges, 371232 markings/sec, 215 secs
lola: 83431770 markings, 114723230 edges, 360331 markings/sec, 220 secs
lola: 85241484 markings, 117217645 edges, 361943 markings/sec, 225 secs
lola: 87062470 markings, 119716387 edges, 364197 markings/sec, 230 secs
lola: 88876995 markings, 122264849 edges, 362905 markings/sec, 235 secs
lola: 90728793 markings, 124817058 edges, 370360 markings/sec, 240 secs
lola: 92524883 markings, 127316741 edges, 359218 markings/sec, 245 secs
lola: 94309388 markings, 129791483 edges, 356901 markings/sec, 250 secs
lola: 96115406 markings, 132277363 edges, 361204 markings/sec, 255 secs
lola: 97945884 markings, 134775137 edges, 366096 markings/sec, 260 secs
lola: 99762980 markings, 137319490 edges, 363419 markings/sec, 265 secs
lola: 101670629 markings, 139959653 edges, 381530 markings/sec, 270 secs
lola: 103540285 markings, 142548450 edges, 373931 markings/sec, 275 secs
lola: 105433229 markings, 145136818 edges, 378589 markings/sec, 280 secs
lola: 107294794 markings, 147708766 edges, 372313 markings/sec, 285 secs
lola: 109140799 markings, 150286352 edges, 369201 markings/sec, 290 secs
lola: 111009003 markings, 152873604 edges, 373641 markings/sec, 295 secs
lola: 112914578 markings, 155499141 edges, 381115 markings/sec, 300 secs
lola: 114745372 markings, 158054054 edges, 366159 markings/sec, 305 secs
lola: 116582567 markings, 160579833 edges, 367439 markings/sec, 310 secs
lola: 118399252 markings, 163095775 edges, 363337 markings/sec, 315 secs
lola: 120228753 markings, 165617736 edges, 365900 markings/sec, 320 secs
lola: 121935335 markings, 167990170 edges, 341316 markings/sec, 325 secs
lola: 123632100 markings, 170309469 edges, 339353 markings/sec, 330 secs
lola: 124741189 markings, 171869966 edges, 221818 markings/sec, 335 secs
lola: 126174891 markings, 173819128 edges, 286740 markings/sec, 340 secs
lola: 127688908 markings, 175960157 edges, 302803 markings/sec, 345 secs
lola: 129120522 markings, 177914696 edges, 286323 markings/sec, 350 secs
lola: 130529770 markings, 179889513 edges, 281850 markings/sec, 355 secs
lola: 131971015 markings, 181860418 edges, 288249 markings/sec, 360 secs
lola: 133599762 markings, 184094532 edges, 325749 markings/sec, 365 secs
lola: 135193708 markings, 186281534 edges, 318789 markings/sec, 370 secs
lola: 136864252 markings, 188651741 edges, 334109 markings/sec, 375 secs
lola: 138300938 markings, 190644659 edges, 287337 markings/sec, 380 secs
lola: 139823929 markings, 192732459 edges, 304598 markings/sec, 385 secs
lola: 141275376 markings, 194713834 edges, 290289 markings/sec, 390 secs
lola: 142952307 markings, 197039488 edges, 335386 markings/sec, 395 secs
lola: 144433181 markings, 199107924 edges, 296175 markings/sec, 400 secs
lola: 145938630 markings, 201190978 edges, 301090 markings/sec, 405 secs
lola: 147220701 markings, 202970560 edges, 256414 markings/sec, 410 secs
lola: 148503531 markings, 204716246 edges, 256566 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no yes unknown yes
lola:
preliminary result: no yes no no no yes unknown yes
lola: memory consumption: 3552 KB
lola: time consumption: 857 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882900769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;