About the Execution of ITS-LoLa for QuasiCertifProtocol-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.920 | 3600000.00 | 69370.00 | 609.20 | T?FFTFFFFFFFFTTT | 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.r176-tajo-158987872300731.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-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591178451994
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:00:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:00:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:00:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2020-06-03 10:00:54] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,
[2020-06-03 10:00:54] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 15 ms.
[2020-06-03 10:00:54] [INFO ] Computed order based on color domains.
[2020-06-03 10:00:54] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 10 ms.
[2020-06-03 10:00:54] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Incomplete random walk after 100000 steps, including 9832 resets, run finished after 632 ms. (steps per millisecond=158 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:00:55] [INFO ] Computed 155 place invariants in 25 ms
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 66 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-06-03 10:00:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:59] [INFO ] [Nat]Absence check using state equation in 3274 ms returned unsat
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-06-03 10:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-06-03 10:00:59] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:59] [INFO ] Added : 38 causal constraints over 8 iterations in 121 ms. Result :sat
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2020-06-03 10:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 10:00:59] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:59] [INFO ] Added : 17 causal constraints over 4 iterations in 52 ms. Result :sat
[2020-06-03 10:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 10:01:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:00] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-06-03 10:01:00] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 16 ms.
[2020-06-03 10:01:00] [INFO ] Added : 50 causal constraints over 10 iterations in 128 ms. Result :sat
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned unsat
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2020-06-03 10:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:00] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-03 10:01:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:01] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-03 10:01:01] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:01:01] [INFO ] Added : 41 causal constraints over 9 iterations in 101 ms. Result :sat
[2020-06-03 10:01:01] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:01] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-06-03 10:01:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:02] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-06-03 10:01:02] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:01:02] [INFO ] Added : 19 causal constraints over 4 iterations in 62 ms. Result :sat
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 51 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-06-03 10:01:02] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:01:02] [INFO ] Added : 20 causal constraints over 4 iterations in 65 ms. Result :sat
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:02] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 10:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:03] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:01:03] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:01:03] [INFO ] Added : 40 causal constraints over 8 iterations in 87 ms. Result :sat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 64 ms returned sat
[2020-06-03 10:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:01:03] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:03] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:01:03] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:04] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-06-03 10:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:04] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-06-03 10:01:04] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:01:04] [INFO ] Added : 52 causal constraints over 11 iterations in 133 ms. Result :sat
[2020-06-03 10:01:04] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:04] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 10:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:05] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:01:05] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:01:05] [INFO ] Added : 48 causal constraints over 10 iterations in 131 ms. Result :sat
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-03 10:01:05] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:05] [INFO ] Added : 41 causal constraints over 9 iterations in 100 ms. Result :sat
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-06-03 10:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:05] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:01:06] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:06] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2020-06-03 10:01:06] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:01:06] [INFO ] Added : 50 causal constraints over 10 iterations in 147 ms. Result :sat
[2020-06-03 10:01:06] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:06] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-06-03 10:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:06] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-03 10:01:06] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 19 ms.
[2020-06-03 10:01:06] [INFO ] Added : 42 causal constraints over 9 iterations in 111 ms. Result :sat
[2020-06-03 10:01:06] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 60 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:01:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:07] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-06-03 10:01:07] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-06-03 10:01:07] [INFO ] Added : 17 causal constraints over 4 iterations in 86 ms. Result :sat
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-06-03 10:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:07] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2020-06-03 10:01:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:08] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2020-06-03 10:01:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:01:08] [INFO ] Added : 17 causal constraints over 4 iterations in 50 ms. Result :sat
[2020-06-03 10:01:08] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-03 10:01:08] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 73 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:08] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 10:01:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:09] [INFO ] [Nat]Absence check using state equation in 501 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 10:01:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:01:09] [INFO ] Flatten gal took : 70 ms
[2020-06-03 10:01:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:01:09] [INFO ] Flatten gal took : 34 ms
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:01:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2020-06-03 10:01:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-COL-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ QuasiCertifProtocol-COL-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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:01:09 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p257)",
"processed_size": 56,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(3 <= p200 + p205 + p206 + p204 + p203 + p202 + p201)",
"processed_size": 53,
"rewrites": 27
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p257 <= 0)",
"processed_size": 11,
"rewrites": 26
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= 0) AND (p256 + 1 <= p1))",
"processed_size": 76,
"rewrites": 27
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p256)",
"processed_size": 11,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "A (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0)))",
"processed_size": 300,
"rewrites": 26
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))",
"processed_size": 61,
"rewrites": 26
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))",
"processed_size": 61,
"rewrites": 26
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 59,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "A (G (((p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p227 + p226 + p225 + p224 + p223 + p222 + p221) OR (1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (((3 <= p0) OR (p234 + p233 + p232 + p231 + p230 + p229 + p228 <= p0)) AND ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p158 + p164 + p163 + p162 + p161 + p160 + p159))) OR ((3 <= p254 + p253 + p252 + p251 + p250 + p249 + p255) AND (p258 <= p220 + p219 + p218 + p217 + p216 + p215 + p214)))))",
"processed_size": 482,
"rewrites": 26
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 65,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 65,
"visible_transitions": 0
},
"processed": "((p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) OR (p257 + 1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (p258 <= 0))",
"processed_size": 424,
"rewrites": 27
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 47
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AG(E((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p261) U (1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)))",
"processed_size": 119,
"rewrites": 26
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 130,
"markings": 55,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "AG(((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) OR EF((p3 <= p258))))",
"processed_size": 124,
"rewrites": 26
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 18393323,
"markings": 1951224,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "E(AG((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) U AG((3 <= p227 + p226 + p225 + p224 + p223 + p222 + p221)))",
"processed_size": 165,
"rewrites": 27
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 37,
"markings": 36,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 23492,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : (NODEADLOCK AND E(G(A(F(**))))) : E((A(G(**)) U A(G(**)))) : (** AND (A(F(**)) AND (E(X(**)) OR **))) : E(X(E(G(*)))) : A(X(A(G(**)))) : A(G(**)) : A(F(**)) : (A(G(*)) AND (E(X(**)) AND (E(X(**)) OR **))) : A(G(*)) : A(G(E((** U **)))) : A(G((** OR E(F(**))))) : A(G(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"interim_value": "yes unknown no no yes no no no no no no no no ",
"preliminary_value": "yes unknown no no yes no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 CTLCardinality.xml
lola: E (G ((0 <= 0))) : (E (X ((0 <= 0))) AND E (G (A (F ((p261 <= p172 + p178 + p177 + p176 + p175 + p174 + p173)))))) : E ((A (G ((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) U A (G ((3 <= p227 + p226 + p225 + p224 + p223 + p222 + p221))))) : (((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p257) AND A (((0 <= 0) U (p200 + p205 + p206 + p204 + p203 + p202 + p201 <= 2)))) AND (E (X ((3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) OR (p2 <= 1))) : E (X (NOT(A (F ((1 <= p257)))))) : A (G (A (X (((1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) OR (p1 <= p256)))))) : A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208 + p207))) : (E (X ((1 <= 0))) OR A (F (((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= p220 + p219 + p218 + p217 + p216 + p215 + p214) AND (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p257) AND (1 <= p258))))) : ((NOT(E (((0 <= 0) U (1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))) AND E (X (((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) OR (1 <= p3))))) AND (E (X ((p260 <= p158 + p164 + p163 + p162 + p161 + p160 + p159))) OR (1 <= p256))) : NOT(E (F ((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= 0)))) : A (G (E (((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p261) U (1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))))) : A (G (((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) OR E (F ((p3 <= p258)))))) : A (G (((p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p227 + p226 + p225 + p224 + p223 + p222 + p221) OR (1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (((3 <= p0) OR (p234 + p233 + p232 + p231 + p230 + p229 + p228 <= p0)) AND ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p158 + p164 + p163 + p162 + p161 + p160 + p159))) OR ((3 <= p254 + p253 + p252 + p251 + p250 + p249 + p255) AND (p258 <= p220 + p219 + p218 + p217 + p216 + p215 + p214)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p257) AND (A (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= 2))) AND (E (X ((3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) OR (p2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p257)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p257)
lola: processed formula length: 56
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (3 <= p200 + p205 + p206 + p204 + p203 + p202 + p201)
lola: processed formula length: 53
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p200 + p205 + p206 + p204 + p203 + p202 + p201 <= 2)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 19 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p257 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p257 <= 0)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p257 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved from some successor.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) OR (p1 <= p256))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= 0) AND (p256 + 1 <= p1))
lola: processed formula length: 76
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= 0) AND (p256 + 1 <= p1))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 36 markings, 35 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0))) AND (E (X (((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p158 + p164 + p163 + p162 + p161 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p256)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p256)
lola: processed formula length: 11
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0)))
lola: processed formula length: 300
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))
lola: processed formula length: 61
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p213 + p212 + p211 + p210 + p209 + p208 + p207 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((1 <= p213 + p212 + p211 + p210 + p209 + p208 + p207)))
lola: processed formula length: 61
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: formula 0: (p213 + p212 + p211 + p210 + p209 + p208 + p207 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p227 + p226 + p225 + p224 + p223 + p222 + p221) OR (1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (((3 <= p0) OR (p234 + p233 + p232 + p231 + p230 + p229 + p228 <= p0)) AND ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p158 + p164 + p163 + p162 + p161 + p160 + p159))) OR ((3 <= p254 + p253 + p252 + p251 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p227 + p226 + p225 + p224 + p223 + p222 + p221) OR (1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185) OR (((3 <= p0) OR (p234 + p233 + p232 + p231 + p230 + p229 + p228 <= p0)) AND ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269) OR (2 <= p158 + p164 + p163 + p162 + p161 + p160 + p159))) OR ((3 <= p254 + p253 + p252 + p251 + p2... (shortened)
lola: processed formula length: 482
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: formula 0: ((p227 + p226 + p225 + p224 + p223 + p222 + p221 + 1 <= p220 + p219 + p218 + p217 + p216 + p215 + p214) AND (p179 + p180 + p181 + p182 + p183 + p184 + p185 <= 0) AND (((p0 <= 2) AND (p0 + 1 <= p234 + p233 + p232 + p231 + p230 + p229 + p228)) OR ((p263 + p264 + p265 + p266 + p267 + p268 + p269 <= 0) AND (p158 + p164 + p163 + p162 + p161 + p160 + p159 <= 1))) AND ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 2) OR (p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p258)))
lola: 10 markings, 9 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= p220 + p219 + p218 + p217 + p216 + p215 + p214) AND (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) OR (p257 + 1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51... (shortened)
lola: processed formula length: 424
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: 14 markings, 13 edges
lola: formula 0: ((p158 + p164 + p163 + p162 + p161 + p160 + p159 <= p220 + p219 + p218 + p217 + p216 + p215 + p214) AND (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p257) AND (1 <= p258))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p261) U (1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p261) U (1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)))
lola: processed formula length: 119
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 55 markings, 130 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) OR E (F ((p3 <= p258))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) OR EF((p3 <= p258))))
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 694054 markings, 4527760 edges, 138811 markings/sec, 0 secs
lola: 1308561 markings, 9076743 edges, 122901 markings/sec, 5 secs
lola: 1872890 markings, 13543963 edges, 112866 markings/sec, 10 secs
lola: 1951161 markings, 18339759 edges, 15654 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1951224 markings, 18393323 edges
lola: ========================================
lola: subprocess 11 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) U A (G ((3 <= p227 + p226 + p225 + p224 + p223 + p222 + p221)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AG((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) U AG((3 <= p227 + p226 + p225 + p224 + p223 + p222 + p221)))
lola: processed formula length: 165
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 36 markings, 37 edges
lola: ========================================
lola: subprocess 12 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND E (G (A (F ((p261 <= p172 + p178 + p177 + p176 + p175 + p174 + p173))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: yes unknown no no yes no no no no no no no no
lola:
preliminary result: yes unknown no no yes no no no no no no no no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown no no yes no no no no no no no no
lola: memory consumption: 23492 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: memory consumption: 23492 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16120200 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16119932 kB
--------------------
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-COL-06"
export BK_EXAMINATION="CTLCardinality"
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-COL-06, examination is CTLCardinality"
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-158987872300731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;