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

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

=== Now, execution of the tool begins

BK_START 1591163798844

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:56:41] [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 05:56:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:56:41] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-06-03 05:56:41] [INFO ] Transformed 244 places.
[2020-06-03 05:56:41] [INFO ] Transformed 332 transitions.
[2020-06-03 05:56:41] [INFO ] Parsed PT model containing 244 places and 332 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 399 ms. (steps per millisecond=250 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1]
[2020-06-03 05:56:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:56:42] [INFO ] Computed 15 place invariants in 27 ms
[2020-06-03 05:56:42] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-06-03 05:56:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:43] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2020-06-03 05:56:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:56:43] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:56:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 05:56:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:43] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-06-03 05:56:43] [INFO ] [Nat]Added 66 Read/Feed constraints in 30 ms returned sat
[2020-06-03 05:56:43] [INFO ] Deduced a trap composed of 9 places in 224 ms
[2020-06-03 05:56:44] [INFO ] Deduced a trap composed of 9 places in 579 ms
[2020-06-03 05:56:44] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2020-06-03 05:56:44] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 23 places in 256 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 38 places in 131 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 54 places in 86 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 53 places in 82 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2020-06-03 05:56:45] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2020-06-03 05:56:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2368 ms
[2020-06-03 05:56:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-06-03 05:56:47] [INFO ] Added : 304 causal constraints over 61 iterations in 1675 ms. Result :sat
[2020-06-03 05:56:47] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-06-03 05:56:47] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2020-06-03 05:56:47] [INFO ] Deduced a trap composed of 54 places in 70 ms
[2020-06-03 05:56:48] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-06-03 05:56:48] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 05:56:48] [INFO ] Deduced a trap composed of 74 places in 65 ms
[2020-06-03 05:56:48] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-06-03 05:56:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 796 ms
[2020-06-03 05:56:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-06-03 05:56:48] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:56:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:48] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 05:56:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 05:56:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 05:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:49] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2020-06-03 05:56:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:56:49] [INFO ] Deduced a trap composed of 9 places in 150 ms
[2020-06-03 05:56:49] [INFO ] Deduced a trap composed of 9 places in 200 ms
[2020-06-03 05:56:50] [INFO ] Deduced a trap composed of 12 places in 998 ms
[2020-06-03 05:56:50] [INFO ] Deduced a trap composed of 9 places in 349 ms
[2020-06-03 05:56:50] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2020-06-03 05:56:51] [INFO ] Deduced a trap composed of 35 places in 57 ms
[2020-06-03 05:56:51] [INFO ] Deduced a trap composed of 34 places in 61 ms
[2020-06-03 05:56:51] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2020-06-03 05:56:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2101 ms
[2020-06-03 05:56:51] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:56:53] [INFO ] Added : 304 causal constraints over 61 iterations in 1836 ms. Result :sat
[2020-06-03 05:56:53] [INFO ] Deduced a trap composed of 53 places in 97 ms
[2020-06-03 05:56:53] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2020-06-03 05:56:53] [INFO ] Deduced a trap composed of 53 places in 49 ms
[2020-06-03 05:56:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 329 ms
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned unsat
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive place invariants in 65 ms returned unsat
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:53] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-03 05:56:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 05:56:53] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:54] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2020-06-03 05:56:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:56:54] [INFO ] Deduced a trap composed of 36 places in 256 ms
[2020-06-03 05:56:54] [INFO ] Deduced a trap composed of 24 places in 314 ms
[2020-06-03 05:56:55] [INFO ] Deduced a trap composed of 38 places in 551 ms
[2020-06-03 05:56:55] [INFO ] Deduced a trap composed of 49 places in 58 ms
[2020-06-03 05:56:55] [INFO ] Deduced a trap composed of 13 places in 111 ms
[2020-06-03 05:56:55] [INFO ] Deduced a trap composed of 49 places in 68 ms
[2020-06-03 05:56:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1461 ms
[2020-06-03 05:56:55] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 21 ms.
[2020-06-03 05:56:56] [INFO ] Added : 304 causal constraints over 61 iterations in 1175 ms. Result :sat
[2020-06-03 05:56:56] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2020-06-03 05:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2020-06-03 05:56:56] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 05:56:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:57] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-03 05:56:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-06-03 05:56:57] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:57] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-06-03 05:56:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:56:57] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-06-03 05:56:57] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-06-03 05:56:57] [INFO ] Deduced a trap composed of 13 places in 69 ms
[2020-06-03 05:56:58] [INFO ] Deduced a trap composed of 38 places in 72 ms
[2020-06-03 05:56:58] [INFO ] Deduced a trap composed of 42 places in 187 ms
[2020-06-03 05:56:58] [INFO ] Deduced a trap composed of 31 places in 210 ms
[2020-06-03 05:56:58] [INFO ] Deduced a trap composed of 57 places in 88 ms
[2020-06-03 05:56:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1009 ms
[2020-06-03 05:56:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 40 ms.
[2020-06-03 05:56:59] [INFO ] Added : 303 causal constraints over 61 iterations in 1361 ms. Result :sat
[2020-06-03 05:57:00] [INFO ] Deduced a trap composed of 41 places in 97 ms
[2020-06-03 05:57:00] [INFO ] Deduced a trap composed of 38 places in 76 ms
[2020-06-03 05:57:00] [INFO ] Deduced a trap composed of 57 places in 48 ms
[2020-06-03 05:57:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2020-06-03 05:57:00] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:57:00] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:00] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 05:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:57:00] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 05:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:00] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-03 05:57:00] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:57:00] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 50 places in 102 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 52 places in 98 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 13 places in 104 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 49 places in 109 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 47 places in 113 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 35 places in 112 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 05:57:01] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-06-03 05:57:02] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-06-03 05:57:02] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-06-03 05:57:02] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-06-03 05:57:02] [INFO ] Deduced a trap composed of 50 places in 95 ms
[2020-06-03 05:57:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1611 ms
[2020-06-03 05:57:02] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-06-03 05:57:03] [INFO ] Added : 304 causal constraints over 61 iterations in 1278 ms. Result :sat
[2020-06-03 05:57:03] [INFO ] Deduced a trap composed of 48 places in 69 ms
[2020-06-03 05:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2020-06-03 05:57:03] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:57:03] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 15 ms returned sat
[2020-06-03 05:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:04] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 05:57:04] [INFO ] [Real]Added 66 Read/Feed constraints in 30 ms returned sat
[2020-06-03 05:57:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 77 ms returned sat
[2020-06-03 05:57:04] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:04] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 05:57:04] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:57:04] [INFO ] Deduced a trap composed of 11 places in 122 ms
[2020-06-03 05:57:04] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2020-06-03 05:57:04] [INFO ] Deduced a trap composed of 56 places in 71 ms
[2020-06-03 05:57:04] [INFO ] Deduced a trap composed of 56 places in 97 ms
[2020-06-03 05:57:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 441 ms
[2020-06-03 05:57:04] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:57:06] [INFO ] Added : 304 causal constraints over 61 iterations in 1299 ms. Result :sat
[2020-06-03 05:57:06] [INFO ] Deduced a trap composed of 70 places in 131 ms
[2020-06-03 05:57:06] [INFO ] Deduced a trap composed of 38 places in 68 ms
[2020-06-03 05:57:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2020-06-03 05:57:06] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:57:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:06] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-03 05:57:06] [INFO ] [Real]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:57:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:57:06] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:07] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2020-06-03 05:57:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 13 places in 77 ms
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-06-03 05:57:07] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2020-06-03 05:57:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 518 ms
[2020-06-03 05:57:07] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-06-03 05:57:08] [INFO ] Added : 303 causal constraints over 61 iterations in 1196 ms. Result :sat
[2020-06-03 05:57:08] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 35 places in 88 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-06-03 05:57:09] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-06-03 05:57:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 777 ms
[2020-06-03 05:57:09] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 05:57:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:09] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-03 05:57:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:57:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:10] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2020-06-03 05:57:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:57:10] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-06-03 05:57:10] [INFO ] Deduced a trap composed of 39 places in 89 ms
[2020-06-03 05:57:10] [INFO ] Deduced a trap composed of 57 places in 84 ms
[2020-06-03 05:57:10] [INFO ] Deduced a trap composed of 56 places in 89 ms
[2020-06-03 05:57:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 419 ms
[2020-06-03 05:57:10] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-06-03 05:57:12] [INFO ] Added : 304 causal constraints over 61 iterations in 1596 ms. Result :sat
[2020-06-03 05:57:12] [INFO ] Deduced a trap composed of 38 places in 106 ms
[2020-06-03 05:57:12] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2020-06-03 05:57:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2020-06-03 05:57:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:57:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:12] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 05:57:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-03 05:57:12] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:13] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 05:57:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:57:13] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2020-06-03 05:57:13] [INFO ] Deduced a trap composed of 39 places in 84 ms
[2020-06-03 05:57:13] [INFO ] Deduced a trap composed of 57 places in 108 ms
[2020-06-03 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2020-06-03 05:57:13] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 34 ms.
[2020-06-03 05:57:15] [INFO ] Added : 304 causal constraints over 61 iterations in 1655 ms. Result :sat
[2020-06-03 05:57:15] [INFO ] Deduced a trap composed of 9 places in 197 ms
[2020-06-03 05:57:15] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-06-03 05:57:15] [INFO ] Deduced a trap composed of 16 places in 132 ms
[2020-06-03 05:57:15] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-06-03 05:57:15] [INFO ] Deduced a trap composed of 37 places in 125 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 45 places in 138 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 62 places in 89 ms
[2020-06-03 05:57:16] [INFO ] Deduced a trap composed of 39 places in 70 ms
[2020-06-03 05:57:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1604 ms
[2020-06-03 05:57:16] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 05:57:17] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 05:57:17] [INFO ] Flatten gal took : 122 ms
FORMULA Peterson-PT-3-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:57:17] [INFO ] Flatten gal took : 32 ms
[2020-06-03 05:57:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 25 ms.
[2020-06-03 05:57:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Peterson-PT-3 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

FORMULA Peterson-PT-3-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:57:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 184,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 76,
"visible_transitions": 0
},
"processed": "X (F ((((4 <= p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172) U (F ((1 <= 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)) AND (1 <= 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))) OR ((p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172 <= p233 + p232 + p231 + p230) AND (p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p240 + p242 + p243 <= 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)))))",
"processed_size": 1163,
"rewrites": 67
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 68,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "G (F ((X (X ((p233 + p232 + p231 + p230 <= 1))) OR ((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 + 1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60) OR G ((p233 + p232 + p231 + p230 <= 1))))))",
"processed_size": 450,
"rewrites": 67
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G ((p14 + 1 <= p101))) OR X ((p59 + 1 <= p135))))",
"processed_size": 56,
"rewrites": 67
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (G (((p231 + 1 <= p194) AND (F ((p192 + 1 <= p114)) OR G ((p231 + 1 <= p194)))))) AND G ((p25 <= p181))))",
"processed_size": 111,
"rewrites": 67
},
"result":
{
"edges": 2625022,
"markings": 656316,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((p183 <= p232) OR ((G ((p231 <= p167)) AND F ((p183 <= p232))) OR (G ((p231 <= p167)) OR F ((1 <= p190))))))",
"processed_size": 112,
"rewrites": 67
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (((F ((p67 + 1 <= p239)) OR (p87 <= 0)) AND (p239 <= p67))) R (p87 <= 0))",
"processed_size": 76,
"rewrites": 67
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p119 + 1 <= p207))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 41,
"markings": 41,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p166 + 1 <= p233))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p2 <= p160)))",
"processed_size": 20,
"rewrites": 67
},
"result":
{
"edges": 436,
"markings": 341,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1186
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p111 + 1 <= p226)))",
"processed_size": 26,
"rewrites": 67
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p237 + p238 + p239 + p241)) AND ((1 <= 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) OR (1 <= p237 + p238 + p239 + p241)))))",
"processed_size": 389,
"rewrites": 67
},
"result":
{
"edges": 33,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 88,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 88,
"visible_transitions": 0
},
"processed": "G ((F (G ((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 <= p237 + p238 + p239 + p241))) AND F ((2 <= 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))))",
"processed_size": 647,
"rewrites": 67
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 24992,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(((** U (F(**) AND **)) OR **))) : G(F((X(X(*)) OR (* OR G(*))))) : F(G((F(**) AND (** OR **)))) : G((F(G(*)) AND F(**))) : F((F(G(*)) OR X(*))) : X((F(G((* AND (F(*) OR G(*))))) AND G(**))) : X((** OR ((G(**) AND F(**)) OR (G(**) OR F(**))))) : (X(((F(*) OR *) AND *)) R *) : F(G(**)) : (G(*) OR X(*)) : G(F(*))"
},
"net":
{
"arcs": 1016,
"conflict_clusters": 163,
"places": 244,
"places_significant": 229,
"singleton_clusters": 0,
"transitions": 332
},
"result":
{
"preliminary_value": "no no no no no no yes yes no no no ",
"value": "no no no no no no yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 LTLCardinality.xml
lola: X (F ((((4 <= p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172) U (F ((1 <= 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)) AND (1 <= 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))) OR ((p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172 <= p233 + p232 + p231 + p230) AND (p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p240 + p242 + p243 <= 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))))) : G (X (NOT(G (((X (X ((2 <= p233 + p232 + p231 + p230))) AND (p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 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)) AND F ((2 <= p233 + p232 + p231 + p230))))))) : G (F (G (((1 <= 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) U (1 <= p237 + p238 + p239 + p241))))) : G ((F (NOT(F ((p237 + p238 + p239 + p241 <= 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)))) AND F ((2 <= 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)))) : F (((p52 <= p110) U (NOT(G (F (((p101 <= p14) U X ((p101 <= p14)))))) OR NOT(X ((p135 <= p59)))))) : X ((F (NOT(F ((G ((p114 <= p192)) U (p194 <= p231))))) AND G ((p25 <= p181)))) : ((X ((G ((p231 <= p167)) U (p183 <= p232))) OR G (X ((p231 <= p167)))) OR X (F ((1 <= p190)))) : NOT((X (((G ((p239 <= p67)) AND (1 <= p87)) OR (p67 + 1 <= p239))) U (1 <= p87))) : (X ((G ((p239 <= p97)) OR (p2 <= p160))) U F (G ((p2 <= p160)))) : (NOT((((1 <= p7) OR (p133 <= p51)) U F ((p207 <= p119)))) OR NOT(((1 <= 0) U X ((p233 <= p166))))) : X (X (X (F (NOT(F (G ((p226 <= p111))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((4 <= p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172) U (F ((1 <= 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)) AND (1 <= p0 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((4 <= p144 + p145 + p146 + p147 + p148 + p165 + p166 + p167 + p168 + p170 + p171 + p172) U (F ((1 <= 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)) AND (1 <= p0 ... (shortened)
lola: processed formula length: 1163
lola: 67 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X ((p233 + p232 + p231 + p230 <= 1))) OR ((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 + 1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X ((p233 + p232 + p231 + p230 <= 1))) OR ((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 + 1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 ... (shortened)
lola: processed formula length: 450
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p14 + 1 <= p101))) OR X ((p59 + 1 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p14 + 1 <= p101))) OR X ((p59 + 1 <= p135))))
lola: processed formula length: 56
lola: 67 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p231 + 1 <= p194) AND (F ((p192 + 1 <= p114)) OR G ((p231 + 1 <= p194)))))) AND G ((p25 <= p181))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p231 + 1 <= p194) AND (F ((p192 + 1 <= p114)) OR G ((p231 + 1 <= p194)))))) AND G ((p25 <= p181))))
lola: processed formula length: 111
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 511094 markings, 2044190 edges, 102219 markings/sec, 0 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: 656316 markings, 2625022 edges
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p183 <= p232) OR ((G ((p231 <= p167)) AND F ((p183 <= p232))) OR (G ((p231 <= p167)) OR F ((1 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p183 <= p232) OR ((G ((p231 <= p167)) AND F ((p183 <= p232))) OR (G ((p231 <= p167)) OR F ((1 <= p190))))))
lola: processed formula length: 112
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((F ((p67 + 1 <= p239)) OR (p87 <= 0)) AND (p239 <= p67))) R (p87 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((F ((p67 + 1 <= p239)) OR (p87 <= 0)) AND (p239 <= p67))) R (p87 <= 0))
lola: processed formula length: 76
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: subprocess 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p119 + 1 <= p207)) OR X ((p166 + 1 <= p233)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p119 + 1 <= p207))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p119 + 1 <= p207))
lola: processed formula length: 22
lola: 67 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: 41 markings, 41 edges
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p166 + 1 <= p233))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p166 + 1 <= p233))
lola: processed formula length: 22
lola: 67 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p2 <= p160)))
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 ((p2 <= p160)))
lola: processed formula length: 20
lola: 67 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: 341 markings, 436 edges
lola: ========================================
lola: subprocess 8 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p111 + 1 <= p226)))
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 ((p111 + 1 <= p226)))
lola: processed formula length: 26
lola: 67 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p237 + p238 + p239 + p241)) AND ((1 <= 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) OR (1 <= p237 + p238 + p239 + p241)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p237 + p238 + p239 + p241)) AND ((1 <= 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) OR (1 <= p237 + p238 + p239 + p241)))))
lola: processed formula length: 389
lola: 67 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: 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: 32 markings, 33 edges
lola: ========================================
lola: subprocess 10 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((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 <= p237 + p238 + p239 + p241))) AND F ((2 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p169 + p173 + p174 + p175 + p176 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((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 <= p237 + p238 + p239 + p241))) AND F ((2 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p169 + p173 + p174 + p175 + p176 +... (shortened)
lola: processed formula length: 647
lola: 67 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: 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: 28 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes no no no
lola:
preliminary result: no no no no no no yes yes no no no
lola: memory consumption: 24992 KB
lola: time consumption: 10 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="Peterson-PT-3"
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 Peterson-PT-3, 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 r174-csrt-158987853600713"
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 [ "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 ;