Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500289.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Kanban-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 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-50000-00
FORMULA_NAME Kanban-PT-50000-01
FORMULA_NAME Kanban-PT-50000-02
FORMULA_NAME Kanban-PT-50000-03
FORMULA_NAME Kanban-PT-50000-04
FORMULA_NAME Kanban-PT-50000-05
FORMULA_NAME Kanban-PT-50000-06
FORMULA_NAME Kanban-PT-50000-07
FORMULA_NAME Kanban-PT-50000-08
FORMULA_NAME Kanban-PT-50000-09
FORMULA_NAME Kanban-PT-50000-10
FORMULA_NAME Kanban-PT-50000-11
FORMULA_NAME Kanban-PT-50000-12
FORMULA_NAME Kanban-PT-50000-13
FORMULA_NAME Kanban-PT-50000-14
FORMULA_NAME Kanban-PT-50000-15

=== Now, execution of the tool begins

BK_START 1620928016097

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 17:46:57] [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]
[2021-05-13 17:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:46:57] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 17:46:57] [INFO ] Transformed 16 places.
[2021-05-13 17:46:57] [INFO ] Transformed 16 transitions.
[2021-05-13 17:46:57] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=2325 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 17:46:57] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 17:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 17:46:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 11 ms.
[2021-05-13 17:46:57] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 17:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:46:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:57] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 17:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:46:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2021-05-13 17:46:57] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 17:46:57] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 8 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 3 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:46:58] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 14 causal constraints over 4 iterations in 10 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 13 causal constraints over 4 iterations in 8 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 13 causal constraints over 4 iterations in 8 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 13 causal constraints over 4 iterations in 10 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:58] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:58] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 13 causal constraints over 4 iterations in 8 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 11 causal constraints over 3 iterations in 6 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 9 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:46:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:46:59] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:46:59] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 17:46:59] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 17:46:59] [INFO ] Flatten gal took : 21 ms
FORMULA Kanban-PT-50000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:46:59] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:46:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 17:46:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-50000 @ 3570 seconds

FORMULA Kanban-PT-50000-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-50000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Kanban-PT-50000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-50000-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1251
rslt: Output for LTLCardinality @ Kanban-PT-50000

