Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700569.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 Kanban-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700569
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-20000-00
FORMULA_NAME Kanban-PT-20000-01
FORMULA_NAME Kanban-PT-20000-02
FORMULA_NAME Kanban-PT-20000-03
FORMULA_NAME Kanban-PT-20000-04
FORMULA_NAME Kanban-PT-20000-05
FORMULA_NAME Kanban-PT-20000-06
FORMULA_NAME Kanban-PT-20000-07
FORMULA_NAME Kanban-PT-20000-08
FORMULA_NAME Kanban-PT-20000-09
FORMULA_NAME Kanban-PT-20000-10
FORMULA_NAME Kanban-PT-20000-11
FORMULA_NAME Kanban-PT-20000-12
FORMULA_NAME Kanban-PT-20000-13
FORMULA_NAME Kanban-PT-20000-14
FORMULA_NAME Kanban-PT-20000-15

=== Now, execution of the tool begins

BK_START 1591214389935

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:59:55] [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 19:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:59:55] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-03 19:59:55] [INFO ] Transformed 16 places.
[2020-06-03 19:59:55] [INFO ] Transformed 16 transitions.
[2020-06-03 19:59:55] [INFO ] Parsed PT model containing 16 places and 16 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100005 steps, including 0 resets, run finished after 149 ms. (steps per millisecond=671 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 19:59:56] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 19:59:56] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 25 ms.
[2020-06-03 19:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 12 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-03 19:59:56] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 19:59:56] [INFO ] Added : 9 causal constraints over 2 iterations in 48 ms. Result :sat
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-03 19:59:56] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 19:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:56] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-03 19:59:56] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:56] [INFO ] Added : 11 causal constraints over 3 iterations in 76 ms. Result :sat
[2020-06-03 19:59:56] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned unsat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-06-03 19:59:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 19:59:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-06-03 19:59:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:57] [INFO ] Added : 11 causal constraints over 3 iterations in 94 ms. Result :sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive place invariants in 30 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 15 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-06-03 19:59:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 27 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-06-03 19:59:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 5 ms.
[2020-06-03 19:59:57] [INFO ] Added : 2 causal constraints over 2 iterations in 33 ms. Result :sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 19:59:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:57] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-03 19:59:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:57] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 6 ms.
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:58] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 7 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:58] [INFO ] Added : 10 causal constraints over 3 iterations in 23 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned unsat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 5 ms.
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:58] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:58] [INFO ] Added : 9 causal constraints over 2 iterations in 62 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 19:59:58] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 19:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 6 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-03 19:59:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:58] [INFO ] Added : 14 causal constraints over 3 iterations in 14 ms. Result :sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-03 19:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 17 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:59:59] [INFO ] Added : 11 causal constraints over 3 iterations in 150 ms. Result :sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 26 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 19:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:59] [INFO ] Added : 9 causal constraints over 2 iterations in 99 ms. Result :sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 19:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:59:59] [INFO ] Added : 14 causal constraints over 4 iterations in 9 ms. Result :sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 27 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 19:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 28 ms.
[2020-06-03 19:59:59] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 26 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-03 19:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:59:59] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 19:59:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:00] [INFO ] Added : 11 causal constraints over 3 iterations in 136 ms. Result :sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-06-03 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:00] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:00] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 13 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2020-06-03 20:00:00] [INFO ] Added : 13 causal constraints over 4 iterations in 26 ms. Result :sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2020-06-03 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:00] [INFO ] Added : 14 causal constraints over 4 iterations in 143 ms. Result :sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:00] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-06-03 20:00:00] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 10 ms.
[2020-06-03 20:00:01] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 20:00:01] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 20:00:01] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:01] [INFO ] Added : 14 causal constraints over 4 iterations in 11 ms. Result :sat
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:01] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:00:01] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 6 ms.
[2020-06-03 20:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:01] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:01] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:01] [INFO ] Added : 14 causal constraints over 4 iterations in 17 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 20:00:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 20:00:01] [INFO ] Flatten gal took : 67 ms
FORMULA Kanban-PT-20000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:00:01] [INFO ] Flatten gal took : 3 ms
[2020-06-03 20:00:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 20:00:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-20000 @ 3570 seconds

FORMULA Kanban-PT-20000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2539
rslt: Output for LTLCardinality @ Kanban-PT-20000

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p14 + 1 <= p7) R (2 <= p8))",
"processed_size": 29,
"rewrites": 74
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p14 + 1 <= p7)))",
"processed_size": 23,
"rewrites": 74
},
"result":
{
"edges": 40002,
"markings": 40002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p1 + 1 <= p3)))",
"processed_size": 22,
"rewrites": 74
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((p7 + 1 <= p6) AND (p15 <= p13))) OR (G ((G ((p6 <= p7)) OR (p15 <= p13))) AND X (F (((p7 + 1 <= p6) AND (p15 <= p13)))))))",
"processed_size": 131,
"rewrites": 74
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 401
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p12)",
"processed_size": 10,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((p7 <= 2))) AND (3 <= p12)))",
"processed_size": 38,
"rewrites": 74
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((p12 + 1 <= p8)) AND ((p14 <= 2) AND (X ((p14 <= 2)) OR ((p11 + 1 <= p8) OR (p12 + 1 <= p8))))))))",
"processed_size": 111,
"rewrites": 74
},
"result":
{
"edges": 160004,
"markings": 160004,
"produced_by": "LTL model checker",
"value": false
},
"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": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p8 + 1 <= p3)))",
"processed_size": 22,
"rewrites": 74
},
"result":
{
"edges": 160001,
"markings": 160001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (X (F ((F ((p5 <= p11)) AND G (((p15 + 1 <= p12) OR (p10 <= 2))))))))",
"processed_size": 75,
"rewrites": 74
},
"result":
{
"edges": 120041,
"markings": 120027,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((p10 + 1 <= p12)) AND X (F ((p1 <= 1)))))",
"processed_size": 48,
"rewrites": 74
},
"result":
{
"edges": 120009,
"markings": 120009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1069
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((3 <= p8)) AND ((1 <= p2) OR ((p1 <= p8) U (3 <= p8))))))",
"processed_size": 67,
"rewrites": 74
},
"result":
{
"edges": 20008,
"markings": 20006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 3090
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p6) U G ((F ((p1 <= p15)) AND ((p2 + 1 <= p12) OR (p1 <= p15)))))",
"processed_size": 72,
"rewrites": 74
},
"result":
{
"edges": 80004,
"markings": 60004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"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": 3064,
"runtime": 1031.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND (** OR (** U **))))) : ((* R *) OR X(F(*))) : G(((G(F(**)) OR (G(F(**)) AND F(G(*)))) AND **)) : X(G(*)) : (X(G(**)) U G((F(**) AND **))) : X((X((** AND **)) OR (G((G(**) OR **)) AND X(F((** AND **)))))) : (** U G((F(**) AND (** OR **)))) : (X((X(G(*)) AND **)) OR (F(*) AND **)) : X(X(G((F(*) AND (** AND (X(*) OR (** OR **))))))) : X(F(**)) : X(X(X(F((F(*) AND G(*)))))) : F((G(*) AND X(F(*))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no unknown no unknown no no no no no no no ",
"value": "no no unknown no unknown no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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: F (G (NOT(F (NOT(X (((1 <= p2) U ((p1 <= p8) U (3 <= p8))))))))) : (NOT((((1 <= 0) U (p7 <= p14)) U (p8 <= 1))) OR NOT(G (X ((p7 <= p14))))) : G (((X (F (NOT(F ((p12 <= p4))))) U X (F (G (F ((p6 <= p5)))))) AND (p6 <= p5))) : G (X (NOT(F (((((p14 <= 2) U X ((3 <= p14))) OR G ((p3 <= p1))) U F ((p3 <= p1))))))) : (X (G ((p1 <= p9))) U G ((F (((1 <= p8) AND (p1 <= p9))) AND (p1 <= p9)))) : X ((G ((G ((p6 <= p7)) OR (p15 <= p13))) U (X ((p7 + 1 <= p6)) AND X ((p15 <= p13))))) : ((1 <= p6) U G (((p2 + 1 <= p12) U (p1 <= p15)))) : (X ((NOT(X (F ((3 <= p7)))) AND (3 <= p12))) OR (NOT(G ((2 <= p10))) AND (3 <= p12))) : X (X (G (((NOT(G ((p8 <= p12))) AND (p14 <= 2)) AND ((NOT(X ((3 <= p14))) OR (p11 + 1 <= p8)) OR (p12 + 1 <= p8)))))) : X (F ((X ((F ((1 <= p10)) OR (2 <= p7))) U (p8 + 1 <= p3)))) : X (X (X (F ((NOT(G ((p11 + 1 <= p5))) AND NOT(((3 <= p10) U F (((p12 <= p15) AND (3 <= p10)))))))))) : NOT(G ((F ((p12 <= p10)) OR G (X (G ((2 <= p1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p14 + 1 <= p7) R (2 <= p8)) OR X (F ((p14 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p14 + 1 <= p7) R (2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p14 + 1 <= p7) R (2 <= p8))
lola: processed formula length: 29
lola: 74 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: 20002 markings, 20002 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p14 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p14 + 1 <= p7)))
lola: processed formula length: 23
lola: 74 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: 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: 40002 markings, 40002 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p1 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p1 + 1 <= p3)))
lola: processed formula length: 22
lola: 74 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: 120004 markings, 120004 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p1 <= p9))) U G ((F (((1 <= p8) AND (p1 <= p9))) AND (p1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((p1 <= p9))) U G ((F (((1 <= p8) AND (p1 <= p9))) AND (p1 <= p9))))
lola: processed formula length: 74
lola: 74 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: 3910840 markings, 7659339 edges, 782168 markings/sec, 0 secs
lola: 7288332 markings, 14412942 edges, 675498 markings/sec, 5 secs
lola: 9885545 markings, 19607719 edges, 519443 markings/sec, 10 secs
lola: 12364543 markings, 24564042 edges, 495800 markings/sec, 15 secs
lola: 14619007 markings, 29072357 edges, 450893 markings/sec, 20 secs
lola: 16696423 markings, 33227528 edges, 415483 markings/sec, 25 secs
lola: 18640823 markings, 37115486 edges, 388880 markings/sec, 30 secs
lola: 20468543 markings, 40772053 edges, 365544 markings/sec, 35 secs
lola: 22408969 markings, 44651422 edges, 388085 markings/sec, 40 secs
lola: 24349670 markings, 48530490 edges, 388140 markings/sec, 45 secs
lola: 26087421 markings, 52007726 edges, 347550 markings/sec, 50 secs
lola: 27900575 markings, 55633606 edges, 362631 markings/sec, 55 secs
lola: 29585201 markings, 58999846 edges, 336925 markings/sec, 60 secs
lola: 31223903 markings, 62277387 edges, 327740 markings/sec, 65 secs
lola: 32804083 markings, 65439340 edges, 316036 markings/sec, 70 secs
lola: 34423463 markings, 68680253 edges, 323876 markings/sec, 75 secs
lola: 36058073 markings, 71948047 edges, 326922 markings/sec, 80 secs
lola: 37669305 markings, 75166458 edges, 322246 markings/sec, 85 secs
lola: 39239017 markings, 78306649 edges, 313942 markings/sec, 90 secs
lola: 40807001 markings, 81445572 edges, 313597 markings/sec, 95 secs
lola: 42361187 markings, 84551044 edges, 310837 markings/sec, 100 secs
lola: 43910863 markings, 87648871 edges, 309935 markings/sec, 105 secs
lola: 45465909 markings, 90761947 edges, 311009 markings/sec, 110 secs
lola: 47007181 markings, 93841786 edges, 308254 markings/sec, 115 secs
lola: 48538981 markings, 96908195 edges, 306360 markings/sec, 120 secs
lola: 50075434 markings, 99979666 edges, 307291 markings/sec, 125 secs
lola: 51563642 markings, 102959158 edges, 297642 markings/sec, 130 secs
lola: 53107453 markings, 106041082 edges, 308762 markings/sec, 135 secs
lola: 54640021 markings, 109108540 edges, 306514 markings/sec, 140 secs
lola: 56147807 markings, 112122554 edges, 301557 markings/sec, 145 secs
lola: 57381661 markings, 114588891 edges, 246771 markings/sec, 150 secs
lola: 58843261 markings, 117516717 edges, 292320 markings/sec, 155 secs
lola: 60364080 markings, 120555522 edges, 304164 markings/sec, 160 secs
lola: 61840032 markings, 123510925 edges, 295190 markings/sec, 165 secs
lola: 63343117 markings, 126516053 edges, 300617 markings/sec, 170 secs
lola: 64825723 markings, 129478556 edges, 296521 markings/sec, 175 secs
lola: 66331425 markings, 132494047 edges, 301140 markings/sec, 180 secs
lola: 67802401 markings, 135434551 edges, 294195 markings/sec, 185 secs
lola: 69293153 markings, 138416870 edges, 298150 markings/sec, 190 secs
lola: 70761072 markings, 141345807 edges, 293584 markings/sec, 195 secs
lola: 72277953 markings, 144381226 edges, 303376 markings/sec, 200 secs
lola: 73511617 markings, 146854190 edges, 246733 markings/sec, 205 secs
lola: 74731861 markings, 149289140 edges, 244049 markings/sec, 210 secs
lola: 76174939 markings, 152179810 edges, 288616 markings/sec, 215 secs
lola: 77679843 markings, 155190569 edges, 300981 markings/sec, 220 secs
lola: 79142982 markings, 158110527 edges, 292628 markings/sec, 225 secs
lola: 80626507 markings, 161076755 edges, 296705 markings/sec, 230 secs
lola: 82107757 markings, 164041980 edges, 296250 markings/sec, 235 secs
lola: 83592885 markings, 167010605 edges, 297026 markings/sec, 240 secs
lola: 85050849 markings, 169931350 edges, 291593 markings/sec, 245 secs
lola: 86547731 markings, 172919105 edges, 299376 markings/sec, 250 secs
lola: 87959753 markings, 175744024 edges, 282404 markings/sec, 255 secs
lola: 89415257 markings, 178658360 edges, 291101 markings/sec, 260 secs
lola: 90834607 markings, 181491869 edges, 283870 markings/sec, 265 secs
lola: 92299791 markings, 184425688 edges, 293037 markings/sec, 270 secs
lola: 93717947 markings, 187265875 edges, 283631 markings/sec, 275 secs
lola: 95170545 markings, 190163201 edges, 290520 markings/sec, 280 secs
lola: 96642259 markings, 193114323 edges, 294343 markings/sec, 285 secs
lola: 98118477 markings, 196058174 edges, 295244 markings/sec, 290 secs
lola: 99574697 markings, 198977510 edges, 291244 markings/sec, 295 secs
lola: 101047119 markings, 201916581 edges, 294484 markings/sec, 300 secs
lola: 102483341 markings, 204793130 edges, 287244 markings/sec, 305 secs
lola: 103945157 markings, 207716112 edges, 292363 markings/sec, 310 secs
lola: 105376307 markings, 210572883 edges, 286230 markings/sec, 315 secs
lola: 106802578 markings, 213431841 edges, 285254 markings/sec, 320 secs
lola: 108210277 markings, 216247834 edges, 281540 markings/sec, 325 secs
lola: 109540223 markings, 218903720 edges, 265989 markings/sec, 330 secs
lola: 110798843 markings, 221422262 edges, 251724 markings/sec, 335 secs
lola: 112191641 markings, 224208396 edges, 278560 markings/sec, 340 secs
lola: 113564371 markings, 226951986 edges, 274546 markings/sec, 345 secs
lola: 114063145 markings, 227955173 edges, 99755 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((p7 + 1 <= p6) AND (p15 <= p13))) OR (G ((G ((p6 <= p7)) OR (p15 <= p13))) AND X (F (((p7 + 1 <= p6) AND (p15 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((p7 + 1 <= p6) AND (p15 <= p13))) OR (G ((G ((p6 <= p7)) OR (p15 <= p13))) AND X (F (((p7 + 1 <= p6) AND (p15 <= p13)))))))
lola: processed formula length: 131
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 120004 markings, 120004 edges
lola: ========================================
lola: subprocess 4 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G ((p7 <= 2))) AND (3 <= p12))) OR (F ((p10 <= 1)) AND (3 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p12)
lola: processed formula length: 10
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p7 <= 2))) AND (3 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p7 <= 2))) AND (3 <= p12)))
lola: processed formula length: 38
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120004 markings, 120004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((p12 + 1 <= p8)) AND ((p14 <= 2) AND (X ((p14 <= 2)) OR ((p11 + 1 <= p8) OR (p12 + 1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((p12 + 1 <= p8)) AND ((p14 <= 2) AND (X ((p14 <= 2)) OR ((p11 + 1 <= p8) OR (p12 + 1 <= p8))))))))
lola: processed formula length: 111
lola: 74 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 160004 markings, 160004 edges
lola: ========================================
lola: subprocess 6 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p8 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p8 + 1 <= p3)))
lola: processed formula length: 22
lola: 74 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: 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: 160001 markings, 160001 edges
lola: ========================================
lola: subprocess 7 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((F ((p5 <= p11)) AND G (((p15 + 1 <= p12) OR (p10 <= 2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((F ((p5 <= p11)) AND G (((p15 + 1 <= p12) OR (p10 <= 2))))))))
lola: processed formula length: 75
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 9
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: 120027 markings, 120041 edges
lola: ========================================
lola: subprocess 8 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p10 + 1 <= p12)) AND X (F ((p1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p10 + 1 <= p12)) AND X (F ((p1 <= 1)))))
lola: processed formula length: 48
lola: 74 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: 120009 markings, 120009 edges
lola: ========================================
lola: subprocess 9 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p8)) AND ((1 <= p2) OR ((p1 <= p8) U (3 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p8)) AND ((1 <= p2) OR ((p1 <= p8) U (3 <= p8))))))
lola: processed formula length: 67
lola: 74 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: 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: add low 4
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: 20006 markings, 20008 edges
lola: ========================================
lola: subprocess 10 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (F ((p6 <= p5))) OR (G (F ((p6 <= p5))) AND F (G ((p4 + 1 <= p12))))) AND (p6 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (F ((p6 <= p5))) OR (G (F ((p6 <= p5))) AND F (G ((p4 + 1 <= p12))))) AND (p6 <= p5)))
lola: processed formula length: 93
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 6467020 markings, 9427825 edges, 1293404 markings/sec, 0 secs
lola: 12707739 markings, 18548907 edges, 1248144 markings/sec, 5 secs
lola: 18859648 markings, 27534659 edges, 1230382 markings/sec, 10 secs
lola: 24948159 markings, 36423805 edges, 1217702 markings/sec, 15 secs
lola: 30932717 markings, 45186930 edges, 1196912 markings/sec, 20 secs
lola: 36866362 markings, 53840088 edges, 1186729 markings/sec, 25 secs
lola: 42590357 markings, 62206164 edges, 1144799 markings/sec, 30 secs
lola: 48684426 markings, 71136161 edges, 1218814 markings/sec, 35 secs
lola: 54464217 markings, 79573143 edges, 1155958 markings/sec, 40 secs
lola: 60298940 markings, 88089680 edges, 1166945 markings/sec, 45 secs
lola: 66101417 markings, 96575347 edges, 1160495 markings/sec, 50 secs
lola: 71782849 markings, 104876565 edges, 1136286 markings/sec, 55 secs
lola: 77547988 markings, 113305334 edges, 1153028 markings/sec, 60 secs
lola: 83443145 markings, 121932227 edges, 1179031 markings/sec, 65 secs
lola: 89198893 markings, 130346688 edges, 1151150 markings/sec, 70 secs
lola: 95032179 markings, 138862759 edges, 1166657 markings/sec, 75 secs
lola: 100612787 markings, 147026882 edges, 1116122 markings/sec, 80 secs
lola: 106073547 markings, 154992209 edges, 1092152 markings/sec, 85 secs
lola: 110959188 markings, 162146547 edges, 977128 markings/sec, 90 secs
lola: 116059741 markings, 169595165 edges, 1020111 markings/sec, 95 secs
lola: 120476854 markings, 176064559 edges, 883423 markings/sec, 100 secs
lola: 124654614 markings, 182161728 edges, 835552 markings/sec, 105 secs
lola: 129513378 markings, 189255729 edges, 971753 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) U G ((F ((p1 <= p15)) AND ((p2 + 1 <= p12) OR (p1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p6) U G ((F ((p1 <= p15)) AND ((p2 + 1 <= p12) OR (p1 <= p15)))))
lola: processed formula length: 72
lola: 74 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: 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: 60004 markings, 80004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((p1 <= p9))) U G ((F (((1 <= p8) AND (p1 <= p9))) AND (p1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((p1 <= p9))) U G ((F (((1 <= p8) AND (p1 <= p9))) AND (p1 <= p9))))
lola: processed formula length: 74
lola: 74 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: 3898559 markings, 7635116 edges, 779712 markings/sec, 0 secs
lola: 7322893 markings, 14480813 edges, 684867 markings/sec, 5 secs
lola: 10389219 markings, 20612632 edges, 613265 markings/sec, 10 secs
lola: 12783344 markings, 25401590 edges, 478825 markings/sec, 15 secs
lola: 15055741 markings, 29946390 edges, 454479 markings/sec, 20 secs
lola: 17212771 markings, 34259595 edges, 431406 markings/sec, 25 secs
lola: 19421959 markings, 38678015 edges, 441838 markings/sec, 30 secs
lola: 21496631 markings, 42825597 edges, 414934 markings/sec, 35 secs
lola: 23358673 markings, 46552377 edges, 372408 markings/sec, 40 secs
lola: 25305211 markings, 50444164 edges, 389308 markings/sec, 45 secs
lola: 27132443 markings, 54098035 edges, 365446 markings/sec, 50 secs
lola: 28924624 markings, 57679776 edges, 358436 markings/sec, 55 secs
lola: 30727463 markings, 61287822 edges, 360568 markings/sec, 60 secs
lola: 32518561 markings, 64865981 edges, 358220 markings/sec, 65 secs
lola: 34367881 markings, 68568448 edges, 369864 markings/sec, 70 secs
lola: 36082043 markings, 71992963 edges, 342832 markings/sec, 75 secs
lola: 37746751 markings, 75325511 edges, 332942 markings/sec, 80 secs
lola: 39429023 markings, 78688401 edges, 336454 markings/sec, 85 secs
lola: 41066631 markings, 81964760 edges, 327522 markings/sec, 90 secs
lola: 42742499 markings, 85318297 edges, 335174 markings/sec, 95 secs
lola: 44351555 markings, 88535312 edges, 321811 markings/sec, 100 secs
lola: 45956140 markings, 91740203 edges, 320917 markings/sec, 105 secs
lola: 47567967 markings, 94963235 edges, 322365 markings/sec, 110 secs
lola: 48971863 markings, 97776398 edges, 280779 markings/sec, 115 secs
lola: 50593272 markings, 101018457 edges, 324282 markings/sec, 120 secs
lola: 52224734 markings, 104281604 edges, 326292 markings/sec, 125 secs
lola: 53866913 markings, 107561193 edges, 328436 markings/sec, 130 secs
lola: 55525555 markings, 110881411 edges, 331728 markings/sec, 135 secs
lola: 57219911 markings, 114269992 edges, 338871 markings/sec, 140 secs
lola: 58902657 markings, 117630938 edges, 336549 markings/sec, 145 secs
lola: 60478523 markings, 120787819 edges, 315173 markings/sec, 150 secs
lola: 62045349 markings, 123921067 edges, 313365 markings/sec, 155 secs
lola: 63640357 markings, 127105128 edges, 319002 markings/sec, 160 secs
lola: 65196161 markings, 130220937 edges, 311161 markings/sec, 165 secs
lola: 66738870 markings, 133308865 edges, 308542 markings/sec, 170 secs
lola: 68246674 markings, 136317135 edges, 301561 markings/sec, 175 secs
lola: 69782573 markings, 139392511 edges, 307180 markings/sec, 180 secs
lola: 71283923 markings, 142398185 edges, 300270 markings/sec, 185 secs
lola: 72830553 markings, 145490854 edges, 309326 markings/sec, 190 secs
lola: 74398044 markings, 148621870 edges, 313498 markings/sec, 195 secs
lola: 75949817 markings, 151728884 edges, 310355 markings/sec, 200 secs
lola: 77432891 markings, 154695787 edges, 296615 markings/sec, 205 secs
lola: 78952253 markings, 157727614 edges, 303872 markings/sec, 210 secs
lola: 80457807 markings, 160743029 edges, 301111 markings/sec, 215 secs
lola: 81920859 markings, 163666607 edges, 292610 markings/sec, 220 secs
lola: 83407230 markings, 166640847 edges, 297274 markings/sec, 225 secs
lola: 84889503 markings, 169606459 edges, 296455 markings/sec, 230 secs
lola: 86397849 markings, 172617743 edges, 301669 markings/sec, 235 secs
lola: 87846099 markings, 175517350 edges, 289650 markings/sec, 240 secs
lola: 89339693 markings, 178501769 edges, 298719 markings/sec, 245 secs
lola: 90788385 markings, 181403497 edges, 289738 markings/sec, 250 secs
lola: 92269169 markings, 184360562 edges, 296157 markings/sec, 255 secs
lola: 93697913 markings, 187224304 edges, 285749 markings/sec, 260 secs
lola: 95193253 markings, 190209267 edges, 299068 markings/sec, 265 secs
lola: 96676969 markings, 193176206 edges, 296743 markings/sec, 270 secs
lola: 98160101 markings, 196147873 edges, 296626 markings/sec, 275 secs
lola: 99670601 markings, 199165067 edges, 302100 markings/sec, 280 secs
lola: 101200529 markings, 202227067 edges, 305986 markings/sec, 285 secs
lola: 102696943 markings, 205218163 edges, 299283 markings/sec, 290 secs
lola: 104189801 markings, 208208594 edges, 298572 markings/sec, 295 secs
lola: 105728255 markings, 211284783 edges, 307691 markings/sec, 300 secs
lola: 107270895 markings, 214361719 edges, 308528 markings/sec, 305 secs
lola: 108793381 markings, 217413902 edges, 304497 markings/sec, 310 secs
lola: 110336513 markings, 220496200 edges, 308626 markings/sec, 315 secs
lola: 111839975 markings, 223506472 edges, 300692 markings/sec, 320 secs
lola: 113245095 markings, 226312822 edges, 281024 markings/sec, 325 secs
lola: 114660701 markings, 229140059 edges, 283121 markings/sec, 330 secs
lola: 116034461 markings, 231887698 edges, 274752 markings/sec, 335 secs
lola: 117390205 markings, 234601031 edges, 271149 markings/sec, 340 secs
lola: 118724045 markings, 237274894 edges, 266768 markings/sec, 345 secs
lola: 120062525 markings, 239948612 edges, 267696 markings/sec, 350 secs
lola: 121388561 markings, 242596377 edges, 265207 markings/sec, 355 secs
lola: 122712756 markings, 245244979 edges, 264839 markings/sec, 360 secs
lola: 124040091 markings, 247901891 edges, 265467 markings/sec, 365 secs
lola: 125367686 markings, 250562795 edges, 265519 markings/sec, 370 secs
lola: 126692205 markings, 253211434 edges, 264904 markings/sec, 375 secs
lola: 128035789 markings, 255892154 edges, 268717 markings/sec, 380 secs
lola: 129379693 markings, 258576833 edges, 268781 markings/sec, 385 secs
lola: 130440569 markings, 260703429 edges, 212175 markings/sec, 390 secs
lola: 131749835 markings, 263319466 edges, 261853 markings/sec, 395 secs
lola: 133087737 markings, 265993233 edges, 267580 markings/sec, 400 secs
lola: 134406983 markings, 268641642 edges, 263849 markings/sec, 405 secs
lola: 135719205 markings, 271261067 edges, 262444 markings/sec, 410 secs
lola: 137013412 markings, 273844174 edges, 258841 markings/sec, 415 secs
lola: 138304969 markings, 276438080 edges, 258311 markings/sec, 420 secs
lola: 139613507 markings, 279048788 edges, 261708 markings/sec, 425 secs
lola: 140191847 markings, 280211798 edges, 115668 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (((G (F ((p6 <= p5))) OR (G (F ((p6 <= p5))) AND F (G ((p4 + 1 <= p12))))) AND (p6 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (F ((p6 <= p5))) OR (G (F ((p6 <= p5))) AND F (G ((p4 + 1 <= p12))))) AND (p6 <= p5)))
lola: processed formula length: 93
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 6443009 markings, 9391237 edges, 1288602 markings/sec, 0 secs
lola: 12742032 markings, 18601164 edges, 1259805 markings/sec, 5 secs
lola: 18978163 markings, 27715254 edges, 1247226 markings/sec, 10 secs
lola: 25080092 markings, 36624845 edges, 1220386 markings/sec, 15 secs
lola: 31239897 markings, 45622631 edges, 1231961 markings/sec, 20 secs
lola: 37260336 markings, 54440430 edges, 1204088 markings/sec, 25 secs
lola: 43172474 markings, 63060818 edges, 1182428 markings/sec, 30 secs
lola: 49227086 markings, 71928576 edges, 1210922 markings/sec, 35 secs
lola: 55157264 markings, 80578566 edges, 1186036 markings/sec, 40 secs
lola: 61019670 markings, 89155553 edges, 1172481 markings/sec, 45 secs
lola: 66856032 markings, 97692853 edges, 1167272 markings/sec, 50 secs
lola: 72672876 markings, 106183561 edges, 1163369 markings/sec, 55 secs
lola: 78528144 markings, 114734142 edges, 1171054 markings/sec, 60 secs
lola: 84522466 markings, 123512141 edges, 1198864 markings/sec, 65 secs
lola: 90418414 markings, 132107860 edges, 1179190 markings/sec, 70 secs
lola: 96297781 markings, 140710691 edges, 1175873 markings/sec, 75 secs
lola: 102099563 markings, 149195300 edges, 1160356 markings/sec, 80 secs
lola: 107251067 markings, 156724387 edges, 1030301 markings/sec, 85 secs
lola: 112166497 markings, 163914908 edges, 983086 markings/sec, 90 secs
lola: 117348098 markings, 171492809 edges, 1036320 markings/sec, 95 secs
lola: 122470380 markings, 178975598 edges, 1024456 markings/sec, 100 secs
lola: 127340205 markings, 186070511 edges, 973965 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no unknown no no no no no no no
lola:
preliminary result: no no unknown no unknown no no no no no no no
lola: memory consumption: 3064 KB
lola: time consumption: 1031 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="Kanban-PT-20000"
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 Kanban-PT-20000, 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 r184-oct2-158987928700569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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