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.r176-tajo-158987872400786.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 QuasiCertifProtocol-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400786
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.8K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 153K 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 QuasiCertifProtocol-PT-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15

=== Now, execution of the tool begins

BK_START 1591181884200

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:58:05] [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 10:58:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:58:05] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-06-03 10:58:05] [INFO ] Transformed 270 places.
[2020-06-03 10:58:05] [INFO ] Transformed 116 transitions.
[2020-06-03 10:58:05] [INFO ] Parsed PT model containing 270 places and 116 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9825 resets, run finished after 529 ms. (steps per millisecond=189 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:58:06] [INFO ] Computed 155 place invariants in 25 ms
[2020-06-03 10:58:06] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-06-03 10:58:06] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 73 ms returned sat
[2020-06-03 10:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:58:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 47 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:07] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2020-06-03 10:58:07] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:58:07] [INFO ] Added : 10 causal constraints over 2 iterations in 47 ms. Result :sat
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 10:58:07] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:07] [INFO ] Added : 18 causal constraints over 4 iterations in 63 ms. Result :sat
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2020-06-03 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:58:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:08] [INFO ] Added : 11 causal constraints over 3 iterations in 49 ms. Result :sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-06-03 10:58:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:58:08] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 10:58:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:58:08] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2020-06-03 10:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:08] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 10:58:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:58:09] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 10:58:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:09] [INFO ] Added : 12 causal constraints over 3 iterations in 68 ms. Result :sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 10:58:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:58:09] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 62 ms returned sat
[2020-06-03 10:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:09] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-03 10:58:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:58:10] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:58:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:10] [INFO ] Added : 26 causal constraints over 6 iterations in 73 ms. Result :sat
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:10] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-06-03 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2020-06-03 10:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:11] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-06-03 10:58:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:11] [INFO ] Added : 48 causal constraints over 10 iterations in 150 ms. Result :sat
[2020-06-03 10:58:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:11] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2020-06-03 10:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:11] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-06-03 10:58:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:11] [INFO ] Added : 26 causal constraints over 6 iterations in 97 ms. Result :sat
[2020-06-03 10:58:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:11] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 57 ms returned sat
[2020-06-03 10:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-03 10:58:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:12] [INFO ] Added : 20 causal constraints over 4 iterations in 61 ms. Result :sat
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 10:58:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:58:12] [INFO ] Added : 17 causal constraints over 4 iterations in 59 ms. Result :sat
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:12] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-03 10:58:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-06-03 10:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:13] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:58:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-06-03 10:58:13] [INFO ] Added : 17 causal constraints over 4 iterations in 91 ms. Result :sat
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 58 ms returned sat
[2020-06-03 10:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 10:58:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:13] [INFO ] Added : 26 causal constraints over 6 iterations in 76 ms. Result :sat
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 59 ms returned sat
[2020-06-03 10:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:13] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-06-03 10:58:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:14] [INFO ] Added : 43 causal constraints over 9 iterations in 111 ms. Result :sat
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:58:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:14] [INFO ] Added : 25 causal constraints over 5 iterations in 88 ms. Result :sat
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-06-03 10:58:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:14] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 75 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:58:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:15] [INFO ] Added : 12 causal constraints over 3 iterations in 60 ms. Result :sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:58:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:15] [INFO ] Added : 21 causal constraints over 5 iterations in 65 ms. Result :sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:58:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:16] [INFO ] Added : 50 causal constraints over 10 iterations in 175 ms. Result :sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 10:58:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:16] [INFO ] Added : 33 causal constraints over 7 iterations in 83 ms. Result :sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-03 10:58:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:17] [INFO ] Added : 49 causal constraints over 10 iterations in 102 ms. Result :sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 10:58:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 38 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-06-03 10:58:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:17] [INFO ] Added : 48 causal constraints over 10 iterations in 95 ms. Result :sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 10:58:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:18] [INFO ] Added : 12 causal constraints over 3 iterations in 52 ms. Result :sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 68 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 10:58:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:18] [INFO ] Added : 15 causal constraints over 3 iterations in 48 ms. Result :sat
[2020-06-03 10:58:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:58:18] [INFO ] Flatten gal took : 55 ms
FORMULA QuasiCertifProtocol-PT-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:58:18] [INFO ] Flatten gal took : 18 ms
[2020-06-03 10:58:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-03 10:58:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-PT-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA QuasiCertifProtocol-PT-06-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3519
rslt: Output for LTLFireability @ QuasiCertifProtocol-PT-06

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 14,
"adisj": 1,
"aneg": 8,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 7,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((((G (F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252))))) OR (1 <= p60)) R X ((1 <= p54))) AND (((p44 <= 0) OR (p251 <= 0)) AND (((p38 <= 0) OR (p222 <= 0)) AND (((p40 <= 0) OR (p224 <= 0)) AND (((p37 <= 0) OR (p223 <= 0)) AND (((p42 <= 0) OR (p249 <= 0)) AND (((p43 <= 0) OR (p221 <= 0)) AND ((p41 <= 0) OR (p252 <= 0)))))))))))",
"processed_size": 524,
"rewrites": 104
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 8,
"aneg": 0,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X ((X (((((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)) AND (p49 <= 0)))) OR F (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261)))))",
"processed_size": 387,
"rewrites": 104
},
"result":
{
"edges": 72,
"markings": 45,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X (F ((X (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261))) OR F (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))))",
"processed_size": 274,
"rewrites": 104
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p53) OR (((p0 <= 0) OR (p36 <= 0)) AND ((p0 <= 0) OR (p39 <= 0)) AND ((p0 <= 0) OR (p33 <= 0)) AND ((p0 <= 0) OR (p35 <= 0)) AND ((p0 <= 0) OR (p34 <= 0)) AND ((p0 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p30 <= 0)))))) AND (p53 <= 0)))",
"processed_size": 260,
"rewrites": 104
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 58,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "X (((1 <= p49) OR (F ((1 <= p49)) AND F (G ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219)) OR ((1 <= p22) AND (1 <= p175) AND (1 <= p178) AND (1 <= p184) AND (1 <= p189) AND (1 <= p200) AND (1 <= p212) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220))))))))",
"processed_size": 949,
"rewrites": 104
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X (X (F (((p0 <= 0) OR (p46 <= 0)))))) R F (((p0 <= 0) OR (p24 <= 0))))",
"processed_size": 77,
"rewrites": 104
},
"result":
{
"edges": 25682,
"markings": 11073,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p117) AND (1 <= p118) AND (1 <= p119) AND (1 <= p120) AND (1 <= p133) AND (1 <= p134) AND (1 <= p136) AND (1 <= p169))))",
"processed_size": 133,
"rewrites": 104
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((X (F (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0)))) AND G (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0) OR (1 <= p16)))))",
"processed_size": 286,
"rewrites": 104
},
"result":
{
"edges": 1036550,
"markings": 197307,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (F ((F ((1 <= p54)) OR G ((p9 <= 0)))))))",
"processed_size": 49,
"rewrites": 104
},
"result":
{
"edges": 171873,
"markings": 33024,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p29)))",
"processed_size": 30,
"rewrites": 104
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X ((G (((1 <= p0) AND (1 <= p29))) OR ((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))",
"processed_size": 168,
"rewrites": 104
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G (F (((p0 <= 0) OR (p29 <= 0)))) AND ((p53 <= 0) R ((p51 <= 0) OR (p233 <= 0)))))",
"processed_size": 88,
"rewrites": 104
},
"result":
{
"edges": 18511370,
"markings": 2329239,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3519
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))) AND ((1 <= p54) OR ((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))))))",
"processed_size": 239,
"rewrites": 104
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 57056,
"runtime": 51.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((((G(F(**)) OR *) R X(**)) AND (* AND (* AND (* AND (* AND (* AND (* AND *))))))))) : X((X(**) OR F(**))) : X(X(F((X(**) OR F(**))))) : F((X(F(*)) AND **)) : F(G((F(**) AND (** OR **)))) : X((** OR (F(**) AND F(G(**))))) : (X(X(X(F(*)))) R F(*)) : F(G(**)) : (G(F(**)) AND X(F(**))) : X((X(F(*)) AND G(*))) : X(X(X(F((F(**) OR G(*)))))) : F((G(F(*)) AND (* R *))) : (X(X((G(**) OR **))) OR G(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no yes no yes no no yes yes no no yes yes no ",
"value": "no yes no yes no no yes yes no no yes yes 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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: G (NOT(X ((((((((((NOT(G (F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))))) AND (p60 <= 0)) U NOT(X ((1 <= p54)))) OR ((1 <= p44) AND (1 <= p251))) OR ((1 <= p38) AND (1 <= p222))) OR ((1 <= p40) AND (1 <= p224))) OR ((1 <= p37) AND (1 <= p223))) OR ((1 <= p42) AND (1 <= p249))) OR ((1 <= p43) AND (1 <= p221))) OR ((1 <= p41) AND (1 <= p252)))))) : (X (X (((((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)) AND (p49 <= 0))))) OR X (F (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261))))) : F (X (X ((X (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261))) OR F (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250))))))) : F ((NOT(G (X (((p53 <= 0) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p30))))))) AND (p53 <= 0))) : F (G (((1 <= p54) U ((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))))) : X ((F (G ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219)) OR ((1 <= p22) AND (1 <= p175) AND (1 <= p178) AND (1 <= p184) AND (1 <= p189) AND (1 <= p200) AND (1 <= p212) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220))))) U (1 <= p49))) : NOT((G (X (X (X (((1 <= p0) AND (1 <= p46)))))) U G (((1 <= p0) AND (1 <= p24))))) : (F ((NOT(X (G (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))))) OR (p55 <= 0))) U G (X (X (F (G ((p55 <= 0))))))) : (F (G (F (((1 <= p117) AND (1 <= p118) AND (1 <= p119) AND (1 <= p120) AND (1 <= p133) AND (1 <= p134) AND (1 <= p136) AND (1 <= p169))))) AND F (X ((1 <= p53)))) : X ((NOT(G (X (((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218))))) AND NOT(F (((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218) AND (p16 <= 0)))))) : X (F (X ((F (X (((1 <= p55) U (1 <= p54)))) OR NOT(F (X (F ((1 <= p9))))))))) : NOT(G ((F (G (((1 <= p0) AND (1 <= p29)))) OR ((1 <= p53) U ((1 <= p51) AND (1 <= p233)))))) : (X (X ((G (((1 <= p0) AND (1 <= p29))) OR ((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250))))) OR G (((1 <= p0) AND (1 <= p29))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
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:318
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((G (F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252))))) OR (1 <= p60)) R X ((1 <= p54))) AND (((p44 <= 0) OR (p251 <= 0)) AND (((p38 <= 0) OR (p222 <= 0)) AND (((p40 <= 0) OR (p224 <= 0)) AND (((p37 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((G (F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252))))) OR (1 <= p60)) R X ((1 <= p54))) AND (((p44 <= 0) OR (p251 <= 0)) AND (((p38 <= 0) OR (p222 <= 0)) AND (((p40 <= 0) OR (p224 <= 0)) AND (((p37 <= 0) OR... (shortened)
lola: processed formula length: 524
lola: 104 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)) AND (p49 <= 0)))) OR F (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)) AND (p49 <= 0)))) OR F (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261)))))
lola: processed formula length: 387
lola: 104 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45 markings, 72 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261))) OR F (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261))) OR F (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))))
lola: processed formula length: 274
lola: 104 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p53) OR (((p0 <= 0) OR (p36 <= 0)) AND ((p0 <= 0) OR (p39 <= 0)) AND ((p0 <= 0) OR (p33 <= 0)) AND ((p0 <= 0) OR (p35 <= 0)) AND ((p0 <= 0) OR (p34 <= 0)) AND ((p0 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p30 <= 0)))))) AND (p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p53) OR (((p0 <= 0) OR (p36 <= 0)) AND ((p0 <= 0) OR (p39 <= 0)) AND ((p0 <= 0) OR (p33 <= 0)) AND ((p0 <= 0) OR (p35 <= 0)) AND ((p0 <= 0) OR (p34 <= 0)) AND ((p0 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p30 <= 0)))))) AND (p53 <= 0)))
lola: processed formula length: 260
lola: 104 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p49) OR (F ((1 <= p49)) AND F (G ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p49) OR (F ((1 <= p49)) AND F (G ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (... (shortened)
lola: processed formula length: 949
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (F (((p0 <= 0) OR (p46 <= 0)))))) R F (((p0 <= 0) OR (p24 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (X (F (((p0 <= 0) OR (p46 <= 0)))))) R F (((p0 <= 0) OR (p24 <= 0))))
lola: processed formula length: 77
lola: 104 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: 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: 11073 markings, 25682 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p117) AND (1 <= p118) AND (1 <= p119) AND (1 <= p120) AND (1 <= p133) AND (1 <= p134) AND (1 <= p136) AND (1 <= p169)))) AND X (F ((1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p117) AND (1 <= p118) AND (1 <= p119) AND (1 <= p120) AND (1 <= p133) AND (1 <= p134) AND (1 <= p136) AND (1 <= p169))))
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 (((1 <= p117) AND (1 <= p118) AND (1 <= p119) AND (1 <= p120) AND (1 <= p133) AND (1 <= p134) AND (1 <= p136) AND (1 <= p169))))
lola: processed formula length: 133
lola: 104 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0)))) AND G (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0) OR (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0)))) AND G (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0) OR (1 <= p16)))))
lola: processed formula length: 286
lola: 104 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: 197307 markings, 1036550 edges
lola: ========================================
lola: subprocess 8 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((F ((1 <= p54)) OR G ((p9 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((F ((1 <= p54)) OR G ((p9 <= 0)))))))
lola: processed formula length: 49
lola: 104 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 33024 markings, 171873 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((G (((1 <= p0) AND (1 <= p29))) OR ((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250))))) OR G (((1 <= p0) AND (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p29)))
lola: processed formula length: 30
lola: 104 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p0) AND (1 <= p29))) OR ((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p0) AND (1 <= p29))) OR ((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)))))
lola: processed formula length: 168
lola: 104 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p55 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p55 <= 0)))
lola: processed formula length: 18
lola: 104 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: 595856 markings, 3832063 edges, 119171 markings/sec, 0 secs
lola: 1131367 markings, 7619195 edges, 107102 markings/sec, 5 secs
lola: 1597215 markings, 11271071 edges, 93170 markings/sec, 10 secs
lola: 1941728 markings, 14965829 edges, 68903 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2156626 markings, 17110847 edges
lola: ========================================
lola: subprocess 11 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((p0 <= 0) OR (p29 <= 0)))) AND ((p53 <= 0) R ((p51 <= 0) OR (p233 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((p0 <= 0) OR (p29 <= 0)))) AND ((p53 <= 0) R ((p51 <= 0) OR (p233 <= 0)))))
lola: processed formula length: 88
lola: 104 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: 667083 markings, 4135452 edges, 133417 markings/sec, 0 secs
lola: 1248624 markings, 8373605 edges, 116308 markings/sec, 5 secs
lola: 1717782 markings, 12795590 edges, 93832 markings/sec, 10 secs
lola: 2154623 markings, 17104391 edges, 87368 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2329239 markings, 18511370 edges
lola: ========================================
lola: subprocess 12 will run for 3519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))) AND ((1 <= p54) OR ((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))) AND ((1 <= p54) OR ((1 <= p32) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p31))))))
lola: processed formula length: 239
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 13 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes yes no no yes yes no
lola:
preliminary result: no yes no yes no no yes yes no no yes yes no
lola: ========================================
lola: memory consumption: 57056 KB
lola: time consumption: 51 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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r176-tajo-158987872400786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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