Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600715.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Peterson-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600715
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 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 Peterson-PT-3-CTLCardinality-00
FORMULA_NAME Peterson-PT-3-CTLCardinality-01
FORMULA_NAME Peterson-PT-3-CTLCardinality-02
FORMULA_NAME Peterson-PT-3-CTLCardinality-03
FORMULA_NAME Peterson-PT-3-CTLCardinality-04
FORMULA_NAME Peterson-PT-3-CTLCardinality-05
FORMULA_NAME Peterson-PT-3-CTLCardinality-06
FORMULA_NAME Peterson-PT-3-CTLCardinality-07
FORMULA_NAME Peterson-PT-3-CTLCardinality-08
FORMULA_NAME Peterson-PT-3-CTLCardinality-09
FORMULA_NAME Peterson-PT-3-CTLCardinality-10
FORMULA_NAME Peterson-PT-3-CTLCardinality-11
FORMULA_NAME Peterson-PT-3-CTLCardinality-12
FORMULA_NAME Peterson-PT-3-CTLCardinality-13
FORMULA_NAME Peterson-PT-3-CTLCardinality-14
FORMULA_NAME Peterson-PT-3-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591163852181

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:57:35] [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 05:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:57:35] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-06-03 05:57:35] [INFO ] Transformed 244 places.
[2020-06-03 05:57:35] [INFO ] Transformed 332 transitions.
[2020-06-03 05:57:35] [INFO ] Parsed PT model containing 244 places and 332 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 72 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 476 ms. (steps per millisecond=210 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0]
[2020-06-03 05:57:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:57:36] [INFO ] Computed 15 place invariants in 26 ms
[2020-06-03 05:57:36] [INFO ] [Real]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:37] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2020-06-03 05:57:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:57:38] [INFO ] [Real]Added 66 Read/Feed constraints in 49 ms returned sat
[2020-06-03 05:57:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 168 ms returned sat
[2020-06-03 05:57:38] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:38] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2020-06-03 05:57:38] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 9 places in 247 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 11 places in 265 ms
[2020-06-03 05:57:39] [INFO ] Deduced a trap composed of 9 places in 96 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 60 places in 142 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 49 places in 225 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 49 places in 71 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 31 places in 104 ms
[2020-06-03 05:57:40] [INFO ] Deduced a trap composed of 45 places in 331 ms
[2020-06-03 05:57:41] [INFO ] Deduced a trap composed of 45 places in 141 ms
[2020-06-03 05:57:41] [INFO ] Deduced a trap composed of 27 places in 178 ms
[2020-06-03 05:57:41] [INFO ] Deduced a trap composed of 44 places in 201 ms
[2020-06-03 05:57:42] [INFO ] Deduced a trap composed of 16 places in 521 ms
[2020-06-03 05:57:42] [INFO ] Deduced a trap composed of 9 places in 533 ms
[2020-06-03 05:57:43] [INFO ] Deduced a trap composed of 49 places in 272 ms
[2020-06-03 05:57:43] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-06-03 05:57:43] [INFO ] Deduced a trap composed of 30 places in 333 ms
[2020-06-03 05:57:43] [INFO ] Deduced a trap composed of 17 places in 285 ms
[2020-06-03 05:57:44] [INFO ] Deduced a trap composed of 21 places in 403 ms
[2020-06-03 05:57:44] [INFO ] Deduced a trap composed of 13 places in 573 ms
[2020-06-03 05:57:45] [INFO ] Deduced a trap composed of 51 places in 855 ms
[2020-06-03 05:57:46] [INFO ] Deduced a trap composed of 56 places in 390 ms
[2020-06-03 05:57:46] [INFO ] Deduced a trap composed of 50 places in 630 ms
[2020-06-03 05:57:47] [INFO ] Deduced a trap composed of 48 places in 208 ms
[2020-06-03 05:57:47] [INFO ] Deduced a trap composed of 52 places in 267 ms
[2020-06-03 05:57:47] [INFO ] Deduced a trap composed of 52 places in 309 ms
[2020-06-03 05:57:48] [INFO ] Deduced a trap composed of 34 places in 337 ms
[2020-06-03 05:57:48] [INFO ] Deduced a trap composed of 56 places in 223 ms
[2020-06-03 05:57:49] [INFO ] Deduced a trap composed of 16 places in 637 ms
[2020-06-03 05:57:49] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2020-06-03 05:57:49] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 05:57:50] [INFO ] Deduced a trap composed of 56 places in 975 ms
[2020-06-03 05:57:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 33 trap constraints in 11981 ms
[2020-06-03 05:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 62 ms returned sat
[2020-06-03 05:57:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 27 ms returned sat
[2020-06-03 05:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:51] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2020-06-03 05:57:51] [INFO ] [Real]Added 66 Read/Feed constraints in 28 ms returned sat
[2020-06-03 05:57:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 73 ms returned sat
[2020-06-03 05:57:51] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 05:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:52] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2020-06-03 05:57:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 39 ms returned sat
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 35 places in 800 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 27 places in 497 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 34 places in 273 ms
[2020-06-03 05:57:54] [INFO ] Deduced a trap composed of 13 places in 377 ms
[2020-06-03 05:57:54] [INFO ] Deduced a trap composed of 34 places in 529 ms
[2020-06-03 05:57:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2660 ms
[2020-06-03 05:57:55] [INFO ] [Real]Absence check using 11 positive place invariants in 41 ms returned sat
[2020-06-03 05:57:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:55] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2020-06-03 05:57:55] [INFO ] [Real]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:57:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 99 ms returned sat
[2020-06-03 05:57:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:56] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 64 ms returned sat
[2020-06-03 05:57:56] [INFO ] Deduced a trap composed of 9 places in 216 ms
[2020-06-03 05:57:56] [INFO ] Deduced a trap composed of 9 places in 189 ms
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 9 places in 515 ms
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 27 places in 618 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 35 places in 484 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 34 places in 98 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 26 places in 120 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 16 places in 109 ms
[2020-06-03 05:57:59] [INFO ] Deduced a trap composed of 13 places in 235 ms
[2020-06-03 05:58:00] [INFO ] Deduced a trap composed of 13 places in 839 ms
[2020-06-03 05:58:00] [INFO ] Deduced a trap composed of 16 places in 397 ms
[2020-06-03 05:58:00] [INFO ] Deduced a trap composed of 49 places in 114 ms
[2020-06-03 05:58:02] [INFO ] Deduced a trap composed of 31 places in 1414 ms
[2020-06-03 05:58:02] [INFO ] Deduced a trap composed of 31 places in 209 ms
[2020-06-03 05:58:02] [INFO ] Deduced a trap composed of 35 places in 419 ms
[2020-06-03 05:58:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 6798 ms
[2020-06-03 05:58:03] [INFO ] [Real]Absence check using 11 positive place invariants in 57 ms returned unsat
[2020-06-03 05:58:03] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 05:58:03] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:03] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2020-06-03 05:58:03] [INFO ] [Real]Added 66 Read/Feed constraints in 62 ms returned sat
[2020-06-03 05:58:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 71 ms returned sat
[2020-06-03 05:58:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 20 ms returned sat
[2020-06-03 05:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:04] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2020-06-03 05:58:04] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:58:05] [INFO ] Deduced a trap composed of 9 places in 1103 ms
[2020-06-03 05:58:05] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-06-03 05:58:06] [INFO ] Deduced a trap composed of 31 places in 884 ms
[2020-06-03 05:58:06] [INFO ] Deduced a trap composed of 16 places in 212 ms
[2020-06-03 05:58:07] [INFO ] Deduced a trap composed of 9 places in 1020 ms
[2020-06-03 05:58:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 3543 ms
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using 11 positive place invariants in 41 ms returned unsat
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-06-03 05:58:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:09] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2020-06-03 05:58:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:58:09] [INFO ] Deduced a trap composed of 9 places in 250 ms
[2020-06-03 05:58:09] [INFO ] Deduced a trap composed of 9 places in 180 ms
[2020-06-03 05:58:09] [INFO ] Deduced a trap composed of 12 places in 144 ms
[2020-06-03 05:58:10] [INFO ] Deduced a trap composed of 9 places in 157 ms
[2020-06-03 05:58:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 848 ms
[2020-06-03 05:58:10] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 61 ms.
[2020-06-03 05:58:12] [INFO ] Added : 304 causal constraints over 61 iterations in 2813 ms. Result :sat
[2020-06-03 05:58:13] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 26 places in 1046 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 44 places in 142 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 49 places in 161 ms
[2020-06-03 05:58:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1951 ms
[2020-06-03 05:58:14] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned unsat
[2020-06-03 05:58:15] [INFO ] [Real]Absence check using 11 positive place invariants in 53 ms returned sat
[2020-06-03 05:58:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:15] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2020-06-03 05:58:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-06-03 05:58:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:16] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2020-06-03 05:58:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 55 ms returned sat
[2020-06-03 05:58:17] [INFO ] Deduced a trap composed of 79 places in 492 ms
[2020-06-03 05:58:17] [INFO ] Deduced a trap composed of 52 places in 238 ms
[2020-06-03 05:58:17] [INFO ] Deduced a trap composed of 13 places in 259 ms
[2020-06-03 05:58:18] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-06-03 05:58:18] [INFO ] Deduced a trap composed of 49 places in 213 ms
[2020-06-03 05:58:19] [INFO ] Deduced a trap composed of 34 places in 1255 ms
[2020-06-03 05:58:19] [INFO ] Deduced a trap composed of 38 places in 125 ms
[2020-06-03 05:58:21] [INFO ] Deduced a trap composed of 23 places in 2044 ms
[2020-06-03 05:58:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5026 ms
[2020-06-03 05:58:21] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2020-06-03 05:58:23] [INFO ] Added : 304 causal constraints over 61 iterations in 2036 ms. Result :sat
[2020-06-03 05:58:24] [INFO ] Deduced a trap composed of 9 places in 176 ms
[2020-06-03 05:58:24] [INFO ] Deduced a trap composed of 16 places in 240 ms
[2020-06-03 05:58:24] [INFO ] Deduced a trap composed of 9 places in 414 ms
[2020-06-03 05:58:25] [INFO ] Deduced a trap composed of 16 places in 251 ms
[2020-06-03 05:58:25] [INFO ] Deduced a trap composed of 11 places in 322 ms
[2020-06-03 05:58:25] [INFO ] Deduced a trap composed of 56 places in 106 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 45 places in 362 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 61 places in 179 ms
[2020-06-03 05:58:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2492 ms
[2020-06-03 05:58:26] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned unsat
[2020-06-03 05:58:26] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned unsat
[2020-06-03 05:58:26] [INFO ] [Real]Absence check using 11 positive place invariants in 56 ms returned sat
[2020-06-03 05:58:26] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:27] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2020-06-03 05:58:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 05:58:27] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:27] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-03 05:58:27] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:58:27] [INFO ] Deduced a trap composed of 9 places in 377 ms
[2020-06-03 05:58:28] [INFO ] Deduced a trap composed of 35 places in 139 ms
[2020-06-03 05:58:28] [INFO ] Deduced a trap composed of 18 places in 154 ms
[2020-06-03 05:58:28] [INFO ] Deduced a trap composed of 61 places in 651 ms
[2020-06-03 05:58:29] [INFO ] Deduced a trap composed of 31 places in 324 ms
[2020-06-03 05:58:29] [INFO ] Deduced a trap composed of 34 places in 348 ms
[2020-06-03 05:58:29] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-06-03 05:58:30] [INFO ] Deduced a trap composed of 9 places in 158 ms
[2020-06-03 05:58:31] [INFO ] Deduced a trap composed of 13 places in 1035 ms
[2020-06-03 05:58:32] [INFO ] Deduced a trap composed of 79 places in 1016 ms
[2020-06-03 05:58:32] [INFO ] Deduced a trap composed of 52 places in 567 ms
[2020-06-03 05:58:33] [INFO ] Deduced a trap composed of 34 places in 963 ms
[2020-06-03 05:58:34] [INFO ] Deduced a trap composed of 49 places in 207 ms
[2020-06-03 05:58:34] [INFO ] Deduced a trap composed of 50 places in 298 ms
[2020-06-03 05:58:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6793 ms
[2020-06-03 05:58:34] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 78 ms.
[2020-06-03 05:58:36] [INFO ] Added : 304 causal constraints over 61 iterations in 2312 ms. Result :sat
[2020-06-03 05:58:37] [INFO ] Deduced a trap composed of 48 places in 875 ms
[2020-06-03 05:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 967 ms
[2020-06-03 05:58:37] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned unsat
[2020-06-03 05:58:37] [INFO ] [Real]Absence check using 11 positive place invariants in 73 ms returned sat
[2020-06-03 05:58:38] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 32 ms returned sat
[2020-06-03 05:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:38] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2020-06-03 05:58:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-06-03 05:58:38] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:39] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2020-06-03 05:58:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:58:39] [INFO ] Deduced a trap composed of 9 places in 172 ms
[2020-06-03 05:58:39] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-06-03 05:58:39] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-06-03 05:58:39] [INFO ] Deduced a trap composed of 27 places in 146 ms
[2020-06-03 05:58:40] [INFO ] Deduced a trap composed of 27 places in 278 ms
[2020-06-03 05:58:40] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-06-03 05:58:40] [INFO ] Deduced a trap composed of 49 places in 127 ms
[2020-06-03 05:58:40] [INFO ] Deduced a trap composed of 53 places in 241 ms
[2020-06-03 05:58:40] [INFO ] Deduced a trap composed of 52 places in 108 ms
[2020-06-03 05:58:42] [INFO ] Deduced a trap composed of 16 places in 1141 ms
[2020-06-03 05:58:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2853 ms
[2020-06-03 05:58:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 38 ms.
[2020-06-03 05:58:44] [INFO ] Added : 303 causal constraints over 61 iterations in 2424 ms. Result :sat
[2020-06-03 05:58:44] [INFO ] Deduced a trap composed of 29 places in 275 ms
[2020-06-03 05:58:45] [INFO ] Deduced a trap composed of 13 places in 191 ms
[2020-06-03 05:58:45] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-03 05:58:45] [INFO ] Deduced a trap composed of 38 places in 153 ms
[2020-06-03 05:58:45] [INFO ] Deduced a trap composed of 38 places in 135 ms
[2020-06-03 05:58:46] [INFO ] Deduced a trap composed of 13 places in 229 ms
[2020-06-03 05:58:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1718 ms
[2020-06-03 05:58:46] [INFO ] [Real]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-06-03 05:58:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:47] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2020-06-03 05:58:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 64 ms returned sat
[2020-06-03 05:58:47] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:48] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2020-06-03 05:58:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:58:48] [INFO ] Deduced a trap composed of 74 places in 149 ms
[2020-06-03 05:58:48] [INFO ] Deduced a trap composed of 31 places in 155 ms
[2020-06-03 05:58:49] [INFO ] Deduced a trap composed of 31 places in 160 ms
[2020-06-03 05:58:49] [INFO ] Deduced a trap composed of 38 places in 198 ms
[2020-06-03 05:58:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 816 ms
[2020-06-03 05:58:49] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 64 ms.
[2020-06-03 05:58:52] [INFO ] Added : 292 causal constraints over 59 iterations in 2705 ms. Result :sat
[2020-06-03 05:58:52] [INFO ] Deduced a trap composed of 9 places in 280 ms
[2020-06-03 05:58:52] [INFO ] Deduced a trap composed of 9 places in 150 ms
[2020-06-03 05:58:53] [INFO ] Deduced a trap composed of 16 places in 541 ms
[2020-06-03 05:58:53] [INFO ] Deduced a trap composed of 37 places in 633 ms
[2020-06-03 05:58:55] [INFO ] Deduced a trap composed of 27 places in 1389 ms
[2020-06-03 05:58:56] [INFO ] Deduced a trap composed of 27 places in 1130 ms
[2020-06-03 05:58:56] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-06-03 05:58:57] [INFO ] Deduced a trap composed of 9 places in 243 ms
[2020-06-03 05:58:57] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2020-06-03 05:58:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5375 ms
[2020-06-03 05:58:57] [INFO ] [Real]Absence check using 11 positive place invariants in 82 ms returned unsat
[2020-06-03 05:58:57] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-03 05:58:57] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-06-03 05:58:57] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:58] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2020-06-03 05:58:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 05:58:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:59] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2020-06-03 05:58:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 30 ms returned sat
[2020-06-03 05:58:59] [INFO ] Deduced a trap composed of 9 places in 254 ms
[2020-06-03 05:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2020-06-03 05:58:59] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 83 ms.
[2020-06-03 05:59:01] [INFO ] Added : 304 causal constraints over 61 iterations in 2524 ms. Result :sat
[2020-06-03 05:59:02] [INFO ] Deduced a trap composed of 16 places in 231 ms
[2020-06-03 05:59:02] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2020-06-03 05:59:02] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-03 05:59:03] [INFO ] Deduced a trap composed of 23 places in 932 ms
[2020-06-03 05:59:03] [INFO ] Deduced a trap composed of 23 places in 248 ms
[2020-06-03 05:59:05] [INFO ] Deduced a trap composed of 27 places in 1413 ms
[2020-06-03 05:59:05] [INFO ] Deduced a trap composed of 9 places in 408 ms
[2020-06-03 05:59:06] [INFO ] Deduced a trap composed of 9 places in 285 ms
[2020-06-03 05:59:06] [INFO ] Deduced a trap composed of 62 places in 159 ms
[2020-06-03 05:59:06] [INFO ] Deduced a trap composed of 62 places in 136 ms
[2020-06-03 05:59:06] [INFO ] Deduced a trap composed of 35 places in 339 ms
[2020-06-03 05:59:07] [INFO ] Deduced a trap composed of 13 places in 331 ms
[2020-06-03 05:59:07] [INFO ] Deduced a trap composed of 16 places in 343 ms
[2020-06-03 05:59:08] [INFO ] Deduced a trap composed of 62 places in 186 ms
[2020-06-03 05:59:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6118 ms
[2020-06-03 05:59:08] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
[2020-06-03 05:59:08] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 05:59:08] [INFO ] Flatten gal took : 205 ms
[2020-06-03 05:59:08] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 05:59:08] [INFO ] Flatten gal took : 28 ms
FORMULA Peterson-PT-3-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:59:08] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 42 ms.
[2020-06-03 05:59:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Peterson-PT-3 @ 3570 seconds

FORMULA Peterson-PT-3-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for CTLCardinality @ Peterson-PT-3

{
"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",
"--safe",
"--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 05:59:09 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "AG(EX((p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1)))",
"processed_size": 264,
"rewrites": 11
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 1847,
"markings": 1108,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "(2 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)",
"processed_size": 256,
"rewrites": 11
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p139 <= p5)",
"processed_size": 12,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p234 <= p21)))",
"processed_size": 21,
"rewrites": 11
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p22 <= p17) OR (p85 <= p230))))",
"processed_size": 40,
"rewrites": 11
},
"result":
{
"edges": 2978356,
"markings": 980408,
"produced_by": "state space",
"value": true
},
"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",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"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": "(p38 + 1 <= p168)",
"processed_size": 17,
"rewrites": 13
},
"result":
{
"edges": 1356162,
"markings": 494076,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"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": 168,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 132,
"visible_transitions": 0
},
"processed": "EG(A((p0 + p1 + p2 + p3 + 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 + p46 + p47 + p48 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156) U (p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p169 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p214 + p215 + p217 + p218 + p219 + p220 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))",
"processed_size": 1128,
"rewrites": 11
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 18403,
"markings": 6821,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"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": 52,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "(p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p57 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p96 + p97 + p98 + p99 + 1 <= p237 + p238 + p239 + p241)",
"processed_size": 328,
"rewrites": 13
},
"result":
{
"edges": 236,
"markings": 183,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 52
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 20164,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(X(**)))) : E(X(E(F(**)))) : A(F(A(G(**)))) : E(G(A((** U **)))) : A(G(*)) : (A(G(**)) AND (** OR A(X(*)))) : E(F(A(G(**))))"
},
"net":
{
"arcs": 1016,
"conflict_clusters": 163,
"places": 244,
"places_significant": 229,
"singleton_clusters": 0,
"transitions": 332
},
"result":
{
"preliminary_value": "no yes no yes yes no no ",
"value": "no yes no yes yes 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: 576/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 244
lola: finding significant places
lola: 244 places, 332 transitions, 229 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: A (G (E (X ((p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1))))) : E (X (E (F ((2 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))) : A (((0 <= 0) U A (G ((p237 + p238 + p239 + p241 <= p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p57 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p96 + p97 + p98 + p99))))) : E (G (A (((p0 + p1 + p2 + p3 + 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 + p46 + p47 + p48 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156) U (p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p169 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p214 + p215 + p217 + p218 + p219 + p220 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))) : NOT(E (F (((p17 + 1 <= p22) AND (p230 + 1 <= p85))))) : (E (G (A (G ((p234 <= p21))))) AND ((p139 <= p5) OR NOT(E (X ((p41 <= p173)))))) : E (F (A (G ((p168 <= p38)))))
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1)))
lola: processed formula length: 264
lola: 11 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 1 significant temporal operators and needs 5 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: 1108 markings, 1847 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (2 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)
lola: processed formula length: 256
lola: 11 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)
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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 15 markings, 16 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p234 <= p21))) AND ((p139 <= p5) OR A (X ((p173 + 1 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p139 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p139 <= p5)
lola: processed formula length: 12
lola: 9 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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p234 <= p21)))
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 ((p234 <= p21)))
lola: processed formula length: 21
lola: 11 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: (p21 + 1 <= p234)
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: 21 markings, 20 edges
sara: try reading problem file CTLCardinality-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p22 <= p17) OR (p85 <= p230))))
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 (((p22 <= p17) OR (p85 <= p230))))
lola: processed formula length: 40
lola: 11 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: ((p17 + 1 <= p22) AND (p230 + 1 <= p85))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 375154 markings, 1117232 edges, 75031 markings/sec, 0 secs
lola: sara is running 5 secs || 737726 markings, 2213804 edges, 72514 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 980408 markings, 2978356 edges
lola: ========================================
lola: subprocess 4 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p168 <= p38)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p38 + 1 <= p168)
lola: processed formula length: 17
lola: 13 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
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: (p168 <= p38)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
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 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p38 + 1 <= p168)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-1.sara.
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 494076 markings, 1356162 edges
lola: ========================================
lola: subprocess 5 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((p0 + p1 + p2 + p3 + 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 + p46 + p47 + p48 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A((p0 + p1 + p2 + p3 + 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 + p46 + p47 + p48 <= p109 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p13... (shortened)
lola: processed formula length: 1128
lola: 11 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6821 markings, 18403 edges
lola: ========================================
lola: subprocess 6 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p237 + p238 + p239 + p241 <= p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p57 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p96 + p97 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p57 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p96 + p97 + p98 + p99 + 1 <= p237 + p238 + p239 + p241)
lola: processed formula length: 328
lola: 13 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 183 markings, 236 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no no
lola:
preliminary result: no yes no yes yes no no
lola: memory consumption: 20164 KB
lola: time consumption: 21 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Peterson-PT-3"
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 Peterson-PT-3, 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 r174-csrt-158987853600715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;