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-162075428500285.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-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K 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 83K 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.2K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-20000-00
FORMULA_NAME Kanban-PT-20000-01
FORMULA_NAME Kanban-PT-20000-02
FORMULA_NAME Kanban-PT-20000-03
FORMULA_NAME Kanban-PT-20000-04
FORMULA_NAME Kanban-PT-20000-05
FORMULA_NAME Kanban-PT-20000-06
FORMULA_NAME Kanban-PT-20000-07
FORMULA_NAME Kanban-PT-20000-08
FORMULA_NAME Kanban-PT-20000-09
FORMULA_NAME Kanban-PT-20000-10
FORMULA_NAME Kanban-PT-20000-11
FORMULA_NAME Kanban-PT-20000-12
FORMULA_NAME Kanban-PT-20000-13
FORMULA_NAME Kanban-PT-20000-14
FORMULA_NAME Kanban-PT-20000-15

=== Now, execution of the tool begins

BK_START 1620927533095

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

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

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

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

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

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

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

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

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

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

FORMULA Kanban-PT-20000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2813
rslt: Output for LTLCardinality @ Kanban-PT-20000

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 48
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "(1 <= p13)",
"processed_size": 10,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F (G ((X (F ((p3 <= p9))) OR (p3 <= p9)))) OR ((p1 <= p6) AND (p2 <= p0))))",
"processed_size": 79,
"rewrites": 46
},
"result":
{
"edges": 420011,
"markings": 300010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (G ((((p15 + 1 <= p13) AND (p10 <= 0)) OR (p5 <= p0)))) U ((3 <= p9) AND (p13 <= p15)))",
"processed_size": 91,
"rewrites": 46
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 + 1 <= p4)",
"processed_size": 14,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (G ((p7 + 1 <= p11))) AND (G ((3 <= p8)) OR (p7 + 1 <= p11))))",
"processed_size": 68,
"rewrites": 46
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1595
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F ((F ((2 <= p6)) OR (p6 <= 1)))) AND F ((p7 <= p11))))",
"processed_size": 62,
"rewrites": 46
},
"result":
{
"edges": 340000,
"markings": 240001,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 3191
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3191
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p7 <= p1))",
"processed_size": 14,
"rewrites": 46
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p7 <= p1)))",
"processed_size": 18,
"rewrites": 46
},
"result":
{
"edges": 120006,
"markings": 120005,
"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": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p7 <= p1))",
"processed_size": 14,
"rewrites": 46
},
"result":
{
"edges": 20005,
"markings": 20005,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"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": "G (F ((2 <= p1)))",
"processed_size": 17,
"rewrites": 46
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p7 <= p1)))",
"processed_size": 18,
"rewrites": 46
},
"result":
{
"edges": 120006,
"markings": 120005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3780,
"runtime": 757.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(F(*)) AND X(*))) : (X(X(G(**))) OR F(**)) : (G((F(G((X(F(**)) OR **))) OR **)) AND **) : X(F(**)) : F((G(F((F(*) OR *))) AND F(**))) : (X(*) U (** U **)) : (X(G(*)) U **) : (F((X(G(*)) AND (G(*) OR *))) AND F(**)) : (G(F(**)) OR (F(G(**)) OR G(**))) : ((G(**) AND **) U G((F((G(**) AND **)) AND (X(**) OR (G(**) AND **)))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no yes yes no no no no unknown ",
"value": "no no no yes yes no no no no 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(F (X (G ((2 <= p9))))) AND NOT(X ((p15 <= p0))))) : (X (X (G ((p8 + 1 <= p13)))) OR F ((2 <= p2))) : (G ((X (F (G ((X (F ((p3 <= p9))) OR (p3 <= p9))))) OR ((p1 <= p6) AND (p2 <= p0)))) AND (1 <= p13)) : (((p3 <= p0) U (0 <= 0)) AND F (X (F ((p14 <= p8))))) : F ((G (NOT(G (X ((G ((p6 <= 1)) AND (2 <= p6)))))) AND F ((p7 <= p11)))) : (NOT(X ((1 <= p1))) U ((1 <= p12) U (1 <= p7))) : (X (NOT(F ((((p13 <= p15) OR (1 <= p10)) AND (p0 + 1 <= p5))))) U ((3 <= p9) AND (p13 <= p15))) : (NOT(G ((F (X (F ((p11 <= p7)))) OR (F ((p8 <= 2)) AND (p11 <= p7))))) AND F ((p4 <= p0))) : ((G (F (X ((2 <= p1)))) OR X (X (G (F (G ((p7 <= p1))))))) OR G ((p7 <= p1))) : ((G ((2 <= p7)) AND (2 <= p7)) U G ((X ((1 <= p13)) U (G ((1 <= p1)) AND (2 <= p7)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((p9 <= 1))) AND X ((p0 + 1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((p9 <= 1))) AND X ((p0 + 1 <= p15))))
lola: processed formula length: 47
lola: 46 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: 120004 markings, 120004 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p8 + 1 <= p13)))) OR F ((2 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 20002 markings, 20002 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p8 + 1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p8 + 1 <= p13))))
lola: processed formula length: 27
lola: 46 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: 120004 markings, 120004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (G ((X (F ((p3 <= p9))) OR (p3 <= p9)))) OR ((p1 <= p6) AND (p2 <= p0)))) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 46 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 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((X (F ((p3 <= p9))) OR (p3 <= p9)))) OR ((p1 <= p6) AND (p2 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((X (F ((p3 <= p9))) OR (p3 <= p9)))) OR ((p1 <= p6) AND (p2 <= p0))))
lola: processed formula length: 79
lola: 46 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: add low 13
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: 300010 markings, 420011 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p14 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p14 <= p8)))
lola: processed formula length: 19
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p1 <= 0)) U ((1 <= p12) U (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p1 <= 0)) U ((1 <= p12) U (1 <= p7)))
lola: processed formula length: 42
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100003 markings, 100004 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p15 + 1 <= p13) AND (p10 <= 0)) OR (p5 <= p0)))) U ((3 <= p9) AND (p13 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((((p15 + 1 <= p13) AND (p10 <= 0)) OR (p5 <= p0)))) U ((3 <= p9) AND (p13 <= p15)))
lola: processed formula length: 91
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120004 markings, 120004 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (G ((p7 + 1 <= p11))) AND (G ((3 <= p8)) OR (p7 + 1 <= p11)))) AND F ((p4 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p4 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p0 + 1 <= p4)
lola: processed formula length: 14
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p7 + 1 <= p11))) AND (G ((3 <= p8)) OR (p7 + 1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p7 + 1 <= p11))) AND (G ((3 <= p8)) OR (p7 + 1 <= p11))))
lola: processed formula length: 68
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120004 markings, 120004 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((2 <= p7)) AND (2 <= p7)) U G ((F ((G ((1 <= p1)) AND (2 <= p7))) AND (X ((1 <= p13)) OR (G ((1 <= p1)) AND (2 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((2 <= p7)) AND (2 <= p7)) U G ((F ((G ((1 <= p1)) AND (2 <= p7))) AND (X ((1 <= p13)) OR (G ((1 <= p1)) AND (2 <= p7))))))
lola: processed formula length: 127
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 52 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: 3041927 markings, 5871202 edges, 608385 markings/sec, 0 secs
lola: 5703832 markings, 11190681 edges, 532381 markings/sec, 5 secs
lola: 8217174 markings, 16213086 edges, 502668 markings/sec, 10 secs
lola: 10559857 markings, 20894232 edges, 468537 markings/sec, 15 secs
lola: 12800124 markings, 25373924 edges, 448053 markings/sec, 20 secs
lola: 14932091 markings, 29636811 edges, 426393 markings/sec, 25 secs
lola: 17001864 markings, 33774008 edges, 413955 markings/sec, 30 secs
lola: 19001462 markings, 37770272 edges, 399920 markings/sec, 35 secs
lola: 20953679 markings, 41675081 edges, 390443 markings/sec, 40 secs
lola: 22863524 markings, 45489229 edges, 381969 markings/sec, 45 secs
lola: 24708177 markings, 49181328 edges, 368931 markings/sec, 50 secs
lola: 26515058 markings, 52790452 edges, 361376 markings/sec, 55 secs
lola: 28295310 markings, 56350242 edges, 356050 markings/sec, 60 secs
lola: 30055222 markings, 59866978 edges, 351982 markings/sec, 65 secs
lola: 31734778 markings, 63225937 edges, 335911 markings/sec, 70 secs
lola: 33467110 markings, 66692370 edges, 346466 markings/sec, 75 secs
lola: 35140847 markings, 70035415 edges, 334747 markings/sec, 80 secs
lola: 36786891 markings, 73328074 edges, 329209 markings/sec, 85 secs
lola: 38491791 markings, 76738409 edges, 340980 markings/sec, 90 secs
lola: 40218074 markings, 80191983 edges, 345257 markings/sec, 95 secs
lola: 41913105 markings, 83578265 edges, 339006 markings/sec, 100 secs
lola: 43597034 markings, 86947618 edges, 336786 markings/sec, 105 secs
lola: 45267634 markings, 90285798 edges, 334120 markings/sec, 110 secs
lola: 46926376 markings, 93599664 edges, 331748 markings/sec, 115 secs
lola: 48572010 markings, 96893691 edges, 329127 markings/sec, 120 secs
lola: 50210436 markings, 100168980 edges, 327685 markings/sec, 125 secs
lola: 51835647 markings, 103420340 edges, 325042 markings/sec, 130 secs
lola: 53386687 markings, 106519607 edges, 310208 markings/sec, 135 secs
lola: 54929058 markings, 109602013 edges, 308474 markings/sec, 140 secs
lola: 56439332 markings, 112623131 edges, 302055 markings/sec, 145 secs
lola: 57951189 markings, 115648892 edges, 302371 markings/sec, 150 secs
lola: 59457594 markings, 118655308 edges, 301281 markings/sec, 155 secs
lola: 60967045 markings, 121677660 edges, 301890 markings/sec, 160 secs
lola: 62474883 markings, 124689242 edges, 301568 markings/sec, 165 secs
lola: 63977378 markings, 127697962 edges, 300499 markings/sec, 170 secs
lola: 65478643 markings, 130694314 edges, 300253 markings/sec, 175 secs
lola: 66972366 markings, 133681036 edges, 298745 markings/sec, 180 secs
lola: 68475108 markings, 136690570 edges, 300548 markings/sec, 185 secs
lola: 70007372 markings, 139749667 edges, 306453 markings/sec, 190 secs
lola: 71497190 markings, 142732638 edges, 297964 markings/sec, 195 secs
lola: 72965411 markings, 145666665 edges, 293644 markings/sec, 200 secs
lola: 74424566 markings, 148587313 edges, 291831 markings/sec, 205 secs
lola: 75878923 markings, 151496514 edges, 290871 markings/sec, 210 secs
lola: 77339393 markings, 154409940 edges, 292094 markings/sec, 215 secs
lola: 78795866 markings, 157326850 edges, 291295 markings/sec, 220 secs
lola: 80254866 markings, 160244794 edges, 291800 markings/sec, 225 secs
lola: 81718222 markings, 163166152 edges, 292671 markings/sec, 230 secs
lola: 83203640 markings, 166135415 edges, 297084 markings/sec, 235 secs
lola: 84703627 markings, 169134942 edges, 299997 markings/sec, 240 secs
lola: 86192680 markings, 172115808 edges, 297811 markings/sec, 245 secs
lola: 87653498 markings, 175036852 edges, 292164 markings/sec, 250 secs
lola: 89084780 markings, 177903464 edges, 286256 markings/sec, 255 secs
lola: 90425914 markings, 180584443 edges, 268227 markings/sec, 260 secs
lola: 91187078 markings, 182106558 edges, 152233 markings/sec, 265 secs
lola: 92563227 markings, 184856178 edges, 275230 markings/sec, 270 secs
lola: 93528065 markings, 186787390 edges, 192968 markings/sec, 275 secs
lola: 94617001 markings, 188962809 edges, 217787 markings/sec, 280 secs
lola: 95605152 markings, 190940393 edges, 197630 markings/sec, 285 secs
lola: 96526209 markings, 192783444 edges, 184211 markings/sec, 290 secs
lola: 97505211 markings, 194736753 edges, 195800 markings/sec, 295 secs
lola: 98740941 markings, 197207788 edges, 247146 markings/sec, 300 secs
lola: 100078428 markings, 199878643 edges, 267497 markings/sec, 305 secs
lola: 101337138 markings, 202399306 edges, 251742 markings/sec, 310 secs
lola: 102674352 markings, 205068577 edges, 267443 markings/sec, 315 secs
lola: 103608650 markings, 206938222 edges, 186860 markings/sec, 320 secs
lola: 104924330 markings, 209574465 edges, 263136 markings/sec, 325 secs
lola: 105804560 markings, 211335808 edges, 176046 markings/sec, 330 secs
lola: 106685179 markings, 213095210 edges, 176124 markings/sec, 335 secs
lola: 107580531 markings, 214885100 edges, 179070 markings/sec, 340 secs
lola: 108508045 markings, 216740271 edges, 185503 markings/sec, 345 secs
lola: 109652470 markings, 219025972 edges, 228885 markings/sec, 350 secs
lola: 110991886 markings, 221701244 edges, 267883 markings/sec, 355 secs
lola: 112029002 markings, 223778838 edges, 207423 markings/sec, 360 secs
lola: 112415476 markings, 224556491 edges, 77295 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((F ((2 <= p6)) OR (p6 <= 1)))) AND F ((p7 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((F ((2 <= p6)) OR (p6 <= 1)))) AND F ((p7 <= p11))))
lola: processed formula length: 62
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 240001 markings, 340000 edges
lola: ========================================
lola: subprocess 9 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((2 <= p1))) OR (F (G ((p7 <= p1))) OR G ((p7 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p7 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p7 <= p1))
lola: processed formula length: 14
lola: 46 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: 20005 markings, 20005 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p7 <= p1)))
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 ((p7 <= p1)))
lola: processed formula length: 18
lola: 46 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 13
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: 120005 markings, 120006 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((G ((2 <= p7)) AND (2 <= p7)) U G ((F ((G ((1 <= p1)) AND (2 <= p7))) AND (X ((1 <= p13)) OR (G ((1 <= p1)) AND (2 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((2 <= p7)) AND (2 <= p7)) U G ((F ((G ((1 <= p1)) AND (2 <= p7))) AND (X ((1 <= p13)) OR (G ((1 <= p1)) AND (2 <= p7))))))
lola: processed formula length: 127
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 52 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: 3066645 markings, 5921174 edges, 613329 markings/sec, 0 secs
lola: 5731340 markings, 11245281 edges, 532939 markings/sec, 5 secs
lola: 8264761 markings, 16308945 edges, 506684 markings/sec, 10 secs
lola: 10664922 markings, 21106527 edges, 480032 markings/sec, 15 secs
lola: 12952117 markings, 25677148 edges, 457439 markings/sec, 20 secs
lola: 15138838 markings, 30050512 edges, 437344 markings/sec, 25 secs
lola: 17254414 markings, 34277242 edges, 423115 markings/sec, 30 secs
lola: 19313470 markings, 38393527 edges, 411811 markings/sec, 35 secs
lola: 21299801 markings, 42366509 edges, 397266 markings/sec, 40 secs
lola: 23248582 markings, 46262643 edges, 389756 markings/sec, 45 secs
lola: 25162048 markings, 50086161 edges, 382693 markings/sec, 50 secs
lola: 27028865 markings, 53817172 edges, 373363 markings/sec, 55 secs
lola: 28929286 markings, 57618270 edges, 380084 markings/sec, 60 secs
lola: 30673263 markings, 61106781 edges, 348795 markings/sec, 65 secs
lola: 32365558 markings, 64487166 edges, 338459 markings/sec, 70 secs
lola: 34128290 markings, 68015905 edges, 352546 markings/sec, 75 secs
lola: 35832279 markings, 71419629 edges, 340798 markings/sec, 80 secs
lola: 37596203 markings, 74948887 edges, 352785 markings/sec, 85 secs
lola: 39295842 markings, 78342678 edges, 339928 markings/sec, 90 secs
lola: 40974431 markings, 81699053 edges, 335718 markings/sec, 95 secs
lola: 42518179 markings, 84784699 edges, 308750 markings/sec, 100 secs
lola: 44087867 markings, 87926370 edges, 313938 markings/sec, 105 secs
lola: 45628194 markings, 91004518 edges, 308065 markings/sec, 110 secs
lola: 47155417 markings, 94060976 edges, 305445 markings/sec, 115 secs
lola: 48680613 markings, 97108236 edges, 305039 markings/sec, 120 secs
lola: 50204798 markings, 100154238 edges, 304837 markings/sec, 125 secs
lola: 51719185 markings, 103185786 edges, 302877 markings/sec, 130 secs
lola: 53231653 markings, 106205836 edges, 302494 markings/sec, 135 secs
lola: 54742224 markings, 109227671 edges, 302114 markings/sec, 140 secs
lola: 56255378 markings, 112251005 edges, 302631 markings/sec, 145 secs
lola: 57759529 markings, 115260113 edges, 300830 markings/sec, 150 secs
lola: 59260878 markings, 118265034 edges, 300270 markings/sec, 155 secs
lola: 60760030 markings, 121262967 edges, 299830 markings/sec, 160 secs
lola: 62263065 markings, 124269479 edges, 300607 markings/sec, 165 secs
lola: 63759548 markings, 127257028 edges, 299297 markings/sec, 170 secs
lola: 65252520 markings, 130241877 edges, 298594 markings/sec, 175 secs
lola: 66737638 markings, 133214913 edges, 297024 markings/sec, 180 secs
lola: 68222260 markings, 136183404 edges, 296924 markings/sec, 185 secs
lola: 69712398 markings, 139161799 edges, 298028 markings/sec, 190 secs
lola: 71199835 markings, 142132737 edges, 297487 markings/sec, 195 secs
lola: 72681632 markings, 145102600 edges, 296359 markings/sec, 200 secs
lola: 74159853 markings, 148051310 edges, 295644 markings/sec, 205 secs
lola: 75630428 markings, 150994320 edges, 294115 markings/sec, 210 secs
lola: 77108832 markings, 153948871 edges, 295681 markings/sec, 215 secs
lola: 78584491 markings, 156903099 edges, 295132 markings/sec, 220 secs
lola: 80063246 markings, 159856681 edges, 295751 markings/sec, 225 secs
lola: 81537115 markings, 162803251 edges, 294774 markings/sec, 230 secs
lola: 83004156 markings, 165737219 edges, 293408 markings/sec, 235 secs
lola: 84470992 markings, 168675808 edges, 293367 markings/sec, 240 secs
lola: 85937989 markings, 171602077 edges, 293399 markings/sec, 245 secs
lola: 87406408 markings, 174538490 edges, 293684 markings/sec, 250 secs
lola: 88869031 markings, 177463856 edges, 292525 markings/sec, 255 secs
lola: 90289634 markings, 180308401 edges, 284121 markings/sec, 260 secs
lola: 91467911 markings, 182662294 edges, 235655 markings/sec, 265 secs
lola: 92659585 markings, 185049147 edges, 238335 markings/sec, 270 secs
lola: 93784243 markings, 187297099 edges, 224932 markings/sec, 275 secs
lola: 94846726 markings, 189425262 edges, 212497 markings/sec, 280 secs
lola: 95944483 markings, 191615067 edges, 219551 markings/sec, 285 secs
lola: 97153097 markings, 194035116 edges, 241723 markings/sec, 290 secs
lola: 98439358 markings, 196608920 edges, 257252 markings/sec, 295 secs
lola: 99563359 markings, 198849082 edges, 224800 markings/sec, 300 secs
lola: 100664683 markings, 201053769 edges, 220265 markings/sec, 305 secs
lola: 101856187 markings, 203441476 edges, 238301 markings/sec, 310 secs
lola: 103010470 markings, 205747329 edges, 230857 markings/sec, 315 secs
lola: 104171388 markings, 208066317 edges, 232184 markings/sec, 320 secs
lola: 105300116 markings, 210318639 edges, 225746 markings/sec, 325 secs
lola: 106708367 markings, 213144138 edges, 281650 markings/sec, 330 secs
lola: 107735845 markings, 215192273 edges, 205496 markings/sec, 335 secs
lola: 108850755 markings, 217422110 edges, 222982 markings/sec, 340 secs
lola: 109986046 markings, 219691723 edges, 227058 markings/sec, 345 secs
lola: 111162338 markings, 222044152 edges, 235258 markings/sec, 350 secs
lola: 112174932 markings, 224068558 edges, 202519 markings/sec, 355 secs
lola: 112403931 markings, 224523778 edges, 45800 markings/sec, 360 secs
lola: 112404055 markings, 224523903 edges, 25 markings/sec, 365 secs
lola: 112404155 markings, 224524003 edges, 20 markings/sec, 370 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((2 <= p1))) OR (F (G ((p7 <= p1))) OR G ((p7 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p7 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p7 <= p1))
lola: processed formula length: 14
lola: 46 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: 20005 markings, 20005 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p1)))
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 ((2 <= p1)))
lola: processed formula length: 17
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20002 markings, 20002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p7 <= p1)))
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 ((p7 <= p1)))
lola: processed formula length: 18
lola: 46 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 13
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: 120005 markings, 120006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no no no no unknown
lola:
preliminary result: no no no yes yes no no no no unknown
lola: memory consumption: 3780 KB
lola: time consumption: 757 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-20000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-20000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-20000.tgz
mv Kanban-PT-20000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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