{
"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": "Thu May 13 17:47:00 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X ((p12 <= 0)) OR (G ((p0 <= 2)) AND X (F ((p12 <= 0))))))",
"processed_size": 62,
"rewrites": 51
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 5,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X (X ((2 <= p7))) AND G ((X (G ((2 <= p7))) OR (G ((p5 + 1 <= p14)) AND F (G ((2 <= p7)))))))))",
"processed_size": 102,
"rewrites": 51
},
"result":
{
"edges": 300004,
"markings": 300004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p13)) AND (((p1 <= p6) U (p2 <= p0)) OR X (F ((1 <= p13)))))))",
"processed_size": 78,
"rewrites": 51
},
"result":
{
"edges": 300011,
"markings": 300009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 400
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 400
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F ((p3 <= p0)) OR G ((p14 <= p8))) U (p3 <= p0))",
"processed_size": 50,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "X (((p8 <= p7) OR F ((p7 + 1 <= p8))))",
"processed_size": 38,
"rewrites": 51
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"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": "(p1 <= 0)",
"processed_size": 9,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (X (F (((p1 <= 0) OR (p9 <= 1)))))",
"processed_size": 37,
"rewrites": 51
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((p9 + 1 <= p11)) OR (3 <= p8))))",
"processed_size": 42,
"rewrites": 51
},
"result":
{
"edges": 300004,
"markings": 300004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p9 <= 1)))",
"processed_size": 17,
"rewrites": 51
},
"result":
{
"edges": 50002,
"markings": 50002,
"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": 1187
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G (((p2 + 1 <= p15) AND (1 <= p15)))",
"processed_size": 36,
"rewrites": 51
},
"result":
{
"edges": 50002,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 2373
},
"exit":
{
"localtimelimitreached": false
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p9 <= 2)))",
"processed_size": 17,
"rewrites": 51
},
"result":
{
"edges": 50004,
"markings": 50003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))",
"processed_size": 37,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))",
"processed_size": 37,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3520,
"runtime": 2319.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : (F(G(**)) OR G((* AND **))) : X((X(**) OR (G(**) AND X(F(**))))) : X(G((X(X(**)) AND G((X(G(**)) OR (G(**) AND F(G(**)))))))) : F(G((F(**) AND ((** U **) OR X(F(**)))))) : X(G(**)) : F(G(**)) : (((F(**) OR G(**)) U **) AND X((** OR F(**)))) : (X(X(F(*))) AND **) : (F((X(F(*)) R *)) AND X(X((F(*) OR **)))) : (F((G(*) OR *)) AND G(((** U **) OR **))) : G((F((X(**) OR G(**))) OR **))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no yes no no unknown unknown yes yes no unknown unknown ",
"value": "no no yes no no unknown unknown yes yes no unknown unknown "
},
"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: X (NOT(G (F (G (X ((2 <= p9))))))) : (F (G ((p9 <= 2))) OR (G (NOT(F ((p15 <= p2)))) AND G ((1 <= p15)))) : (G (X ((p0 <= 2))) U X (X ((p12 <= 0)))) : G ((X (X (X ((2 <= p7)))) AND X (G ((G ((p5 + 1 <= p14)) U X (G ((2 <= p7)))))))) : F (G ((((p1 <= p6) U (p2 <= p0)) U F (X ((1 <= p13)))))) : G (X ((p15 <= p10))) : F (((p4 + 1 <= p2) U G (F (G ((p2 <= p4)))))) : (((F ((p3 <= p0)) OR G ((p14 <= p8))) U (p3 <= p0)) AND (X ((p8 <= p7)) OR X (F ((p7 + 1 <= p8))))) : (NOT(X (G (X (((1 <= p1) AND (2 <= p9)))))) AND (p1 <= 0)) : (F (NOT((G (X ((p11 <= p9))) U (3 <= p8)))) AND X (X ((NOT(G ((p11 <= p9))) OR (3 <= p8))))) : (NOT(G ((F ((p7 <= p1)) AND (2 <= p1)))) AND G ((((p7 <= p1) U (2 <= p1)) OR (p2 <= p8)))) : G ((F ((X ((2 <= p5)) OR G ((1 <= p1)))) OR (1 <= p13)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p12 <= 0)) OR (G ((p0 <= 2)) AND X (F ((p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p12 <= 0)) OR (G ((p0 <= 2)) AND X (F ((p12 <= 0))))))
lola: processed formula length: 62
lola: 51 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X ((2 <= p7))) AND G ((X (G ((2 <= p7))) OR (G ((p5 + 1 <= p14)) AND F (G ((2 <= p7)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X ((2 <= p7))) AND G ((X (G ((2 <= p7))) OR (G ((p5 + 1 <= p14)) AND F (G ((2 <= p7)))))))))
lola: processed formula length: 102
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 300004 markings, 300004 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p13)) AND (((p1 <= p6) U (p2 <= p0)) OR X (F ((1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p13)) AND (((p1 <= p6) U (p2 <= p0)) OR X (F ((1 <= p13)))))))
lola: processed formula length: 78
lola: 51 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: 300009 markings, 300011 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p15 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p15 <= p10)))
lola: processed formula length: 20
lola: 51 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: 3298689 markings, 6085577 edges, 659738 markings/sec, 0 secs
lola: 5921646 markings, 11325809 edges, 524591 markings/sec, 5 secs
lola: 8407349 markings, 16293565 edges, 497141 markings/sec, 10 secs
lola: 10736240 markings, 20948546 edges, 465778 markings/sec, 15 secs
lola: 12945121 markings, 25362440 edges, 441776 markings/sec, 20 secs
lola: 15027400 markings, 29525182 edges, 416456 markings/sec, 25 secs
lola: 17048884 markings, 33565586 edges, 404297 markings/sec, 30 secs
lola: 19004015 markings, 37477143 edges, 391026 markings/sec, 35 secs
lola: 20907581 markings, 41280759 edges, 380713 markings/sec, 40 secs
lola: 22749489 markings, 44961907 edges, 368382 markings/sec, 45 secs
lola: 24556197 markings, 48573868 edges, 361342 markings/sec, 50 secs
lola: 26336545 markings, 52136545 edges, 356070 markings/sec, 55 secs
lola: 28092502 markings, 55645684 edges, 351191 markings/sec, 60 secs
lola: 29835372 markings, 59132614 edges, 348574 markings/sec, 65 secs
lola: 31553248 markings, 62566970 edges, 343575 markings/sec, 70 secs
lola: 33281927 markings, 66021733 edges, 345736 markings/sec, 75 secs
lola: 34985329 markings, 69425937 edges, 340680 markings/sec, 80 secs
lola: 36640715 markings, 72736963 edges, 331077 markings/sec, 85 secs
lola: 38270157 markings, 75995005 edges, 325888 markings/sec, 90 secs
lola: 39899695 markings, 79249655 edges, 325908 markings/sec, 95 secs
lola: 41506458 markings, 82464080 edges, 321353 markings/sec, 100 secs
lola: 43124786 markings, 85700749 edges, 323666 markings/sec, 105 secs
lola: 44708597 markings, 88869053 edges, 316762 markings/sec, 110 secs
lola: 46312702 markings, 92075767 edges, 320821 markings/sec, 115 secs
lola: 47886194 markings, 95218316 edges, 314698 markings/sec, 120 secs
lola: 49484397 markings, 98418990 edges, 319641 markings/sec, 125 secs
lola: 51051713 markings, 101548897 edges, 313463 markings/sec, 130 secs
lola: 52608856 markings, 104662451 edges, 311429 markings/sec, 135 secs
lola: 54151782 markings, 107748643 edges, 308585 markings/sec, 140 secs
lola: 55697393 markings, 110839770 edges, 309122 markings/sec, 145 secs
lola: 57225744 markings, 113895767 edges, 305670 markings/sec, 150 secs
lola: 58742921 markings, 116925468 edges, 303435 markings/sec, 155 secs
lola: 60253335 markings, 119951143 edges, 302083 markings/sec, 160 secs
lola: 61765312 markings, 122968752 edges, 302395 markings/sec, 165 secs
lola: 63247803 markings, 125938734 edges, 296498 markings/sec, 170 secs
lola: 64742038 markings, 128926275 edges, 298847 markings/sec, 175 secs
lola: 66237168 markings, 131915016 edges, 299026 markings/sec, 180 secs
lola: 67722888 markings, 134886176 edges, 297144 markings/sec, 185 secs
lola: 69221140 markings, 137880923 edges, 299650 markings/sec, 190 secs
lola: 70712387 markings, 140864098 edges, 298249 markings/sec, 195 secs
lola: 72199010 markings, 143833885 edges, 297325 markings/sec, 200 secs
lola: 73678889 markings, 146790937 edges, 295976 markings/sec, 205 secs
lola: 75156533 markings, 149744630 edges, 295529 markings/sec, 210 secs
lola: 76632696 markings, 152699304 edges, 295233 markings/sec, 215 secs
lola: 78094338 markings, 155623241 edges, 292328 markings/sec, 220 secs
lola: 79569909 markings, 158573247 edges, 295114 markings/sec, 225 secs
lola: 81034622 markings, 161504506 edges, 292943 markings/sec, 230 secs
lola: 82498258 markings, 164429442 edges, 292727 markings/sec, 235 secs
lola: 83954412 markings, 167337596 edges, 291231 markings/sec, 240 secs
lola: 85416100 markings, 170264084 edges, 292338 markings/sec, 245 secs
lola: 86883439 markings, 173194955 edges, 293468 markings/sec, 250 secs
lola: 88329406 markings, 176089269 edges, 289193 markings/sec, 255 secs
lola: 89749548 markings, 178929697 edges, 284028 markings/sec, 260 secs
lola: 90828172 markings, 181087941 edges, 215725 markings/sec, 265 secs
lola: 92078486 markings, 183581042 edges, 250063 markings/sec, 270 secs
lola: 93439181 markings, 186302780 edges, 272139 markings/sec, 275 secs
lola: 94535577 markings, 188499220 edges, 219279 markings/sec, 280 secs
lola: 95943174 markings, 191311118 edges, 281519 markings/sec, 285 secs
lola: 96992170 markings, 193410545 edges, 209799 markings/sec, 290 secs
lola: 98141596 markings, 195708048 edges, 229885 markings/sec, 295 secs
lola: 99340083 markings, 198105970 edges, 239697 markings/sec, 300 secs
lola: 100466761 markings, 200360275 edges, 225336 markings/sec, 305 secs
lola: 101665644 markings, 202754885 edges, 239777 markings/sec, 310 secs
lola: 102819936 markings, 205069154 edges, 230858 markings/sec, 315 secs
lola: 104234823 markings, 207894355 edges, 282977 markings/sec, 320 secs
lola: 105176409 markings, 209780988 edges, 188317 markings/sec, 325 secs
lola: 106399447 markings, 212220103 edges, 244608 markings/sec, 330 secs
lola: 107421697 markings, 214265339 edges, 204450 markings/sec, 335 secs
lola: 108802145 markings, 217029780 edges, 276090 markings/sec, 340 secs
lola: 109792837 markings, 219002893 edges, 198138 markings/sec, 345 secs
lola: 110882249 markings, 221180891 edges, 217882 markings/sec, 350 secs
lola: 112089697 markings, 223603441 edges, 241490 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F ((p3 <= p0)) OR G ((p14 <= p8))) U (p3 <= p0)) AND X (((p8 <= p7) OR F ((p7 + 1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p3 <= p0)) OR G ((p14 <= p8))) U (p3 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p3 <= p0)) OR G ((p14 <= p8))) U (p3 <= p0))
lola: processed formula length: 50
lola: 51 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p8 <= p7) OR F ((p7 + 1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p8 <= p7) OR F ((p7 + 1 <= p8))))
lola: processed formula length: 38
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((p1 <= 0) OR (p9 <= 1))))) AND (p1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= 0)
lola: processed formula length: 9
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((p1 <= 0) OR (p9 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((p1 <= 0) OR (p9 <= 1)))))
lola: processed formula length: 37
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (F ((p9 + 1 <= p11))) R (p8 <= 2))) AND X (X ((F ((p9 + 1 <= p11)) OR (3 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p9 + 1 <= p11))) R (p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p9 + 1 <= p11))) R (p8 <= 2)))
lola: processed formula length: 41
lola: 51 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: 3206850 markings, 5902684 edges, 641370 markings/sec, 0 secs
lola: 5757163 markings, 10998747 edges, 510063 markings/sec, 5 secs
lola: 8214789 markings, 15907999 edges, 491525 markings/sec, 10 secs
lola: 10448567 markings, 20373760 edges, 446756 markings/sec, 15 secs
lola: 12558848 markings, 24591215 edges, 422056 markings/sec, 20 secs
lola: 14464263 markings, 28402470 edges, 381083 markings/sec, 25 secs
lola: 16388240 markings, 32246576 edges, 384795 markings/sec, 30 secs
lola: 18186835 markings, 35842349 edges, 359719 markings/sec, 35 secs
lola: 19857214 markings, 39183643 edges, 334076 markings/sec, 40 secs
lola: 21707572 markings, 42883100 edges, 370072 markings/sec, 45 secs
lola: 23479427 markings, 46423687 edges, 354371 markings/sec, 50 secs
lola: 25291334 markings, 50044317 edges, 362381 markings/sec, 55 secs
lola: 27115184 markings, 53691017 edges, 364770 markings/sec, 60 secs
lola: 28899171 markings, 57257337 edges, 356797 markings/sec, 65 secs
lola: 30616388 markings, 60694029 edges, 343443 markings/sec, 70 secs
lola: 32340959 markings, 64138638 edges, 344914 markings/sec, 75 secs
lola: 34058960 markings, 67572599 edges, 343600 markings/sec, 80 secs
lola: 35739720 markings, 70932326 edges, 336152 markings/sec, 85 secs
lola: 37444363 markings, 74345999 edges, 340929 markings/sec, 90 secs
lola: 39133669 markings, 77723144 edges, 337861 markings/sec, 95 secs
lola: 40795707 markings, 81043696 edges, 332408 markings/sec, 100 secs
lola: 42446507 markings, 84346831 edges, 330160 markings/sec, 105 secs
lola: 44100555 markings, 87652768 edges, 330810 markings/sec, 110 secs
lola: 45734703 markings, 90920419 edges, 326830 markings/sec, 115 secs
lola: 47368501 markings, 94184077 edges, 326760 markings/sec, 120 secs
lola: 48983916 markings, 97418883 edges, 323083 markings/sec, 125 secs
lola: 50587826 markings, 100620038 edges, 320782 markings/sec, 130 secs
lola: 52178651 markings, 103801504 edges, 318165 markings/sec, 135 secs
lola: 53755947 markings, 106955042 edges, 315459 markings/sec, 140 secs
lola: 55324253 markings, 110090374 edges, 313661 markings/sec, 145 secs
lola: 56886254 markings, 113213871 edges, 312400 markings/sec, 150 secs
lola: 58453160 markings, 116346039 edges, 313381 markings/sec, 155 secs
lola: 60004583 markings, 119454704 edges, 310285 markings/sec, 160 secs
lola: 61535690 markings, 122514019 edges, 306221 markings/sec, 165 secs
lola: 63072619 markings, 125586991 edges, 307386 markings/sec, 170 secs
lola: 64599464 markings, 128642471 edges, 305369 markings/sec, 175 secs
lola: 66122147 markings, 131683204 edges, 304537 markings/sec, 180 secs
lola: 67658552 markings, 134756438 edges, 307281 markings/sec, 185 secs
lola: 69162738 markings, 137762390 edges, 300837 markings/sec, 190 secs
lola: 70688114 markings, 140810807 edges, 305075 markings/sec, 195 secs
lola: 72212591 markings, 143864357 edges, 304895 markings/sec, 200 secs
lola: 73731705 markings, 146895340 edges, 303823 markings/sec, 205 secs
lola: 75226590 markings, 149885770 edges, 298977 markings/sec, 210 secs
lola: 76788974 markings, 153011241 edges, 312477 markings/sec, 215 secs
lola: 78352776 markings, 156142386 edges, 312760 markings/sec, 220 secs
lola: 79850144 markings, 159129568 edges, 299474 markings/sec, 225 secs
lola: 81384748 markings, 162199434 edges, 306921 markings/sec, 230 secs
lola: 82837841 markings, 165111961 edges, 290619 markings/sec, 235 secs
lola: 84360417 markings, 168150388 edges, 304515 markings/sec, 240 secs
lola: 85834114 markings, 171101876 edges, 294739 markings/sec, 245 secs
lola: 87370463 markings, 174172684 edges, 307270 markings/sec, 250 secs
lola: 88894395 markings, 177216276 edges, 304786 markings/sec, 255 secs
lola: 90306703 markings, 180041936 edges, 282462 markings/sec, 260 secs
lola: 91307110 markings, 182047349 edges, 200081 markings/sec, 265 secs
lola: 92334697 markings, 184100655 edges, 205517 markings/sec, 270 secs
lola: 92962266 markings, 185350143 edges, 125514 markings/sec, 275 secs
lola: 93997088 markings, 187419545 edges, 206964 markings/sec, 280 secs
lola: 94669702 markings, 188768884 edges, 134523 markings/sec, 285 secs
lola: 95634894 markings, 190698279 edges, 193038 markings/sec, 290 secs
lola: 96647043 markings, 192718853 edges, 202430 markings/sec, 295 secs
lola: 97289734 markings, 194002452 edges, 128538 markings/sec, 300 secs
lola: 98358068 markings, 196140203 edges, 213667 markings/sec, 305 secs
lola: 99383084 markings, 198188666 edges, 205003 markings/sec, 310 secs
lola: 100513343 markings, 200453624 edges, 226052 markings/sec, 315 secs
lola: 101581863 markings, 202583901 edges, 213704 markings/sec, 320 secs
lola: 102757676 markings, 204942988 edges, 235163 markings/sec, 325 secs
lola: 103863329 markings, 207145810 edges, 221131 markings/sec, 330 secs
lola: 104997374 markings, 209418948 edges, 226809 markings/sec, 335 secs
lola: 106051996 markings, 211526978 edges, 210924 markings/sec, 340 secs
lola: 107183172 markings, 213788551 edges, 226235 markings/sec, 345 secs
lola: 108262739 markings, 215951476 edges, 215913 markings/sec, 350 secs
lola: 109536893 markings, 218496625 edges, 254831 markings/sec, 355 secs
lola: 110815744 markings, 221050926 edges, 255770 markings/sec, 360 secs
lola: 111918603 markings, 223258943 edges, 220572 markings/sec, 365 secs
lola: 112348463 markings, 224119784 edges, 85972 markings/sec, 370 secs
lola: 112348635 markings, 224119955 edges, 34 markings/sec, 375 secs
lola: 112348874 markings, 224120195 edges, 48 markings/sec, 380 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p9 + 1 <= p11)) OR (3 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p9 + 1 <= p11)) OR (3 <= p8))))
lola: processed formula length: 42
lola: 51 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: 300004 markings, 300004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X ((2 <= p5)) OR G ((1 <= p1)))) OR (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X ((2 <= p5)) OR G ((1 <= p1)))) OR (1 <= p13)))
lola: processed formula length: 56
lola: 51 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: 3750779 markings, 6783129 edges, 750156 markings/sec, 0 secs
lola: 6752940 markings, 13521627 edges, 600432 markings/sec, 5 secs
lola: 9757235 markings, 19962279 edges, 600859 markings/sec, 10 secs
lola: 12792104 markings, 25640923 edges, 606974 markings/sec, 15 secs
lola: 16536044 markings, 31439822 edges, 748788 markings/sec, 20 secs
lola: 19586731 markings, 37720520 edges, 610137 markings/sec, 25 secs
lola: 22606067 markings, 44071276 edges, 603867 markings/sec, 30 secs
lola: 25730638 markings, 50263398 edges, 624914 markings/sec, 35 secs
lola: 28627017 markings, 56645407 edges, 579276 markings/sec, 40 secs
lola: 31443532 markings, 62687047 edges, 563303 markings/sec, 45 secs
lola: 34595201 markings, 67997576 edges, 630334 markings/sec, 50 secs
lola: 37871245 markings, 73884790 edges, 655209 markings/sec, 55 secs
lola: 40770817 markings, 80487605 edges, 579914 markings/sec, 60 secs
lola: 43802458 markings, 86329907 edges, 606328 markings/sec, 65 secs
lola: 46831425 markings, 92432329 edges, 605793 markings/sec, 70 secs
lola: 49877969 markings, 98920284 edges, 609309 markings/sec, 75 secs
lola: 53035035 markings, 104201583 edges, 631413 markings/sec, 80 secs
lola: 56117025 markings, 109889504 edges, 616398 markings/sec, 85 secs
lola: 59218891 markings, 116142557 edges, 620373 markings/sec, 90 secs
lola: 62316240 markings, 122236414 edges, 619470 markings/sec, 95 secs
lola: 65080866 markings, 128423720 edges, 552925 markings/sec, 100 secs
lola: 68821417 markings, 134445909 edges, 748110 markings/sec, 105 secs
lola: 72398525 markings, 140022962 edges, 715422 markings/sec, 110 secs
lola: 75918228 markings, 145640816 edges, 703941 markings/sec, 115 secs
lola: 79338103 markings, 151096698 edges, 683975 markings/sec, 120 secs
lola: 82746457 markings, 156533894 edges, 681671 markings/sec, 125 secs
lola: 86117497 markings, 161907486 edges, 674208 markings/sec, 130 secs
lola: 89477157 markings, 167175925 edges, 671932 markings/sec, 135 secs
lola: 90930257 markings, 169533318 edges, 290620 markings/sec, 140 secs
lola: 92711314 markings, 172331319 edges, 356211 markings/sec, 145 secs
lola: 94655784 markings, 175391935 edges, 388894 markings/sec, 150 secs
lola: 96063289 markings, 177675812 edges, 281501 markings/sec, 155 secs
lola: 98446837 markings, 181450188 edges, 476710 markings/sec, 160 secs
lola: 98753710 markings, 181948132 edges, 61375 markings/sec, 165 secs
lola: 101602955 markings, 186478175 edges, 569849 markings/sec, 170 secs
lola: 102555107 markings, 188023176 edges, 190430 markings/sec, 175 secs
lola: 104807519 markings, 191584780 edges, 450482 markings/sec, 180 secs
lola: 105826266 markings, 193151750 edges, 203749 markings/sec, 185 secs
lola: 107950961 markings, 196592224 edges, 424939 markings/sec, 190 secs
lola: 108214211 markings, 197019385 edges, 52650 markings/sec, 195 secs
lola: 108214211 markings, 197019385 edges, 0 markings/sec, 200 secs
lola: 109187199 markings, 198504967 edges, 194598 markings/sec, 205 secs
lola: 109187261 markings, 198505066 edges, 12 markings/sec, 210 secs
lola: 109322159 markings, 198723961 edges, 26980 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p9 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p9 <= 1)))
lola: processed formula length: 17
lola: 51 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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 9 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p2 <= p4)))
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 <= p4)))
lola: processed formula length: 18
lola: 51 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: 5039870 markings, 7443793 edges, 1007974 markings/sec, 0 secs
lola: 9846145 markings, 14653835 edges, 961255 markings/sec, 5 secs
lola: 14610362 markings, 21796584 edges, 952843 markings/sec, 10 secs
lola: 19275978 markings, 28792307 edges, 933123 markings/sec, 15 secs
lola: 23879088 markings, 35705917 edges, 920622 markings/sec, 20 secs
lola: 28517470 markings, 42670831 edges, 927676 markings/sec, 25 secs
lola: 33208205 markings, 49711895 edges, 938147 markings/sec, 30 secs
lola: 37677461 markings, 56394445 edges, 893851 markings/sec, 35 secs
lola: 42187731 markings, 63173015 edges, 902054 markings/sec, 40 secs
lola: 46677708 markings, 69904354 edges, 897995 markings/sec, 45 secs
lola: 51250877 markings, 76755760 edges, 914634 markings/sec, 50 secs
lola: 55754728 markings, 83524994 edges, 900770 markings/sec, 55 secs
lola: 60316142 markings, 90365856 edges, 912283 markings/sec, 60 secs
lola: 64910854 markings, 97242987 edges, 918942 markings/sec, 65 secs
lola: 69451079 markings, 104065124 edges, 908045 markings/sec, 70 secs
lola: 73756338 markings, 110510175 edges, 861052 markings/sec, 75 secs
lola: 78117853 markings, 117071331 edges, 872303 markings/sec, 80 secs
lola: 82498170 markings, 123624516 edges, 876063 markings/sec, 85 secs
lola: 86896774 markings, 130240662 edges, 879721 markings/sec, 90 secs
lola: 91268335 markings, 136781109 edges, 874312 markings/sec, 95 secs
lola: 95695159 markings, 143438303 edges, 885365 markings/sec, 100 secs
lola: 100155435 markings, 150108744 edges, 892055 markings/sec, 105 secs
lola: 104178572 markings, 156146127 edges, 804627 markings/sec, 110 secs
lola: 104537414 markings, 156699755 edges, 71768 markings/sec, 115 secs
lola: 107128217 markings, 160578200 edges, 518161 markings/sec, 120 secs
lola: 108547057 markings, 162713776 edges, 283768 markings/sec, 125 secs
lola: 109662710 markings, 164372908 edges, 223131 markings/sec, 130 secs
lola: 113189680 markings, 169683543 edges, 705394 markings/sec, 135 secs
lola: 115466827 markings, 173086980 edges, 455429 markings/sec, 140 secs
lola: 117956568 markings, 176830567 edges, 497948 markings/sec, 145 secs
lola: 120032750 markings, 179929318 edges, 415236 markings/sec, 150 secs
lola: 122874982 markings, 184208925 edges, 568446 markings/sec, 155 secs
lola: 124100609 markings, 186028016 edges, 245125 markings/sec, 160 secs
lola: 125064532 markings, 187483312 edges, 192785 markings/sec, 165 secs
lola: 125182159 markings, 187671514 edges, 23525 markings/sec, 170 secs
lola: 125182334 markings, 187671794 edges, 35 markings/sec, 175 secs
lola: 125182528 markings, 187672106 edges, 39 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p9 <= 2))) OR G (((p2 + 1 <= p15) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2 + 1 <= p15) AND (1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2 + 1 <= p15) AND (1 <= p15)))
lola: processed formula length: 36
lola: 51 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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 11 will run for 2373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p9 <= 2)))
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 ((p9 <= 2)))
lola: processed formula length: 17
lola: 51 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: add low 7
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: 50003 markings, 50004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 2373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p1 + 1 <= p7)) OR (p1 <= 1))) AND G ((((p7 <= p1) U (2 <= p1)) OR (p2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))
lola: processed formula length: 37
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p15 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p15 <= p10)))
lola: processed formula length: 20
lola: 51 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: 3286279 markings, 6060567 edges, 657256 markings/sec, 0 secs
lola: 5879663 markings, 11242122 edges, 518677 markings/sec, 5 secs
lola: 8275968 markings, 16031421 edges, 479261 markings/sec, 10 secs
lola: 10489626 markings, 20455466 edges, 442732 markings/sec, 15 secs
lola: 12577072 markings, 24628215 edges, 417489 markings/sec, 20 secs
lola: 14596270 markings, 28665446 edges, 403840 markings/sec, 25 secs
lola: 16502604 markings, 32476244 edges, 381267 markings/sec, 30 secs
lola: 18250214 markings, 35970041 edges, 349522 markings/sec, 35 secs
lola: 20038790 markings, 39544431 edges, 357715 markings/sec, 40 secs
lola: 21951309 markings, 43366479 edges, 382504 markings/sec, 45 secs
lola: 23843985 markings, 47153700 edges, 378535 markings/sec, 50 secs
lola: 25663227 markings, 50789742 edges, 363848 markings/sec, 55 secs
lola: 27563803 markings, 54590240 edges, 380115 markings/sec, 60 secs
lola: 29278379 markings, 58019227 edges, 342915 markings/sec, 65 secs
lola: 30997908 markings, 61454884 edges, 343906 markings/sec, 70 secs
lola: 32579821 markings, 64618744 edges, 316383 markings/sec, 75 secs
lola: 34268410 markings, 67992870 edges, 337718 markings/sec, 80 secs
lola: 35983896 markings, 71425039 edges, 343097 markings/sec, 85 secs
lola: 37716784 markings, 74885927 edges, 346578 markings/sec, 90 secs
lola: 39428568 markings, 78309904 edges, 342357 markings/sec, 95 secs
lola: 41128420 markings, 81712106 edges, 339970 markings/sec, 100 secs
lola: 42821341 markings, 85095988 edges, 338584 markings/sec, 105 secs
lola: 44498437 markings, 88450477 edges, 335419 markings/sec, 110 secs
lola: 46158399 markings, 91764719 edges, 331992 markings/sec, 115 secs
lola: 47810428 markings, 95071847 edges, 330406 markings/sec, 120 secs
lola: 49461331 markings, 98370074 edges, 330181 markings/sec, 125 secs
lola: 51101854 markings, 101652505 edges, 328105 markings/sec, 130 secs
lola: 52729354 markings, 104904124 edges, 325500 markings/sec, 135 secs
lola: 54344990 markings, 108138091 edges, 323127 markings/sec, 140 secs
lola: 55958013 markings, 111358901 edges, 322605 markings/sec, 145 secs
lola: 57539716 markings, 114525516 edges, 316341 markings/sec, 150 secs
lola: 59139354 markings, 117718060 edges, 319928 markings/sec, 155 secs
lola: 60720408 markings, 120881536 edges, 316211 markings/sec, 160 secs
lola: 62299136 markings, 124037853 edges, 315746 markings/sec, 165 secs
lola: 63862084 markings, 127163388 edges, 312590 markings/sec, 170 secs
lola: 65429392 markings, 130298489 edges, 313462 markings/sec, 175 secs
lola: 66985130 markings, 133412230 edges, 311148 markings/sec, 180 secs
lola: 68606807 markings, 136655938 edges, 324335 markings/sec, 185 secs
lola: 70156932 markings, 139748733 edges, 310025 markings/sec, 190 secs
lola: 71743491 markings, 142923011 edges, 317312 markings/sec, 195 secs
lola: 73296291 markings, 146032709 edges, 310560 markings/sec, 200 secs
lola: 74853118 markings, 149144633 edges, 311365 markings/sec, 205 secs
lola: 76405890 markings, 152245229 edges, 310554 markings/sec, 210 secs
lola: 77930170 markings, 155296876 edges, 304856 markings/sec, 215 secs
lola: 79453029 markings, 158341213 edges, 304572 markings/sec, 220 secs
lola: 80958964 markings, 161349205 edges, 301187 markings/sec, 225 secs
lola: 82476879 markings, 164389993 edges, 303583 markings/sec, 230 secs
lola: 83987709 markings, 167407357 edges, 302166 markings/sec, 235 secs
lola: 85500651 markings, 170433266 edges, 302588 markings/sec, 240 secs
lola: 87004287 markings, 173441207 edges, 300727 markings/sec, 245 secs
lola: 88509197 markings, 176449591 edges, 300982 markings/sec, 250 secs
lola: 89971002 markings, 179367823 edges, 292361 markings/sec, 255 secs
lola: 90883981 markings, 181197079 edges, 182596 markings/sec, 260 secs
lola: 91649553 markings, 182732297 edges, 153114 markings/sec, 265 secs
lola: 92798990 markings, 185028692 edges, 229887 markings/sec, 270 secs
lola: 93759019 markings, 186950021 edges, 192006 markings/sec, 275 secs
lola: 94694215 markings, 188812769 edges, 187039 markings/sec, 280 secs
lola: 95723409 markings, 190871489 edges, 205839 markings/sec, 285 secs
lola: 96636396 markings, 192702151 edges, 182597 markings/sec, 290 secs
lola: 97710788 markings, 194849422 edges, 214878 markings/sec, 295 secs
lola: 98893120 markings, 197211057 edges, 236466 markings/sec, 300 secs
lola: 100057856 markings, 199539496 edges, 232947 markings/sec, 305 secs
lola: 101100629 markings, 201621685 edges, 208555 markings/sec, 310 secs
lola: 102132217 markings, 203691912 edges, 206318 markings/sec, 315 secs
lola: 103253785 markings, 205927668 edges, 224314 markings/sec, 320 secs
lola: 104399103 markings, 208224346 edges, 229064 markings/sec, 325 secs
lola: 105503284 markings, 210434317 edges, 220836 markings/sec, 330 secs
lola: 106610576 markings, 212647790 edges, 221458 markings/sec, 335 secs
lola: 107698335 markings, 214817518 edges, 217552 markings/sec, 340 secs
lola: 108877622 markings, 217173029 edges, 235857 markings/sec, 345 secs
lola: 110057238 markings, 219538798 edges, 235923 markings/sec, 350 secs
lola: 111150368 markings, 221721328 edges, 218626 markings/sec, 355 secs
lola: 112162373 markings, 223743732 edges, 202401 markings/sec, 360 secs
lola: 112192760 markings, 223807077 edges, 6077 markings/sec, 365 secs
lola: 112192850 markings, 223807348 edges, 18 markings/sec, 370 secs
lola: 112192932 markings, 223807593 edges, 16 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((F ((X ((2 <= p5)) OR G ((1 <= p1)))) OR (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X ((2 <= p5)) OR G ((1 <= p1)))) OR (1 <= p13)))
lola: processed formula length: 56
lola: 51 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: 3736854 markings, 6751150 edges, 747371 markings/sec, 0 secs
lola: 6710949 markings, 13451647 edges, 594819 markings/sec, 5 secs
lola: 9716378 markings, 19871488 edges, 601086 markings/sec, 10 secs
lola: 12723938 markings, 25530313 edges, 601512 markings/sec, 15 secs
lola: 16463026 markings, 31326237 edges, 747818 markings/sec, 20 secs
lola: 19546456 markings, 37617593 edges, 616686 markings/sec, 25 secs
lola: 22568611 markings, 44013012 edges, 604431 markings/sec, 30 secs
lola: 25720415 markings, 50239926 edges, 630361 markings/sec, 35 secs
lola: 28616652 markings, 56626749 edges, 579247 markings/sec, 40 secs
lola: 31422373 markings, 62652710 edges, 561144 markings/sec, 45 secs
lola: 34573328 markings, 67948966 edges, 630191 markings/sec, 50 secs
lola: 37859668 markings, 73855199 edges, 657268 markings/sec, 55 secs
lola: 40780164 markings, 80509068 edges, 584099 markings/sec, 60 secs
lola: 43805865 markings, 86335209 edges, 605140 markings/sec, 65 secs
lola: 46860965 markings, 92481558 edges, 611020 markings/sec, 70 secs
lola: 49909861 markings, 98993515 edges, 609779 markings/sec, 75 secs
lola: 53129064 markings, 104310321 edges, 643841 markings/sec, 80 secs
lola: 56197945 markings, 110015378 edges, 613776 markings/sec, 85 secs
lola: 59326016 markings, 116309197 edges, 625614 markings/sec, 90 secs
lola: 62395603 markings, 122418656 edges, 613917 markings/sec, 95 secs
lola: 65218547 markings, 128666567 edges, 564589 markings/sec, 100 secs
lola: 68978740 markings, 134701185 edges, 752039 markings/sec, 105 secs
lola: 72588420 markings, 140331091 edges, 721936 markings/sec, 110 secs
lola: 76110949 markings, 145953531 edges, 704506 markings/sec, 115 secs
lola: 79543568 markings, 151430092 edges, 686524 markings/sec, 120 secs
lola: 83100617 markings, 157108568 edges, 711410 markings/sec, 125 secs
lola: 86584383 markings, 162574826 edges, 696753 markings/sec, 130 secs
lola: 89820912 markings, 167734874 edges, 647306 markings/sec, 135 secs
lola: 91503382 markings, 170463872 edges, 336494 markings/sec, 140 secs
lola: 93580323 markings, 173740129 edges, 415388 markings/sec, 145 secs
lola: 94216787 markings, 174772883 edges, 127293 markings/sec, 150 secs
lola: 96723053 markings, 178746370 edges, 501253 markings/sec, 155 secs
lola: 99645508 markings, 183395196 edges, 584491 markings/sec, 160 secs
lola: 102574274 markings, 188054273 edges, 585753 markings/sec, 165 secs
lola: 102748240 markings, 188336559 edges, 34793 markings/sec, 170 secs
lola: 105138272 markings, 192121478 edges, 478006 markings/sec, 175 secs
lola: 105813193 markings, 193138675 edges, 134984 markings/sec, 180 secs
lola: 106920253 markings, 194919756 edges, 221412 markings/sec, 185 secs
lola: 108897793 markings, 198035365 edges, 395508 markings/sec, 190 secs
lola: 108897793 markings, 198035365 edges, 0 markings/sec, 195 secs
lola: 109308812 markings, 198702299 edges, 82204 markings/sec, 200 secs
lola: 109310356 markings, 198704808 edges, 309 markings/sec, 205 secs
lola: 109320207 markings, 198720789 edges, 1970 markings/sec, 210 secs
lola: 109320318 markings, 198720971 edges, 22 markings/sec, 215 secs
lola: 109320442 markings, 198721174 edges, 25 markings/sec, 220 secs
lola: 109320568 markings, 198721379 edges, 25 markings/sec, 225 secs
lola: 109320694 markings, 198721581 edges, 25 markings/sec, 230 secs
lola: 109320795 markings, 198721744 edges, 20 markings/sec, 235 secs
lola: 109320875 markings, 198721874 edges, 16 markings/sec, 240 secs
lola: 109320981 markings, 198722046 edges, 21 markings/sec, 245 secs
lola: 109321068 markings, 198722188 edges, 17 markings/sec, 250 secs
lola: 109322860 markings, 198725096 edges, 358 markings/sec, 255 secs
lola: 109325170 markings, 198728845 edges, 462 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((p2 <= p4)))
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 <= p4)))
lola: processed formula length: 18
lola: 51 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: 4999389 markings, 7379024 edges, 999878 markings/sec, 0 secs
lola: 9774472 markings, 14539158 edges, 955017 markings/sec, 5 secs
lola: 14514798 markings, 21648781 edges, 948065 markings/sec, 10 secs
lola: 19152060 markings, 28612063 edges, 927452 markings/sec, 15 secs
lola: 23725403 markings, 35482376 edges, 914669 markings/sec, 20 secs
lola: 28328491 markings, 42385598 edges, 920618 markings/sec, 25 secs
lola: 32985759 markings, 49357230 edges, 931454 markings/sec, 30 secs
lola: 37458762 markings, 56076336 edges, 894601 markings/sec, 35 secs
lola: 41916807 markings, 62766910 edges, 891609 markings/sec, 40 secs
lola: 46400538 markings, 69482546 edges, 896746 markings/sec, 45 secs
lola: 50954829 markings, 76325147 edges, 910858 markings/sec, 50 secs
lola: 55420950 markings, 83013545 edges, 893224 markings/sec, 55 secs
lola: 59972213 markings, 89841332 edges, 910253 markings/sec, 60 secs
lola: 64526356 markings, 96683715 edges, 910829 markings/sec, 65 secs
lola: 69059984 markings, 103476007 edges, 906726 markings/sec, 70 secs
lola: 73356113 markings, 109926989 edges, 859226 markings/sec, 75 secs
lola: 77688170 markings, 116409975 edges, 866411 markings/sec, 80 secs
lola: 82049064 markings, 122971271 edges, 872179 markings/sec, 85 secs
lola: 86434077 markings, 129531286 edges, 877003 markings/sec, 90 secs
lola: 90778586 markings, 136065781 edges, 868902 markings/sec, 95 secs
lola: 95190255 markings, 142667534 edges, 882334 markings/sec, 100 secs
lola: 99631427 markings, 149345596 edges, 888234 markings/sec, 105 secs
lola: 103528059 markings, 155185041 edges, 779326 markings/sec, 110 secs
lola: 105065693 markings, 157485160 edges, 307527 markings/sec, 115 secs
lola: 108513047 markings, 162664307 edges, 689471 markings/sec, 120 secs
lola: 109539264 markings, 164193347 edges, 205243 markings/sec, 125 secs
lola: 111649521 markings, 167371903 edges, 422051 markings/sec, 130 secs
lola: 113698307 markings, 170424681 edges, 409757 markings/sec, 135 secs
lola: 115218651 markings, 172708816 edges, 304069 markings/sec, 140 secs
lola: 118435951 markings, 177533974 edges, 643460 markings/sec, 145 secs
lola: 120167951 markings, 180128781 edges, 346400 markings/sec, 150 secs
lola: 122405488 markings, 183489661 edges, 447507 markings/sec, 155 secs
lola: 124364831 markings, 186443791 edges, 391869 markings/sec, 160 secs
lola: 125326433 markings, 187883757 edges, 192320 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((G ((p1 + 1 <= p7)) OR (p1 <= 1))) AND G ((((p7 <= p1) U (2 <= p1)) OR (p2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p1 + 1 <= p7)) OR (p1 <= 1)))
lola: processed formula length: 37
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p7 <= p1) U (2 <= p1)) OR (p2 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p7 <= p1) U (2 <= p1)) OR (p2 <= p8)))
lola: processed formula length: 44
lola: 51 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: 4271401 markings, 6257523 edges, 854280 markings/sec, 0 secs
lola: 8207485 markings, 12161609 edges, 787217 markings/sec, 5 secs
lola: 12088505 markings, 17983681 edges, 776204 markings/sec, 10 secs
lola: 15901722 markings, 23702597 edges, 762643 markings/sec, 15 secs
lola: 19719777 markings, 29430099 edges, 763611 markings/sec, 20 secs
lola: 23436271 markings, 35005742 edges, 743299 markings/sec, 25 secs
lola: 27185384 markings, 40628598 edges, 749823 markings/sec, 30 secs
lola: 30841609 markings, 46114065 edges, 731245 markings/sec, 35 secs
lola: 34548989 markings, 51674936 edges, 741476 markings/sec, 40 secs
lola: 38153766 markings, 57080685 edges, 720955 markings/sec, 45 secs
lola: 41680978 markings, 62373106 edges, 705442 markings/sec, 50 secs
lola: 45161245 markings, 67592795 edges, 696053 markings/sec, 55 secs
lola: 48555671 markings, 72683600 edges, 678885 markings/sec, 60 secs
lola: 52172741 markings, 78111381 edges, 723414 markings/sec, 65 secs
lola: 55762290 markings, 83493826 edges, 717910 markings/sec, 70 secs
lola: 59264164 markings, 88748861 edges, 700375 markings/sec, 75 secs
lola: 62734068 markings, 93953568 edges, 693981 markings/sec, 80 secs
lola: 66202103 markings, 99155434 edges, 693607 markings/sec, 85 secs
lola: 69675554 markings, 104364900 edges, 694690 markings/sec, 90 secs
lola: 73104810 markings, 109507924 edges, 685851 markings/sec, 95 secs
lola: 76705545 markings, 114910298 edges, 720147 markings/sec, 100 secs
lola: 80221668 markings, 120183021 edges, 703225 markings/sec, 105 secs
lola: 83598403 markings, 125249145 edges, 675347 markings/sec, 110 secs
lola: 86895972 markings, 130195544 edges, 659514 markings/sec, 115 secs
lola: 90076658 markings, 134967090 edges, 636137 markings/sec, 120 secs
lola: 92863018 markings, 139145909 edges, 557272 markings/sec, 125 secs
lola: 93801666 markings, 140553065 edges, 187730 markings/sec, 130 secs
lola: 96124235 markings, 144038311 edges, 464514 markings/sec, 135 secs
lola: 97182040 markings, 145623633 edges, 211561 markings/sec, 140 secs
lola: 98830320 markings, 148096672 edges, 329656 markings/sec, 145 secs
lola: 100457134 markings, 150537419 edges, 325363 markings/sec, 150 secs
lola: 102610939 markings, 153769186 edges, 430761 markings/sec, 155 secs
lola: 104840948 markings, 157113839 edges, 446002 markings/sec, 160 secs
lola: 106716818 markings, 159926539 edges, 375174 markings/sec, 165 secs
lola: 108622388 markings, 162784620 edges, 381114 markings/sec, 170 secs
lola: 110778892 markings, 166020939 edges, 431301 markings/sec, 175 secs
lola: 112703690 markings, 168908691 edges, 384960 markings/sec, 180 secs
lola: 112958116 markings, 169290649 edges, 50885 markings/sec, 185 secs
lola: 112958537 markings, 169291059 edges, 84 markings/sec, 190 secs
lola: 112958645 markings, 169291167 edges, 22 markings/sec, 195 secs
lola: 112958723 markings, 169291245 edges, 16 markings/sec, 200 secs
lola: 112958801 markings, 169291323 edges, 16 markings/sec, 205 secs
lola: 112958895 markings, 169291417 edges, 19 markings/sec, 210 secs
lola: 112958975 markings, 169291497 edges, 16 markings/sec, 215 secs
lola: 112965055 markings, 169297581 edges, 1216 markings/sec, 220 secs
lola: 112965097 markings, 169297665 edges, 8 markings/sec, 225 secs
lola: 112965146 markings, 169297765 edges, 10 markings/sec, 230 secs
lola: 112965203 markings, 169297877 edges, 11 markings/sec, 235 secs
lola: 112965246 markings, 169297964 edges, 9 markings/sec, 240 secs
lola: 112965304 markings, 169298081 edges, 12 markings/sec, 245 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no unknown unknown yes yes no unknown unknown
lola:
preliminary result: no no yes no no unknown unknown yes yes no unknown unknown
lola: memory consumption: 3520 KB
lola: time consumption: 2319 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-50000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is Kanban-PT-50000, 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 r132-tall-162075428500289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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