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

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

=== Now, execution of the tool begins

BK_START 1591178432914

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:00:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:00:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:00:35] [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:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 708 ms
[2020-06-03 10:00:36] [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:36] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 33 ms.
[2020-06-03 10:00:36] [INFO ] Computed order based on color domains.
[2020-06-03 10:00:36] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 24 ms.
[2020-06-03 10:00:36] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9828 resets, run finished after 1062 ms. (steps per millisecond=94 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:00:37] [INFO ] Computed 155 place invariants in 19 ms
[2020-06-03 10:00:38] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 10:00:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 73 ms returned sat
[2020-06-03 10:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:38] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2020-06-03 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-03 10:00:38] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:38] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 10:00:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 15 ms.
[2020-06-03 10:00:39] [INFO ] Added : 48 causal constraints over 10 iterations in 254 ms. Result :sat
[2020-06-03 10:00:39] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:00:39] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 82 ms returned sat
[2020-06-03 10:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:39] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-03 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:00:39] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:39] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-06-03 10:00:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:39] [INFO ] Added : 48 causal constraints over 10 iterations in 95 ms. Result :sat
[2020-06-03 10:00:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-06-03 10:00:39] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-03 10:00:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:00:40] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-03 10:00:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:40] [INFO ] Added : 42 causal constraints over 9 iterations in 131 ms. Result :sat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-06-03 10:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-03 10:00:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:41] [INFO ] Added : 48 causal constraints over 10 iterations in 119 ms. Result :sat
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-06-03 10:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 10:00:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:41] [INFO ] Added : 61 causal constraints over 13 iterations in 164 ms. Result :sat
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:42] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 10:00:42] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:42] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-06-03 10:00:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:42] [INFO ] Added : 52 causal constraints over 11 iterations in 125 ms. Result :sat
[2020-06-03 10:00:42] [INFO ] [Real]Absence check using 11 positive place invariants in 43 ms returned sat
[2020-06-03 10:00:42] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2020-06-03 10:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:43] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-06-03 10:00:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-06-03 10:00:43] [INFO ] Added : 19 causal constraints over 4 iterations in 63 ms. Result :sat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-06-03 10:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:44] [INFO ] Added : 50 causal constraints over 10 iterations in 119 ms. Result :sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2020-06-03 10:00:44] [INFO ] Added : 39 causal constraints over 8 iterations in 114 ms. Result :sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-03 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-06-03 10:00:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:45] [INFO ] Added : 20 causal constraints over 4 iterations in 54 ms. Result :sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 53 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-06-03 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2020-06-03 10:00:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:46] [INFO ] Added : 50 causal constraints over 10 iterations in 104 ms. Result :sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:00:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 51 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-06-03 10:00:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:47] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-03 10:00:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:47] [INFO ] Added : 50 causal constraints over 10 iterations in 107 ms. Result :sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-03 10:00:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:47] [INFO ] Added : 42 causal constraints over 9 iterations in 99 ms. Result :sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-06-03 10:00:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 53 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2020-06-03 10:00:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:48] [INFO ] Added : 47 causal constraints over 10 iterations in 121 ms. Result :sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-03 10:00:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:49] [INFO ] Added : 41 causal constraints over 9 iterations in 108 ms. Result :sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-03 10:00:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:49] [INFO ] Added : 42 causal constraints over 9 iterations in 106 ms. Result :sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 52 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 53 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:50] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-06-03 10:00:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:00:50] [INFO ] Added : 16 causal constraints over 4 iterations in 45 ms. Result :sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2020-06-03 10:00:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:51] [INFO ] Added : 42 causal constraints over 9 iterations in 120 ms. Result :sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-06-03 10:00:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:51] [INFO ] Added : 52 causal constraints over 11 iterations in 156 ms. Result :sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 10:00:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:52] [INFO ] Added : 39 causal constraints over 8 iterations in 87 ms. Result :sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-06-03 10:00:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:52] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-06-03 10:00:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:52] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2020-06-03 10:00:53] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 10:00:53] [INFO ] Flatten gal took : 61 ms
FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:00:53] [INFO ] Applying decomposition
[2020-06-03 10:00:53] [INFO ] Flatten gal took : 22 ms
[2020-06-03 10:00:53] [INFO ] Decomposing Gal with order
[2020-06-03 10:00:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 10:00:53] [INFO ] Removed a total of 104 redundant transitions.
[2020-06-03 10:00:53] [INFO ] Flatten gal took : 65 ms
[2020-06-03 10:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2020-06-03 10:00:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 10:00:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-COL-06 @ 3570 seconds

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

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

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

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

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

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

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

FORMULA QuasiCertifProtocol-COL-06-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3342
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:00:53 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) U (2 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) U X (F ((((1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171) U (1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) AND (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0)))))",
"processed_size": 299,
"rewrites": 39
},
"result":
{
"edges": 2625096,
"markings": 512346,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))) U ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) U (p0 + 1 <= p1)))))",
"processed_size": 146,
"rewrites": 39
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(F ((p257 + 1 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) U G ((X (F ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p257))) OR G ((1 <= p261)))))",
"processed_size": 158,
"rewrites": 39
},
"result":
{
"edges": 194372654,
"markings": 13823154,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 480
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 63,
"visible_transitions": 0
},
"processed": "((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))",
"processed_size": 403,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "G ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))",
"processed_size": 304,
"rewrites": 39
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))",
"processed_size": 102,
"rewrites": 39
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"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": "(p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p260)",
"processed_size": 56,
"rewrites": 41
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G (F ((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p186 + p192 + p191 + p190 + p189 + p188 + p187)))",
"processed_size": 110,
"rewrites": 39
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "F (G (((2 <= p1) OR (p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p172 + p178 + p177 + p176 + p175 + p174 + p173))))",
"processed_size": 122,
"rewrites": 39
},
"result":
{
"edges": 17069164,
"markings": 2124727,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1114
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 7,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 47,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "F ((((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR (1 <= p260)) AND (F ((p260 <= 0)) OR G (((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR (1 <= p260))))))",
"processed_size": 416,
"rewrites": 39
},
"result":
{
"edges": 167869,
"markings": 27253,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 25
},
"compoundnumber": 7,
"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": 1671
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1671
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((p1 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) AND (p2 <= 0))",
"processed_size": 74,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p227 + p226 + p225 + p224 + p223 + p222 + p221))",
"processed_size": 102,
"rewrites": 39
},
"result":
{
"edges": 68487,
"markings": 15332,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3342
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 <= p3)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 47
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 <= p3)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 47
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= 1)))",
"processed_size": 61,
"rewrites": 39
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23396,
"runtime": 228.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) OR G(F(*))) : (G(**) OR **) : ((F(**) U **) U X(F(((** U **) AND **)))) : F(*) : X(X((X(F(**)) U (** U **)))) : (F(*) U G((X(F(**)) OR G(**)))) : G(F(*)) : F(G(**)) : ((X(**) OR (G(**) AND X(F(**)))) AND ((** U **) OR (** U **))) : F((((G(F(*)) AND *) OR *) AND (F(*) OR G(((G(F(*)) AND *) OR *)))))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no no no no yes no no yes yes ",
"value": "no no no no no yes no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 LTLCardinality.xml
lola: (((0 <= 0) U (p3 + 1 <= p2)) OR G (NOT(G ((2 <= p227 + p226 + p225 + p224 + p223 + p222 + p221))))) : (G ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p227 + p226 + p225 + p224 + p223 + p222 + p221)) OR ((p1 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) AND (p2 <= 0))) : ((F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) U (2 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) U X (F ((((1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171) U (1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) AND (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0))))) : NOT(G ((p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p260))) : X (X ((X (((0 <= 0) U (2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))) U ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) U (p0 + 1 <= p1))))) : (NOT(G ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p257))) U G ((F (X ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p257))) OR G ((1 <= p261))))) : F (X (G (NOT(G ((p186 + p192 + p191 + p190 + p189 + p188 + p187 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)))))) : F (G (F (G (((2 <= p1) OR (p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p172 + p178 + p177 + p176 + p175 + p174 + p173)))))) : ((G ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))) AND (((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) OR (((1 <= p262) AND (p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) U (3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : F (NOT((G ((1 <= p260)) U ((F (G ((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p200 + p205 + p206 + p204 + p203 + p202 + p201))) OR (p256 + 1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) AND (p260 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) U (2 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) U X (F ((((1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171) U (1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) AND (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) U (2 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) U X (F ((((1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171) U (1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) AND (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0)))))
lola: processed formula length: 299
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 512346 markings, 2625096 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))) U ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) U (p0 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))) U ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242) U (p0 + 1 <= p1)))))
lola: processed formula length: 146
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p257 + 1 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) U G ((X (F ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p257))) OR G ((1 <= p261)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p257 + 1 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) U G ((X (F ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p257))) OR G ((1 <= p261)))))
lola: processed formula length: 158
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: 734066 markings, 4230745 edges, 146813 markings/sec, 0 secs
lola: 1370109 markings, 8497414 edges, 127209 markings/sec, 5 secs
lola: 1764759 markings, 13482312 edges, 78930 markings/sec, 10 secs
lola: 2155186 markings, 18514696 edges, 78085 markings/sec, 15 secs
lola: 2529405 markings, 22981841 edges, 74844 markings/sec, 20 secs
lola: 2834787 markings, 27873073 edges, 61076 markings/sec, 25 secs
lola: 3092176 markings, 32789031 edges, 51478 markings/sec, 30 secs
lola: 3394491 markings, 37877054 edges, 60463 markings/sec, 35 secs
lola: 3769871 markings, 42934864 edges, 75076 markings/sec, 40 secs
lola: 4149131 markings, 47627878 edges, 75852 markings/sec, 45 secs
lola: 4408122 markings, 52252224 edges, 51798 markings/sec, 50 secs
lola: 4811833 markings, 57287808 edges, 80742 markings/sec, 55 secs
lola: 5290137 markings, 62329143 edges, 95661 markings/sec, 60 secs
lola: 5637809 markings, 66937877 edges, 69534 markings/sec, 65 secs
lola: 5981617 markings, 71456258 edges, 68762 markings/sec, 70 secs
lola: 6243312 markings, 76346222 edges, 52339 markings/sec, 75 secs
lola: 6571533 markings, 81260835 edges, 65644 markings/sec, 80 secs
lola: 6920104 markings, 86164959 edges, 69714 markings/sec, 85 secs
lola: 7314245 markings, 90998219 edges, 78828 markings/sec, 90 secs
lola: 7621310 markings, 95520956 edges, 61413 markings/sec, 95 secs
lola: 7888384 markings, 100424204 edges, 53415 markings/sec, 100 secs
lola: 8157375 markings, 105314324 edges, 53798 markings/sec, 105 secs
lola: 8384998 markings, 109885588 edges, 45525 markings/sec, 110 secs
lola: 8580645 markings, 114190181 edges, 39129 markings/sec, 115 secs
lola: 8793982 markings, 118773497 edges, 42667 markings/sec, 120 secs
lola: 9057628 markings, 123616123 edges, 52729 markings/sec, 125 secs
lola: 9294035 markings, 128374832 edges, 47281 markings/sec, 130 secs
lola: 9544386 markings, 133316878 edges, 50070 markings/sec, 135 secs
lola: 9859901 markings, 138305754 edges, 63103 markings/sec, 140 secs
lola: 10207095 markings, 143287729 edges, 69439 markings/sec, 145 secs
lola: 10639628 markings, 148216520 edges, 86507 markings/sec, 150 secs
lola: 10922743 markings, 153209885 edges, 56623 markings/sec, 155 secs
lola: 11152355 markings, 158184649 edges, 45922 markings/sec, 160 secs
lola: 11413460 markings, 163156535 edges, 52221 markings/sec, 165 secs
lola: 11786386 markings, 168135208 edges, 74585 markings/sec, 170 secs
lola: 12100737 markings, 173158612 edges, 62870 markings/sec, 175 secs
lola: 12453957 markings, 178137851 edges, 70644 markings/sec, 180 secs
lola: 12874032 markings, 183151718 edges, 84015 markings/sec, 185 secs
lola: 13285124 markings, 187809765 edges, 82218 markings/sec, 190 secs
lola: 13642259 markings, 192272117 edges, 71427 markings/sec, 195 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: 13823154 markings, 194372654 edges
lola: ========================================
lola: subprocess 3 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) OR (G ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p23... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p23... (shortened)
lola: processed formula length: 403
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))
lola: processed formula length: 304
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= p241 + p240 + p239 + p238 + p237 + p236 + p235))
lola: processed formula length: 102
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p260 + 1 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p260)
lola: processed formula length: 56
lola: 41 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p186 + p192 + p191 + p190 + p189 + p188 + p187)))
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 ((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p186 + p192 + p191 + p190 + p189 + p188 + p187)))
lola: processed formula length: 110
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 6 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p1) OR (p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p172 + p178 + p177 + p176 + p175 + p174 + p173))))
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 (((2 <= p1) OR (p220 + p219 + p218 + p217 + p216 + p215 + p214 <= p172 + p178 + p177 + p176 + p175 + p174 + p173))))
lola: processed formula length: 122
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 631790 markings, 4459543 edges, 126358 markings/sec, 0 secs
lola: 1221423 markings, 9034027 edges, 117927 markings/sec, 5 secs
lola: 1724306 markings, 13699016 edges, 100577 markings/sec, 10 secs
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: 2124727 markings, 17069164 edges
lola: ========================================
lola: subprocess 7 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR (1 <= p260)) AND (F ((p260 <= 0)) OR G (((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR (1 <= p260)) AND (F ((p260 <= 0)) OR G (((G (F ((p200 + p205 + p206 + p204 + p203 + p202 + p201 + 1 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p256)) OR ... (shortened)
lola: processed formula length: 416
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 25 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 27253 markings, 167869 edges
lola: ========================================
lola: subprocess 8 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p227 + p226 + p225 + p224 + p223 + p222 + p221)) OR ((p1 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) AND (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) AND (p2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 + 1 <= p158 + p164 + p163 + p162 + p161 + p160 + p159) AND (p2 <= 0))
lola: processed formula length: 74
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p227 + p226 + p225 + p224 + p223 + p222 + p221))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p254 + p253 + p252 + p251 + p250 + p249 + p255 <= p227 + p226 + p225 + p224 + p223 + p222 + p221))
lola: processed formula length: 102
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15332 markings, 68487 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p3 + 1 <= p2)) OR G (F ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p3 + 1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= p3)
lola: processed formula length: 10
lola: 41 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 63 markings, 62 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((p3 + 1 <= p2)) OR G (F ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p3 + 1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= p3)
lola: processed formula length: 10
lola: 41 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 63 markings, 62 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= 1)))
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 ((p227 + p226 + p225 + p224 + p223 + p222 + p221 <= 1)))
lola: processed formula length: 61
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no yes yes
lola:
preliminary result: no no no no no yes no no yes yes
lola: memory consumption: 23396 KB
lola: time consumption: 228 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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