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.r094-tall-162048902800417.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 FMS-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902800417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 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 16K 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 FMS-PT-50000-00
FORMULA_NAME FMS-PT-50000-01
FORMULA_NAME FMS-PT-50000-02
FORMULA_NAME FMS-PT-50000-03
FORMULA_NAME FMS-PT-50000-04
FORMULA_NAME FMS-PT-50000-05
FORMULA_NAME FMS-PT-50000-06
FORMULA_NAME FMS-PT-50000-07
FORMULA_NAME FMS-PT-50000-08
FORMULA_NAME FMS-PT-50000-09
FORMULA_NAME FMS-PT-50000-10
FORMULA_NAME FMS-PT-50000-11
FORMULA_NAME FMS-PT-50000-12
FORMULA_NAME FMS-PT-50000-13
FORMULA_NAME FMS-PT-50000-14
FORMULA_NAME FMS-PT-50000-15

=== Now, execution of the tool begins

BK_START 1620783447045

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

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

FORMULA FMS-PT-50000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-50000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-50000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1842
rslt: Output for LTLCardinality @ FMS-PT-50000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p7 + 1 <= p5)))",
"processed_size": 22,
"rewrites": 95
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"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 (X (G ((p4 <= p14)))))",
"processed_size": 27,
"rewrites": 95
},
"result":
{
"edges": 200003,
"markings": 200003,
"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": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X (G ((1 <= p5))) AND (p16 <= 1))))",
"processed_size": 42,
"rewrites": 95
},
"result":
{
"edges": 200005,
"markings": 200004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((p20 + 1 <= p5)) AND F ((X (X ((p5 <= p20))) AND ((p1 + 1 <= p19) AND (p5 <= p20))))))",
"processed_size": 93,
"rewrites": 95
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 427
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((3 <= p17))))",
"processed_size": 22,
"rewrites": 95
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(X (X ((p18 <= 0))) R F ((p18 <= 0)))",
"processed_size": 37,
"rewrites": 95
},
"result":
{
"edges": 15,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"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": "(p16 <= 2)",
"processed_size": 10,
"rewrites": 97
},
"result":
{
"edges": 300004,
"markings": 300004,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 567
},
"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 ((p0 <= p11)))",
"processed_size": 19,
"rewrites": 95
},
"result":
{
"edges": 450012,
"markings": 400010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"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": "(p14 <= p11)",
"processed_size": 12,
"rewrites": 97
},
"result":
{
"edges": 300003,
"markings": 300003,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p18)))",
"processed_size": 18,
"rewrites": 95
},
"result":
{
"edges": 250002,
"markings": 250002,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((p1 <= p5))) OR (p15 + 1 <= p9))))",
"processed_size": 47,
"rewrites": 95
},
"result":
{
"edges": 1499982,
"markings": 1099991,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 2666
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F ((p2 <= p1)) AND ((p9 <= p17) AND (p6 <= 1))))",
"processed_size": 52,
"rewrites": 95
},
"result":
{
"edges": 300008,
"markings": 300008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(X (X ((p18 <= 0))) R F ((p18 <= 0)))",
"processed_size": 37,
"rewrites": 95
},
"result":
{
"edges": 15,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"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 ((p0 <= p11)))",
"processed_size": 19,
"rewrites": 95
},
"result":
{
"edges": 450012,
"markings": 400010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 19,
"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": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3668,
"runtime": 1728.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(G(**)) OR (F(**) OR ((** U G(**)) AND **)))) : F(G((X(**) OR **))) : X((F(*) OR (G(*) OR **))) : X(G(*)) : G(F(**)) : X(X(X(G(**)))) : F(G((X(G(*)) AND **))) : F(**) : F((F(**) AND (** AND **))) : X((F(*) AND F((X(X(**)) AND (** AND **))))) : (F((X(**) AND **)) AND X(X(G(**)))) : ((X(X(*)) R F(*)) AND (* R (G(*) R X(*)))) : (((X(X(G(**))) U G(**)) U **) AND F(**)) : F(G((G(F(*)) OR *))) : (X(G(**)) OR (G(F((F(*) OR *))) AND F(G(**))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "unknown unknown unknown no no no no no no no no unknown no no unknown ",
"value": "unknown unknown unknown no no no no no no no no unknown 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: G (((G (X ((p1 <= p14))) OR F ((p14 <= p8))) OR (((p14 <= p8) U G ((2 <= p2))) AND (p14 <= p8)))) : X (NOT(G (NOT(G ((X ((p6 <= p15)) OR (2 <= p17))))))) : ((F (X (NOT(G (((p1 <= p11)))))) OR X (NOT(F ((p4 <= p6))))) OR X ((p4 <= p6))) : NOT(F (X (((2 <= p5) U (p5 <= p7))))) : G (F ((2 <= p18))) : X (X (((1 <= 0) U X (G ((p4 <= p14)))))) : F (G (X (G ((X (G (NOT(F ((p5 <= 0))))) AND (p16 <= 1)))))) : F ((p11 + 1 <= p14)) : F (((F ((p2 <= p1)) AND (p9 <= p17)) AND (p6 <= 1))) : NOT(X ((G ((p5 <= p20)) OR NOT(F (((X (X ((p5 <= p20))) AND (p1 + 1 <= p19)) AND (p5 <= p20))))))) : (F ((X ((p6 <= p11)) AND (p16 <= p17))) AND X (G (X ((3 <= p17))))) : (NOT((X (X ((1 <= p18))) U G ((1 <= p18)))) AND NOT(((3 <= p6) U (F ((3 <= p6)) U X ((p10 <= p3)))))) : (((X (X (G ((p19 <= p16)))) U G ((3 <= p16))) U (p16 + 1 <= p19)) AND F ((3 <= p16))) : G (X (F (NOT(G (F ((F (G ((p5 + 1 <= p1))) AND (p9 <= p15)))))))) : (G (NOT(G (X ((G ((2 <= p9)) AND (2 <= p9)))))) U X (G ((p0 <= p11))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p1 <= p14))) OR (F ((p14 <= p8)) OR (((p14 <= p8) U G ((2 <= p2))) AND (p14 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p1 <= p14))) OR (F ((p14 <= p8)) OR (((p14 <= p8) U G ((2 <= p2))) AND (p14 <= p8)))))
lola: processed formula length: 97
lola: 95 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: 4384248 markings, 5784277 edges, 876850 markings/sec, 0 secs
lola: 8561172 markings, 11361229 edges, 835385 markings/sec, 5 secs
lola: 12695239 markings, 16867734 edges, 826813 markings/sec, 10 secs
lola: 16794648 markings, 22341807 edges, 819882 markings/sec, 15 secs
lola: 20977546 markings, 27916110 edges, 836580 markings/sec, 20 secs
lola: 25124807 markings, 33436963 edges, 829452 markings/sec, 25 secs
lola: 29203589 markings, 38880094 edges, 815756 markings/sec, 30 secs
lola: 33257796 markings, 44286365 edges, 810841 markings/sec, 35 secs
lola: 37304634 markings, 49681581 edges, 809368 markings/sec, 40 secs
lola: 41366709 markings, 55099653 edges, 812415 markings/sec, 45 secs
lola: 45423207 markings, 60509357 edges, 811300 markings/sec, 50 secs
lola: 49461257 markings, 65891394 edges, 807610 markings/sec, 55 secs
lola: 53456579 markings, 71209334 edges, 799064 markings/sec, 60 secs
lola: 57426170 markings, 76513684 edges, 793918 markings/sec, 65 secs
lola: 61475760 markings, 81913026 edges, 809918 markings/sec, 70 secs
lola: 65492351 markings, 87262874 edges, 803318 markings/sec, 75 secs
lola: 69469196 markings, 92569660 edges, 795369 markings/sec, 80 secs
lola: 73458850 markings, 97887543 edges, 797931 markings/sec, 85 secs
lola: 77427813 markings, 103178330 edges, 793793 markings/sec, 90 secs
lola: 81416166 markings, 108498439 edges, 797671 markings/sec, 95 secs
lola: 85375114 markings, 113775684 edges, 791790 markings/sec, 100 secs
lola: 89354855 markings, 119081391 edges, 795948 markings/sec, 105 secs
lola: 92211264 markings, 122893837 edges, 571282 markings/sec, 110 secs
lola: 93101671 markings, 124076576 edges, 178081 markings/sec, 115 secs
lola: 94253261 markings, 125603949 edges, 230318 markings/sec, 120 secs
lola: 95550757 markings, 127350183 edges, 259499 markings/sec, 125 secs
lola: 97909088 markings, 130487655 edges, 471666 markings/sec, 130 secs
lola: 101289127 markings, 134989801 edges, 676008 markings/sec, 135 secs
lola: 103964902 markings, 138565595 edges, 535155 markings/sec, 140 secs
lola: 105481620 markings, 140582323 edges, 303344 markings/sec, 145 secs
lola: 107388638 markings, 143131884 edges, 381404 markings/sec, 150 secs
lola: 108010002 markings, 143960722 edges, 124273 markings/sec, 155 secs
lola: 109460536 markings, 145889712 edges, 290107 markings/sec, 160 secs
lola: 110438567 markings, 147189303 edges, 195606 markings/sec, 165 secs
lola: 111062304 markings, 148017347 edges, 124747 markings/sec, 170 secs
lola: 112976384 markings, 150577136 edges, 382816 markings/sec, 175 secs
lola: 113332311 markings, 151047335 edges, 71185 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p6 <= p15)) OR (2 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p6 <= p15)) OR (2 <= p17))))
lola: processed formula length: 39
lola: 95 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: 5001571 markings, 6202103 edges, 1000314 markings/sec, 0 secs
lola: 9717960 markings, 12107298 edges, 943278 markings/sec, 5 secs
lola: 14340280 markings, 17887067 edges, 924464 markings/sec, 10 secs
lola: 18929140 markings, 23622219 edges, 917772 markings/sec, 15 secs
lola: 23501843 markings, 29335831 edges, 914541 markings/sec, 20 secs
lola: 28084294 markings, 35062441 edges, 916490 markings/sec, 25 secs
lola: 32637435 markings, 40749970 edges, 910628 markings/sec, 30 secs
lola: 37159267 markings, 46409638 edges, 904366 markings/sec, 35 secs
lola: 41685549 markings, 52064136 edges, 905256 markings/sec, 40 secs
lola: 46228963 markings, 57738695 edges, 908683 markings/sec, 45 secs
lola: 50798954 markings, 63449464 edges, 913998 markings/sec, 50 secs
lola: 55442580 markings, 69256869 edges, 928725 markings/sec, 55 secs
lola: 60037124 markings, 74999601 edges, 918909 markings/sec, 60 secs
lola: 64623646 markings, 80731638 edges, 917304 markings/sec, 65 secs
lola: 69151082 markings, 86401560 edges, 905487 markings/sec, 70 secs
lola: 73686722 markings, 92065753 edges, 907128 markings/sec, 75 secs
lola: 78230562 markings, 97740883 edges, 908768 markings/sec, 80 secs
lola: 82776878 markings, 103427705 edges, 909263 markings/sec, 85 secs
lola: 87291302 markings, 109071883 edges, 902885 markings/sec, 90 secs
lola: 91819610 markings, 114726303 edges, 905662 markings/sec, 95 secs
lola: 96308114 markings, 120344315 edges, 897701 markings/sec, 100 secs
lola: 100155853 markings, 125159396 edges, 769548 markings/sec, 105 secs
lola: 102834932 markings, 128499495 edges, 535816 markings/sec, 110 secs
lola: 104458348 markings, 130527972 edges, 324683 markings/sec, 115 secs
lola: 105909803 markings, 132346580 edges, 290291 markings/sec, 120 secs
lola: 108520603 markings, 135610986 edges, 522160 markings/sec, 125 secs
lola: 111146599 markings, 138895650 edges, 525199 markings/sec, 130 secs
lola: 112170106 markings, 140171226 edges, 204701 markings/sec, 135 secs
lola: 115194093 markings, 143945243 edges, 604797 markings/sec, 140 secs
lola: 119120281 markings, 148860575 edges, 785238 markings/sec, 145 secs
lola: 119301189 markings, 149085117 edges, 36182 markings/sec, 150 secs
lola: 119694203 markings, 149575804 edges, 78603 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p11 + 1 <= p1))) OR (G ((p6 + 1 <= p4)) OR (p4 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p11 + 1 <= p1))) OR (G ((p6 + 1 <= p4)) OR (p4 <= p6))))
lola: processed formula length: 65
lola: 95 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: 4578369 markings, 6042509 edges, 915674 markings/sec, 0 secs
lola: 8989667 markings, 11934413 edges, 882260 markings/sec, 5 secs
lola: 13370081 markings, 17770169 edges, 876083 markings/sec, 10 secs
lola: 17671074 markings, 23506437 edges, 860199 markings/sec, 15 secs
lola: 21950830 markings, 29201027 edges, 855951 markings/sec, 20 secs
lola: 26233129 markings, 34924434 edges, 856460 markings/sec, 25 secs
lola: 30530858 markings, 40645984 edges, 859546 markings/sec, 30 secs
lola: 34766676 markings, 46299667 edges, 847164 markings/sec, 35 secs
lola: 38918258 markings, 51827000 edges, 830316 markings/sec, 40 secs
lola: 43064483 markings, 57364770 edges, 829245 markings/sec, 45 secs
lola: 47209424 markings, 62888665 edges, 828988 markings/sec, 50 secs
lola: 51411705 markings, 68492046 edges, 840456 markings/sec, 55 secs
lola: 55539013 markings, 73989382 edges, 825462 markings/sec, 60 secs
lola: 59644522 markings, 79466189 edges, 821102 markings/sec, 65 secs
lola: 63819719 markings, 85028942 edges, 835039 markings/sec, 70 secs
lola: 67921003 markings, 90505828 edges, 820257 markings/sec, 75 secs
lola: 72053002 markings, 96003784 edges, 826400 markings/sec, 80 secs
lola: 76146192 markings, 101468527 edges, 818638 markings/sec, 85 secs
lola: 80337154 markings, 107054928 edges, 838192 markings/sec, 90 secs
lola: 84478437 markings, 112579000 edges, 828257 markings/sec, 95 secs
lola: 88612588 markings, 118092997 edges, 826830 markings/sec, 100 secs
lola: 91429405 markings, 121843194 edges, 563363 markings/sec, 105 secs
lola: 94099475 markings, 125401450 edges, 534014 markings/sec, 110 secs
lola: 97611311 markings, 130108403 edges, 702367 markings/sec, 115 secs
lola: 101219587 markings, 134903371 edges, 721655 markings/sec, 120 secs
lola: 101719532 markings, 135570210 edges, 99989 markings/sec, 125 secs
lola: 104946116 markings, 139868125 edges, 645317 markings/sec, 130 secs
lola: 105101415 markings, 140076072 edges, 31060 markings/sec, 135 secs
lola: 108125510 markings, 144112186 edges, 604819 markings/sec, 140 secs
lola: 108865551 markings, 145097240 edges, 148008 markings/sec, 145 secs
lola: 108880685 markings, 145119940 edges, 3027 markings/sec, 150 secs
lola: 112426392 markings, 149838467 edges, 709141 markings/sec, 155 secs
lola: 112537192 markings, 149987942 edges, 22160 markings/sec, 160 secs
lola: 113018737 markings, 150626977 edges, 96309 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p7 + 1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p7 + 1 <= p5)))
lola: processed formula length: 22
lola: 95 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((p4 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((p4 <= p14)))))
lola: processed formula length: 27
lola: 95 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G ((1 <= p5))) AND (p16 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((1 <= p5))) AND (p16 <= 1))))
lola: processed formula length: 42
lola: 95 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: 200004 markings, 200005 edges
lola: lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: X ((F ((p20 + 1 <= p5)) AND F ((X (X ((p5 <= p20))) AND ((p1 + 1 <= p19) AND (p5 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p20 + 1 <= p5)) AND F ((X (X ((p5 <= p20))) AND ((p1 + 1 <= p19) AND (p5 <= p20))))))
lola: processed formula length: 93
lola: 95 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p6 <= p11)) AND (p16 <= p17))) AND X (X (G ((3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p6 <= p11)) AND (p16 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p6 <= p11)) AND (p16 <= p17)))
lola: processed formula length: 38
lola: 95 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: 4 markings, 3 edges
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((3 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((3 <= p17))))
lola: processed formula length: 22
lola: 95 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: ========================================
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: 200003 markings, 200003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X ((p18 <= 0))) R F ((p18 <= 0))) AND ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10))))
lola: processed formula length: 51
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4809820 markings, 6339685 edges, 961964 markings/sec, 0 secs
lola: 9362425 markings, 12412487 edges, 910521 markings/sec, 5 secs
lola: 13853010 markings, 18403102 edges, 898117 markings/sec, 10 secs
lola: 18289488 markings, 24309051 edges, 887296 markings/sec, 15 secs
lola: 22740366 markings, 30240517 edges, 890176 markings/sec, 20 secs
lola: 27146037 markings, 36118787 edges, 881134 markings/sec, 25 secs
lola: 31534397 markings, 41976283 edges, 877672 markings/sec, 30 secs
lola: 35938369 markings, 47838608 edges, 880794 markings/sec, 35 secs
lola: 40344840 markings, 53716859 edges, 881294 markings/sec, 40 secs
lola: 44731132 markings, 59571254 edges, 877258 markings/sec, 45 secs
lola: 49188866 markings, 65507810 edges, 891547 markings/sec, 50 secs
lola: 53490532 markings, 71240888 edges, 860333 markings/sec, 55 secs
lola: 57780940 markings, 76970835 edges, 858082 markings/sec, 60 secs
lola: 62117578 markings, 82750749 edges, 867328 markings/sec, 65 secs
lola: 66417624 markings, 88475774 edges, 860009 markings/sec, 70 secs
lola: 70687439 markings, 94180455 edges, 853963 markings/sec, 75 secs
lola: 74973740 markings, 99884862 edges, 857260 markings/sec, 80 secs
lola: 79366299 markings, 105748658 edges, 878512 markings/sec, 85 secs
lola: 83716200 markings, 111548466 edges, 869980 markings/sec, 90 secs
lola: 88069517 markings, 117353398 edges, 870663 markings/sec, 95 secs
lola: 92334635 markings, 123036080 edges, 853024 markings/sec, 100 secs
lola: 94163903 markings, 125471077 edges, 365854 markings/sec, 105 secs
lola: 95758821 markings, 127609458 edges, 318984 markings/sec, 110 secs
lola: 97715024 markings, 130223866 edges, 391241 markings/sec, 115 secs
lola: 100107088 markings, 133407754 edges, 478413 markings/sec, 120 secs
lola: 102437397 markings, 136505073 edges, 466062 markings/sec, 125 secs
lola: 104633981 markings, 139434678 edges, 439317 markings/sec, 130 secs
lola: 107649571 markings, 143450288 edges, 603118 markings/sec, 135 secs
lola: 110920528 markings, 147821266 edges, 654191 markings/sec, 140 secs
lola: 113713004 markings, 151545063 edges, 558495 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p18 <= 0))) R F ((p18 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((p18 <= 0))) R F ((p18 <= 0)))
lola: processed formula length: 37
lola: 95 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 15 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (X (G ((p19 <= p16)))) U G ((3 <= p16))) U (p16 + 1 <= p19)) AND F ((3 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p16))
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: (p16 <= 2)
lola: processed formula length: 10
lola: 97 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: 300004 markings, 300004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p0 <= p11))) OR (G (F ((F ((p9 <= 1)) OR (p9 <= 1)))) AND F (G ((p0 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= p11)))
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 ((p0 <= p11)))
lola: processed formula length: 19
lola: 95 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: 400010 markings, 450012 edges
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p0 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p0 <= p11)))
lola: processed formula length: 19
lola: 95 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: ========================================
lola: 4862369 markings, 6418506 edges, 972474 markings/sec, 0 secs
lola: 9464082 markings, 12564148 edges, 920343 markings/sec, 5 secs
lola: 14045146 markings, 18667584 edges, 916213 markings/sec, 10 secs
lola: 18517411 markings, 24625935 edges, 894453 markings/sec, 15 secs
lola: 22929789 markings, 30519458 edges, 882476 markings/sec, 20 secs
lola: 27371888 markings, 36432560 edges, 888420 markings/sec, 25 secs
lola: 31785478 markings, 42327902 edges, 882718 markings/sec, 30 secs
lola: 36133225 markings, 48124480 edges, 869549 markings/sec, 35 secs
lola: 40476319 markings, 53914076 edges, 868619 markings/sec, 40 secs
lola: 44830913 markings, 59720926 edges, 870919 markings/sec, 45 secs
lola: 49227389 markings, 65577719 edges, 879295 markings/sec, 50 secs
lola: 53613568 markings, 71419816 edges, 877236 markings/sec, 55 secs
lola: 57925032 markings, 77175418 edges, 862293 markings/sec, 60 secs
lola: 62224804 markings, 82911589 edges, 859954 markings/sec, 65 secs
lola: 66574068 markings, 88710441 edges, 869853 markings/sec, 70 secs
lola: 70914613 markings, 94496214 edges, 868109 markings/sec, 75 secs
lola: 75150791 markings, 100150439 edges, 847236 markings/sec, 80 secs
lola: 79436899 markings, 105854556 edges, 857222 markings/sec, 85 secs
lola: 83647003 markings, 111469670 edges, 842021 markings/sec, 90 secs
lola: 87875593 markings, 117112513 edges, 845718 markings/sec, 95 secs
lola: 92027720 markings, 122641657 edges, 830425 markings/sec, 100 secs
lola: 94781976 markings, 126322856 edges, 550851 markings/sec, 105 secs
lola: 96026919 markings, 127977562 edges, 248989 markings/sec, 110 secs
lola: 98682738 markings, 131523437 edges, 531164 markings/sec, 115 secs
lola: 99668085 markings, 132826133 edges, 197069 markings/sec, 120 secs
lola: 102643352 markings, 136794039 edges, 595053 markings/sec, 125 secs
lola: 104230875 markings, 138920273 edges, 317505 markings/sec, 130 secs
lola: 106031586 markings, 141321322 edges, 360142 markings/sec, 135 secs
lola: 108437973 markings, 144530878 edges, 481277 markings/sec, 140 secs
lola: 110135970 markings, 146786707 edges, 339599 markings/sec, 145 secs
lola: 112446771 markings, 149869033 edges, 462160 markings/sec, 150 secs
lola: 113335568 markings, 151052221 edges, 177759 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p11 + 1 <= p14))
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: (p14 <= p11)
lola: processed formula length: 12
lola: 97 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: 300003 markings, 300003 edges
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p18)))
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 <= p18)))
lola: processed formula length: 18
lola: 95 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: 250002 markings, 250002 edges
lola: ========================================
lola: subprocess 13 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p1 <= p5))) OR (p15 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p1 <= p5))) OR (p15 + 1 <= p9))))
lola: processed formula length: 47
lola: 95 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: 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: 1099991 markings, 1499982 edges
lola: ========================================
lola: subprocess 14 will run for 2666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p2 <= p1)) AND ((p9 <= p17) AND (p6 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p2 <= p1)) AND ((p9 <= p17) AND (p6 <= 1))))
lola: processed formula length: 52
lola: 95 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: 300008 markings, 300008 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p1 <= p14))) OR (F ((p14 <= p8)) OR (((p14 <= p8) U G ((2 <= p2))) AND (p14 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p1 <= p14))) OR (F ((p14 <= p8)) OR (((p14 <= p8) U G ((2 <= p2))) AND (p14 <= p8)))))
lola: processed formula length: 97
lola: 95 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: 4380189 markings, 5780219 edges, 876038 markings/sec, 0 secs
lola: 8580986 markings, 11381043 edges, 840159 markings/sec, 5 secs
lola: 12740763 markings, 16936018 edges, 831955 markings/sec, 10 secs
lola: 16851478 markings, 22402049 edges, 822143 markings/sec, 15 secs
lola: 20908727 markings, 27812883 edges, 811450 markings/sec, 20 secs
lola: 24969306 markings, 33228710 edges, 812116 markings/sec, 25 secs
lola: 29060675 markings, 38690724 edges, 818274 markings/sec, 30 secs
lola: 33094247 markings, 44066040 edges, 806714 markings/sec, 35 secs
lola: 37091476 markings, 49391723 edges, 799446 markings/sec, 40 secs
lola: 41085778 markings, 54728259 edges, 798860 markings/sec, 45 secs
lola: 45082577 markings, 60048416 edges, 799360 markings/sec, 50 secs
lola: 49088023 markings, 65388350 edges, 801089 markings/sec, 55 secs
lola: 53057888 markings, 70686303 edges, 793973 markings/sec, 60 secs
lola: 57018566 markings, 75968946 edges, 792136 markings/sec, 65 secs
lola: 60990045 markings, 81259460 edges, 794296 markings/sec, 70 secs
lola: 64913793 markings, 86495043 edges, 784750 markings/sec, 75 secs
lola: 68847082 markings, 91744937 edges, 786658 markings/sec, 80 secs
lola: 72802281 markings, 97002766 edges, 791040 markings/sec, 85 secs
lola: 76714510 markings, 102220999 edges, 782446 markings/sec, 90 secs
lola: 80656983 markings, 107484670 edges, 788495 markings/sec, 95 secs
lola: 84547222 markings, 112669989 edges, 778048 markings/sec, 100 secs
lola: 88440051 markings, 117859194 edges, 778566 markings/sec, 105 secs
lola: 92303360 markings, 123004197 edges, 772662 markings/sec, 110 secs
lola: 94630519 markings, 126127806 edges, 465432 markings/sec, 115 secs
lola: 96460671 markings, 128561314 edges, 366030 markings/sec, 120 secs
lola: 98942786 markings, 131863192 edges, 496423 markings/sec, 125 secs
lola: 101019424 markings, 134628129 edges, 415328 markings/sec, 130 secs
lola: 103635047 markings, 138126535 edges, 523125 markings/sec, 135 secs
lola: 105820161 markings, 141029184 edges, 437023 markings/sec, 140 secs
lola: 108385280 markings, 144451837 edges, 513024 markings/sec, 145 secs
lola: 109912833 markings, 146493151 edges, 305511 markings/sec, 150 secs
lola: 112371405 markings, 149772153 edges, 491714 markings/sec, 155 secs
lola: 113264665 markings, 150965419 edges, 178652 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p6 <= p15)) OR (2 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p6 <= p15)) OR (2 <= p17))))
lola: processed formula length: 39
lola: 95 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: 4925020 markings, 6116702 edges, 985004 markings/sec, 0 secs
lola: 9614268 markings, 11969043 edges, 937850 markings/sec, 5 secs
lola: 14240247 markings, 17753689 edges, 925196 markings/sec, 10 secs
lola: 18863727 markings, 23535000 edges, 924696 markings/sec, 15 secs
lola: 23498498 markings, 29331372 edges, 926954 markings/sec, 20 secs
lola: 28156848 markings, 35157129 edges, 931670 markings/sec, 25 secs
lola: 32805910 markings, 40957938 edges, 929812 markings/sec, 30 secs
lola: 37344092 markings, 46642186 edges, 907636 markings/sec, 35 secs
lola: 41886349 markings, 52315206 edges, 908451 markings/sec, 40 secs
lola: 46435413 markings, 57997298 edges, 909813 markings/sec, 45 secs
lola: 50953104 markings, 63653615 edges, 903538 markings/sec, 50 secs
lola: 55578807 markings, 69429362 edges, 925141 markings/sec, 55 secs
lola: 60115867 markings, 75104590 edges, 907412 markings/sec, 60 secs
lola: 64616115 markings, 80721595 edges, 900050 markings/sec, 65 secs
lola: 69044501 markings, 86259453 edges, 885677 markings/sec, 70 secs
lola: 73497941 markings, 91830711 edges, 890688 markings/sec, 75 secs
lola: 77980900 markings, 97431681 edges, 896592 markings/sec, 80 secs
lola: 82457984 markings, 103027452 edges, 895417 markings/sec, 85 secs
lola: 86852284 markings, 108519857 edges, 878860 markings/sec, 90 secs
lola: 91248647 markings, 114015016 edges, 879273 markings/sec, 95 secs
lola: 95617086 markings, 119472943 edges, 873688 markings/sec, 100 secs
lola: 99897923 markings, 124831678 edges, 856167 markings/sec, 105 secs
lola: 101733984 markings, 127131244 edges, 367212 markings/sec, 110 secs
lola: 104344346 markings, 130393828 edges, 522072 markings/sec, 115 secs
lola: 106063885 markings, 132535356 edges, 343908 markings/sec, 120 secs
lola: 107886613 markings, 134815665 edges, 364546 markings/sec, 125 secs
lola: 110747554 markings, 138396924 edges, 572188 markings/sec, 130 secs
lola: 112565760 markings, 140666884 edges, 363641 markings/sec, 135 secs
lola: 115440238 markings, 144253844 edges, 574896 markings/sec, 140 secs
lola: 117959649 markings, 147410827 edges, 503882 markings/sec, 145 secs
lola: 120354514 markings, 150405716 edges, 478973 markings/sec, 150 secs
lola: 122517466 markings, 153106825 edges, 432590 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((F (((p11 + 1 <= p1))) OR (G ((p6 + 1 <= p4)) OR (p4 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p11 + 1 <= p1))) OR (G ((p6 + 1 <= p4)) OR (p4 <= p6))))
lola: processed formula length: 65
lola: 95 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: 4591749 markings, 6062581 edges, 918350 markings/sec, 0 secs
lola: 9008333 markings, 11958392 edges, 883317 markings/sec, 5 secs
lola: 13377976 markings, 17778067 edges, 873929 markings/sec, 10 secs
lola: 17655099 markings, 23482476 edges, 855425 markings/sec, 15 secs
lola: 21932907 markings, 29183054 edges, 855562 markings/sec, 20 secs
lola: 26128078 markings, 34778252 edges, 839034 markings/sec, 25 secs
lola: 30324804 markings, 40375008 edges, 839345 markings/sec, 30 secs
lola: 34520458 markings, 45970691 edges, 839131 markings/sec, 35 secs
lola: 38686953 markings, 51530044 edges, 833299 markings/sec, 40 secs
lola: 42910943 markings, 57161228 edges, 844798 markings/sec, 45 secs
lola: 47094101 markings, 62740685 edges, 836632 markings/sec, 50 secs
lola: 51238698 markings, 68257539 edges, 828919 markings/sec, 55 secs
lola: 55326235 markings, 73713803 edges, 817507 markings/sec, 60 secs
lola: 59475189 markings, 79237193 edges, 829791 markings/sec, 65 secs
lola: 63646662 markings, 84797088 edges, 834295 markings/sec, 70 secs
lola: 67779545 markings, 90318642 edges, 826577 markings/sec, 75 secs
lola: 71929358 markings, 95843322 edges, 829963 markings/sec, 80 secs
lola: 76040279 markings, 101334662 edges, 822184 markings/sec, 85 secs
lola: 80242896 markings, 106938546 edges, 840523 markings/sec, 90 secs
lola: 84390409 markings, 112459773 edges, 829503 markings/sec, 95 secs
lola: 88539771 markings, 117990364 edges, 829872 markings/sec, 100 secs
lola: 92506619 markings, 123284727 edges, 793370 markings/sec, 105 secs
lola: 94953067 markings, 126568550 edges, 489290 markings/sec, 110 secs
lola: 98531635 markings, 131322371 edges, 715714 markings/sec, 115 secs
lola: 98714522 markings, 131565180 edges, 36577 markings/sec, 120 secs
lola: 102062846 markings, 136020517 edges, 669665 markings/sec, 125 secs
lola: 103546656 markings, 137997346 edges, 296762 markings/sec, 130 secs
lola: 105418929 markings, 140502341 edges, 374455 markings/sec, 135 secs
lola: 107569348 markings, 143370065 edges, 430084 markings/sec, 140 secs
lola: 110581402 markings, 147382138 edges, 602411 markings/sec, 145 secs
lola: 112017037 markings, 149299438 edges, 287127 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((X (X ((p18 <= 0))) R F ((p18 <= 0))) AND ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 <= 2) R (G ((p6 <= 2)) R X ((p3 + 1 <= p10))))
lola: processed formula length: 51
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4838543 markings, 6382770 edges, 967709 markings/sec, 0 secs
lola: 9464382 markings, 12546481 edges, 925168 markings/sec, 5 secs
lola: 14062913 markings, 18669231 edges, 919706 markings/sec, 10 secs
lola: 18546140 markings, 24646263 edges, 896645 markings/sec, 15 secs
lola: 23014373 markings, 30614526 edges, 893647 markings/sec, 20 secs
lola: 27484480 markings, 36576449 edges, 894021 markings/sec, 25 secs
lola: 31923995 markings, 42485676 edges, 887903 markings/sec, 30 secs
lola: 36297699 markings, 48321188 edges, 874741 markings/sec, 35 secs
lola: 40674128 markings, 54160787 edges, 875286 markings/sec, 40 secs
lola: 45083791 markings, 60034091 edges, 881933 markings/sec, 45 secs
lola: 49505995 markings, 65933501 edges, 884441 markings/sec, 50 secs
lola: 53861547 markings, 71741785 edges, 871110 markings/sec, 55 secs
lola: 58186164 markings, 77503667 edges, 864923 markings/sec, 60 secs
lola: 62582012 markings, 83372396 edges, 879170 markings/sec, 65 secs
lola: 66974593 markings, 89225038 edges, 878516 markings/sec, 70 secs
lola: 71319466 markings, 95019941 edges, 868975 markings/sec, 75 secs
lola: 75627324 markings, 100765233 edges, 861572 markings/sec, 80 secs
lola: 80052933 markings, 106653600 edges, 885122 markings/sec, 85 secs
lola: 84409226 markings, 112462997 edges, 871259 markings/sec, 90 secs
lola: 88761835 markings, 118266868 edges, 870522 markings/sec, 95 secs
lola: 92942790 markings, 123844090 edges, 836191 markings/sec, 100 secs
lola: 95474711 markings, 127226127 edges, 506384 markings/sec, 105 secs
lola: 96471800 markings, 128556737 edges, 199418 markings/sec, 110 secs
lola: 98449102 markings, 131197673 edges, 395460 markings/sec, 115 secs
lola: 100792583 markings, 134312868 edges, 468696 markings/sec, 120 secs
lola: 102295530 markings, 136317276 edges, 300589 markings/sec, 125 secs
lola: 104829632 markings, 139693401 edges, 506820 markings/sec, 130 secs
lola: 106855896 markings, 142406607 edges, 405253 markings/sec, 135 secs
lola: 109656916 markings, 146134279 edges, 560204 markings/sec, 140 secs
lola: 112051942 markings, 149326794 edges, 479005 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (X ((p18 <= 0))) R F ((p18 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((p18 <= 0))) R F ((p18 <= 0)))
lola: processed formula length: 37
lola: 95 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 15 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((p0 <= p11))) OR (G (F ((F ((p9 <= 1)) OR (p9 <= 1)))) AND F (G ((p0 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= p11)))
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 ((p0 <= p11)))
lola: processed formula length: 19
lola: 95 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: 400010 markings, 450012 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p0 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p0 <= p11)))
lola: processed formula length: 19
lola: 95 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: 4796417 markings, 6344579 edges, 959283 markings/sec, 0 secs
lola: 9363987 markings, 12420890 edges, 913514 markings/sec, 5 secs
lola: 13860994 markings, 18416356 edges, 899401 markings/sec, 10 secs
lola: 18270192 markings, 24305108 edges, 881840 markings/sec, 15 secs
lola: 22728430 markings, 30242421 edges, 891648 markings/sec, 20 secs
lola: 27174388 markings, 36174569 edges, 889192 markings/sec, 25 secs
lola: 31609815 markings, 42089409 edges, 887085 markings/sec, 30 secs
lola: 36015919 markings, 47966160 edges, 881221 markings/sec, 35 secs
lola: 40462053 markings, 53892679 edges, 889227 markings/sec, 40 secs
lola: 44840122 markings, 59734737 edges, 875614 markings/sec, 45 secs
lola: 49248383 markings, 65598713 edges, 881652 markings/sec, 50 secs
lola: 53615890 markings, 71423299 edges, 873501 markings/sec, 55 secs
lola: 57972473 markings, 77233133 edges, 871317 markings/sec, 60 secs
lola: 62319609 markings, 83028793 edges, 869427 markings/sec, 65 secs
lola: 66643727 markings, 88794173 edges, 864824 markings/sec, 70 secs
lola: 70953985 markings, 94554459 edges, 862052 markings/sec, 75 secs
lola: 75235649 markings, 100252723 edges, 856333 markings/sec, 80 secs
lola: 79608713 markings, 106087276 edges, 874613 markings/sec, 85 secs
lola: 83926803 markings, 111839369 edges, 863618 markings/sec, 90 secs
lola: 88265033 markings, 117621670 edges, 867646 markings/sec, 95 secs
lola: 92407990 markings, 123159402 edges, 828591 markings/sec, 100 secs
lola: 94775255 markings, 126313287 edges, 473453 markings/sec, 105 secs
lola: 97764350 markings, 130295812 edges, 597819 markings/sec, 110 secs
lola: 98584865 markings, 131385521 edges, 164103 markings/sec, 115 secs
lola: 101482775 markings, 135248149 edges, 579582 markings/sec, 120 secs
lola: 103160511 markings, 137489737 edges, 335547 markings/sec, 125 secs
lola: 105080881 markings, 140045273 edges, 384074 markings/sec, 130 secs
lola: 107392922 markings, 143138310 edges, 462408 markings/sec, 135 secs
lola: 109259748 markings, 145613531 edges, 373365 markings/sec, 140 secs
lola: 111584090 markings, 148725020 edges, 464868 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown unknown unknown no no no no no no no no unknown no no unknown
lola:
preliminary result: unknown unknown unknown no no no no no no no no unknown no no unknown
lola: memory consumption: 3668 KB
lola: time consumption: 1728 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="FMS-PT-50000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is FMS-PT-50000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-tall-162048902800417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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