Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987883100921.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100921
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591251338222

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:15:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 06:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:15:41] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2020-06-04 06:15:41] [INFO ] Transformed 11 places.
[2020-06-04 06:15:41] [INFO ] Transformed 11 transitions.
[2020-06-04 06:15:41] [INFO ] Parsed PT model containing 11 places and 11 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=2222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 11 rows 11 cols
[2020-06-04 06:15:41] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-04 06:15:41] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 06:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 06:15:41] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 4 ms.
[2020-06-04 06:15:41] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
[2020-06-04 06:15:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-04 06:15:41] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2020-06-04 06:15:41] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
[2020-06-04 06:15:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:42] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 4 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2020-06-04 06:15:42] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 4 causal constraints over 2 iterations in 9 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:42] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:42] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:15:42] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:15:42] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:15:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:15:42] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:15:42] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 06:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2020-06-04 06:15:42] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 06:15:42] [INFO ] Flatten gal took : 21 ms
FORMULA ERK-PT-100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:15:42] [INFO ] Flatten gal took : 3 ms
[2020-06-04 06:15:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 06:15:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-100000 @ 3570 seconds

FORMULA ERK-PT-100000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2485
rslt: Output for LTLCardinality @ ERK-PT-100000

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((X (G ((3 <= p3))) AND ((3 <= p3) U (p8 <= p9))))",
"processed_size": 52,
"rewrites": 46
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X (X (X ((G ((2 <= p10)) AND (p0 <= p6))))) OR (p0 <= p6))))",
"processed_size": 67,
"rewrites": 46
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 480
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 630
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((F ((p7 <= p8)) OR (X ((3 <= p8)) OR (3 <= p8)))) AND X (G ((2 <= p6)))))",
"processed_size": 80,
"rewrites": 46
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 788
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p4 <= 0)))",
"processed_size": 17,
"rewrites": 46
},
"result":
{
"edges": 100012,
"markings": 100008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p7 <= p1) OR (p3 <= p4))))",
"processed_size": 35,
"rewrites": 46
},
"result":
{
"edges": 200007,
"markings": 200006,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3013
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F ((2 <= p1)) AND G ((p1 <= p4)))))",
"processed_size": 42,
"rewrites": 46
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3636,
"runtime": 1085.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((G(*) R *))) : F(G(*)) : (X(X(G(*))) OR **) : F(G(**)) : (X(**) OR (X(**) U (X(**) AND **))) : X((X(G(**)) AND (** U **))) : G(F(**)) : X(G((X(X(X((G(**) AND **)))) OR **))) : (F(**) AND X(G(**))) : G((G(**) OR X(G(*)))) : F((G((F(*) OR (X(**) OR **))) AND X(G(**)))) : G(F((F(**) AND G(**))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "unknown no no no yes no unknown no no unknown no no ",
"value": "unknown no no no yes no unknown no no unknown no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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 (NOT((F (X ((p1 <= p4))) U X ((p1 <= p4))))) : F ((((1 <= p4) U (0 <= 0)) AND NOT(F ((1 <= p4))))) : (NOT(X (X (((0 <= 0) U (p6 <= p9))))) OR (p1 + 1 <= p3)) : F (G (X (X (((p7 <= p1) OR (p3 <= p4)))))) : (X ((p0 <= 0)) OR (X ((p9 <= p4)) U (X ((1 <= p0)) AND (p9 <= p4)))) : X ((X (G ((3 <= p3))) AND ((3 <= p3) U (p8 <= p9)))) : G ((F (NOT(X ((G ((p1 + 1 <= p5)) AND (1 <= p0))))) U F ((1 <= p0)))) : G (X ((X (X (X ((G ((2 <= p10)) AND (p0 <= p6))))) OR (p0 <= p6)))) : (F ((2 <= p2)) AND X (G ((p5 <= p8)))) : G ((G ((3 <= p7)) OR G (X (G (NOT(F (((0 <= 0) U (p10 <= p1))))))))) : F ((G (((NOT(G ((p8 + 1 <= p7))) OR X ((3 <= p8))) OR (3 <= p8))) AND G (X ((2 <= p6))))) : G (F ((F ((((p4 + 1 <= p1) U (p1 <= p4)) U (2 <= p1))) AND G ((p1 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p4 + 1 <= p1)) R (p4 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p4 + 1 <= p1)) R (p4 + 1 <= p1))))
lola: processed formula length: 45
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3477505 markings, 8388116 edges, 695501 markings/sec, 0 secs
lola: 6673346 markings, 16375154 edges, 639168 markings/sec, 5 secs
lola: 9905673 markings, 24454490 edges, 646465 markings/sec, 10 secs
lola: 13241937 markings, 32793500 edges, 667253 markings/sec, 15 secs
lola: 16464691 markings, 40847813 edges, 644551 markings/sec, 20 secs
lola: 19755013 markings, 49072507 edges, 658064 markings/sec, 25 secs
lola: 23020706 markings, 57235523 edges, 653139 markings/sec, 30 secs
lola: 26390660 markings, 65660371 edges, 673991 markings/sec, 35 secs
lola: 29686054 markings, 73896695 edges, 659079 markings/sec, 40 secs
lola: 33049226 markings, 82305428 edges, 672634 markings/sec, 45 secs
lola: 36368338 markings, 90599854 edges, 663822 markings/sec, 50 secs
lola: 39658467 markings, 98826711 edges, 658026 markings/sec, 55 secs
lola: 42988850 markings, 107151305 edges, 666077 markings/sec, 60 secs
lola: 46202881 markings, 115186567 edges, 642806 markings/sec, 65 secs
lola: 49412357 markings, 123207394 edges, 641895 markings/sec, 70 secs
lola: 52623064 markings, 131235086 edges, 642141 markings/sec, 75 secs
lola: 55528584 markings, 138497799 edges, 581104 markings/sec, 80 secs
lola: 58348722 markings, 145548693 edges, 564028 markings/sec, 85 secs
lola: 61133605 markings, 152506710 edges, 556977 markings/sec, 90 secs
lola: 64147793 markings, 160043604 edges, 602838 markings/sec, 95 secs
lola: 67397274 markings, 168167715 edges, 649896 markings/sec, 100 secs
lola: 70632230 markings, 176254473 edges, 646991 markings/sec, 105 secs
lola: 73635324 markings, 183762087 edges, 600619 markings/sec, 110 secs
lola: 76637637 markings, 191264768 edges, 600463 markings/sec, 115 secs
lola: 79733592 markings, 199004187 edges, 619191 markings/sec, 120 secs
lola: 82658844 markings, 206318187 edges, 585050 markings/sec, 125 secs
lola: 85590812 markings, 213647323 edges, 586394 markings/sec, 130 secs
lola: 88641018 markings, 221272519 edges, 610041 markings/sec, 135 secs
lola: 91621689 markings, 228729959 edges, 596134 markings/sec, 140 secs
lola: 93369068 markings, 233097321 edges, 349476 markings/sec, 145 secs
lola: 95114990 markings, 237458591 edges, 349184 markings/sec, 150 secs
lola: 96953399 markings, 242052312 edges, 367682 markings/sec, 155 secs
lola: 98529175 markings, 245989278 edges, 315155 markings/sec, 160 secs
lola: 100205968 markings, 250182893 edges, 335359 markings/sec, 165 secs
lola: 101718803 markings, 253965230 edges, 302567 markings/sec, 170 secs
lola: 104196918 markings, 260157746 edges, 495623 markings/sec, 175 secs
lola: 105967939 markings, 264587483 edges, 354204 markings/sec, 180 secs
lola: 108136862 markings, 270008552 edges, 433785 markings/sec, 185 secs
lola: 110060211 markings, 274818255 edges, 384670 markings/sec, 190 secs
lola: 112310619 markings, 280441916 edges, 450082 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p9 + 1 <= p6)))) OR (p1 + 1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 + 1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 + 1 <= p3)
lola: processed formula length: 14
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p9 + 1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p9 + 1 <= p6))))
lola: processed formula length: 26
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200005 markings, 200005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p0 <= 0)) OR (X ((p9 <= p4)) U (X ((1 <= p0)) AND (p9 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p0 <= 0))
lola: processed formula length: 13
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 3 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p9 <= p4)) U (X ((1 <= p0)) AND (p9 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p9 <= p4)) U (X ((1 <= p0)) AND (p9 <= p4)))
lola: processed formula length: 49
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((3 <= p3))) AND ((3 <= p3) U (p8 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((3 <= p3))) AND ((3 <= p3) U (p8 <= p9))))
lola: processed formula length: 52
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 4 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (X ((G ((2 <= p10)) AND (p0 <= p6))))) OR (p0 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (X ((G ((2 <= p10)) AND (p0 <= p6))))) OR (p0 <= p6))))
lola: processed formula length: 67
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 5 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((2 <= p2)) AND X (G ((p5 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 200007 markings, 200007 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((3 <= p7)) OR X (G ((p1 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((3 <= p7)) OR X (G ((p1 + 1 <= p10)))))
lola: processed formula length: 46
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2984537 markings, 7156016 edges, 596907 markings/sec, 0 secs
lola: 6429479 markings, 15765233 edges, 688988 markings/sec, 5 secs
lola: 9568565 markings, 23611280 edges, 627817 markings/sec, 10 secs
lola: 12699631 markings, 31438394 edges, 626213 markings/sec, 15 secs
lola: 15929742 markings, 39510755 edges, 646022 markings/sec, 20 secs
lola: 19255891 markings, 47825770 edges, 665230 markings/sec, 25 secs
lola: 22590194 markings, 56159741 edges, 666861 markings/sec, 30 secs
lola: 25722818 markings, 63989407 edges, 626525 markings/sec, 35 secs
lola: 28887883 markings, 71901523 edges, 633013 markings/sec, 40 secs
lola: 32197123 markings, 80175273 edges, 661848 markings/sec, 45 secs
lola: 35524072 markings, 88491777 edges, 665390 markings/sec, 50 secs
lola: 38831710 markings, 96760253 edges, 661528 markings/sec, 55 secs
lola: 42131372 markings, 105008628 edges, 659932 markings/sec, 60 secs
lola: 45361076 markings, 113080497 edges, 645941 markings/sec, 65 secs
lola: 48555917 markings, 121066556 edges, 638968 markings/sec, 70 secs
lola: 51831011 markings, 129255760 edges, 655019 markings/sec, 75 secs
lola: 55112249 markings, 137456749 edges, 656248 markings/sec, 80 secs
lola: 58384922 markings, 145636339 edges, 654535 markings/sec, 85 secs
lola: 61666354 markings, 153838808 edges, 656286 markings/sec, 90 secs
lola: 64945203 markings, 162038377 edges, 655770 markings/sec, 95 secs
lola: 68220348 markings, 170225664 edges, 655029 markings/sec, 100 secs
lola: 71489101 markings, 178395617 edges, 653751 markings/sec, 105 secs
lola: 74743119 markings, 186528999 edges, 650804 markings/sec, 110 secs
lola: 78006248 markings, 194686645 edges, 652626 markings/sec, 115 secs
lola: 81263924 markings, 202832345 edges, 651535 markings/sec, 120 secs
lola: 84515453 markings, 210959646 edges, 650306 markings/sec, 125 secs
lola: 87756190 markings, 219059082 edges, 648147 markings/sec, 130 secs
lola: 90855041 markings, 226807065 edges, 619770 markings/sec, 135 secs
lola: 93084089 markings, 232382942 edges, 445810 markings/sec, 140 secs
lola: 95055053 markings, 237306998 edges, 394193 markings/sec, 145 secs
lola: 96742335 markings, 241525420 edges, 337456 markings/sec, 150 secs
lola: 98217985 markings, 245214291 edges, 295130 markings/sec, 155 secs
lola: 99959330 markings, 249563775 edges, 348269 markings/sec, 160 secs
lola: 101100749 markings, 252417354 edges, 228284 markings/sec, 165 secs
lola: 103192902 markings, 257651384 edges, 418431 markings/sec, 170 secs
lola: 104263610 markings, 260324913 edges, 214142 markings/sec, 175 secs
lola: 106391285 markings, 265643016 edges, 425535 markings/sec, 180 secs
lola: 108218675 markings, 270212411 edges, 365478 markings/sec, 185 secs
lola: 110538305 markings, 276011129 edges, 463926 markings/sec, 190 secs
lola: 112495329 markings, 280901775 edges, 391405 markings/sec, 195 secs
lola: 113352717 markings, 283048025 edges, 171478 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((p7 <= p8)) OR (X ((3 <= p8)) OR (3 <= p8)))) AND X (G ((2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((p7 <= p8)) OR (X ((3 <= p8)) OR (3 <= p8)))) AND X (G ((2 <= p6)))))
lola: processed formula length: 80
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 8 will run for 788 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 0)))
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 ((p4 <= 0)))
lola: processed formula length: 17
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 0
lola: add low 2
lola: add low 8
lola: add low 6
lola: add low 10
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: 100008 markings, 100012 edges
lola: ========================================
lola: subprocess 9 will run for 1051 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p0)))
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 ((1 <= p0)))
lola: processed formula length: 17
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 6009305 markings, 9399610 edges, 1201861 markings/sec, 0 secs
lola: 12227686 markings, 19245526 edges, 1243676 markings/sec, 5 secs
lola: 18317308 markings, 28888344 edges, 1217924 markings/sec, 10 secs
lola: 24328381 markings, 38406127 edges, 1202215 markings/sec, 15 secs
lola: 29979204 markings, 47352577 edges, 1130165 markings/sec, 20 secs
lola: 35919577 markings, 56758436 edges, 1188075 markings/sec, 25 secs
lola: 41761882 markings, 66009898 edges, 1168461 markings/sec, 30 secs
lola: 47833237 markings, 75621988 edges, 1214271 markings/sec, 35 secs
lola: 53449708 markings, 84515677 edges, 1123294 markings/sec, 40 secs
lola: 59548730 markings, 94173714 edges, 1219804 markings/sec, 45 secs
lola: 65565184 markings, 103699996 edges, 1203291 markings/sec, 50 secs
lola: 71584355 markings, 113230137 edges, 1203834 markings/sec, 55 secs
lola: 77582337 markings, 122725729 edges, 1199596 markings/sec, 60 secs
lola: 83493586 markings, 132086442 edges, 1182250 markings/sec, 65 secs
lola: 89349216 markings, 141358214 edges, 1171126 markings/sec, 70 secs
lola: 95108629 markings, 150475907 edges, 1151883 markings/sec, 75 secs
lola: 100757384 markings, 159422332 edges, 1129751 markings/sec, 80 secs
lola: 106714795 markings, 168852586 edges, 1191482 markings/sec, 85 secs
lola: 112348963 markings, 177777384 edges, 1126834 markings/sec, 90 secs
lola: 115041165 markings, 182043516 edges, 538440 markings/sec, 95 secs
lola: 118761743 markings, 187927348 edges, 744116 markings/sec, 100 secs
lola: 121627250 markings, 192465993 edges, 573101 markings/sec, 105 secs
lola: 125169516 markings, 198074254 edges, 708453 markings/sec, 110 secs
lola: 128729192 markings, 203711516 edges, 711935 markings/sec, 115 secs
lola: 131668006 markings, 208364749 edges, 587763 markings/sec, 120 secs
lola: 134984672 markings, 213614148 edges, 663333 markings/sec, 125 secs
lola: 137928705 markings, 218278325 edges, 588807 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p7 <= p1) OR (p3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p7 <= p1) OR (p3 <= p4))))
lola: processed formula length: 35
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200006 markings, 200007 edges
lola: ========================================
lola: subprocess 11 will run for 3013 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((2 <= p1)) AND G ((p1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((2 <= p1)) AND G ((p1 <= p4)))))
lola: processed formula length: 42
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 200005 markings, 200005 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p4 + 1 <= p1)) R (p4 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p4 + 1 <= p1)) R (p4 + 1 <= p1))))
lola: processed formula length: 45
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3558428 markings, 8590388 edges, 711686 markings/sec, 0 secs
lola: 7086620 markings, 17407976 edges, 705638 markings/sec, 5 secs
lola: 10583569 markings, 26148777 edges, 699390 markings/sec, 10 secs
lola: 14038474 markings, 34783192 edges, 690981 markings/sec, 15 secs
lola: 17243498 markings, 42795843 edges, 641005 markings/sec, 20 secs
lola: 20443952 markings, 50795597 edges, 640091 markings/sec, 25 secs
lola: 23834189 markings, 59270882 edges, 678047 markings/sec, 30 secs
lola: 27011693 markings, 67211107 edges, 635501 markings/sec, 35 secs
lola: 30348736 markings, 75553797 edges, 667409 markings/sec, 40 secs
lola: 33343880 markings, 83039953 edges, 599029 markings/sec, 45 secs
lola: 36685849 markings, 91395596 edges, 668394 markings/sec, 50 secs
lola: 39992488 markings, 99659943 edges, 661328 markings/sec, 55 secs
lola: 43311344 markings, 107955930 edges, 663771 markings/sec, 60 secs
lola: 46633147 markings, 116260283 edges, 664361 markings/sec, 65 secs
lola: 49917006 markings, 124468028 edges, 656772 markings/sec, 70 secs
lola: 53200986 markings, 132678279 edges, 656796 markings/sec, 75 secs
lola: 56464078 markings, 140834406 edges, 652618 markings/sec, 80 secs
lola: 59757253 markings, 149068693 edges, 658635 markings/sec, 85 secs
lola: 63074463 markings, 157361104 edges, 663442 markings/sec, 90 secs
lola: 66360833 markings, 165574176 edges, 657274 markings/sec, 95 secs
lola: 69610549 markings, 173699696 edges, 649943 markings/sec, 100 secs
lola: 72848792 markings, 181795770 edges, 647649 markings/sec, 105 secs
lola: 76111130 markings, 189949952 edges, 652468 markings/sec, 110 secs
lola: 79379841 markings, 198121167 edges, 653742 markings/sec, 115 secs
lola: 82651128 markings, 206298392 edges, 654257 markings/sec, 120 secs
lola: 85477264 markings, 213364821 edges, 565227 markings/sec, 125 secs
lola: 88617274 markings, 221210694 edges, 628002 markings/sec, 130 secs
lola: 91889610 markings, 229396615 edges, 654467 markings/sec, 135 secs
lola: 94083310 markings, 234879816 edges, 438740 markings/sec, 140 secs
lola: 96090203 markings, 239894695 edges, 401379 markings/sec, 145 secs
lola: 98145614 markings, 245031894 edges, 411082 markings/sec, 150 secs
lola: 99996952 markings, 249658990 edges, 370268 markings/sec, 155 secs
lola: 102202433 markings, 255174539 edges, 441096 markings/sec, 160 secs
lola: 104415038 markings, 260706188 edges, 442521 markings/sec, 165 secs
lola: 106511313 markings, 265944899 edges, 419255 markings/sec, 170 secs
lola: 108764496 markings, 271579232 edges, 450637 markings/sec, 175 secs
lola: 110682633 markings, 276370550 edges, 383627 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((G ((3 <= p7)) OR X (G ((p1 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((3 <= p7)) OR X (G ((p1 + 1 <= p10)))))
lola: processed formula length: 46
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3598159 markings, 8689689 edges, 719632 markings/sec, 0 secs
lola: 7099149 markings, 17439671 edges, 700198 markings/sec, 5 secs
lola: 10558385 markings, 26086117 edges, 691847 markings/sec, 10 secs
lola: 14024615 markings, 34749057 edges, 693246 markings/sec, 15 secs
lola: 17270832 markings, 42863917 edges, 649243 markings/sec, 20 secs
lola: 20681363 markings, 51389226 edges, 682106 markings/sec, 25 secs
lola: 24103221 markings, 59941379 edges, 684372 markings/sec, 30 secs
lola: 27524871 markings, 68495543 edges, 684330 markings/sec, 35 secs
lola: 30925902 markings, 76995869 edges, 680206 markings/sec, 40 secs
lola: 34333181 markings, 85514602 edges, 681456 markings/sec, 45 secs
lola: 37683803 markings, 93890528 edges, 670124 markings/sec, 50 secs
lola: 40983762 markings, 102138424 edges, 659992 markings/sec, 55 secs
lola: 44269097 markings, 110352525 edges, 657067 markings/sec, 60 secs
lola: 47594978 markings, 118666099 edges, 665176 markings/sec, 65 secs
lola: 50923046 markings, 126982756 edges, 665614 markings/sec, 70 secs
lola: 54281876 markings, 135379219 edges, 671766 markings/sec, 75 secs
lola: 57630293 markings, 143751303 edges, 669683 markings/sec, 80 secs
lola: 60963477 markings, 152082125 edges, 666637 markings/sec, 85 secs
lola: 64318912 markings, 160472674 edges, 671087 markings/sec, 90 secs
lola: 67677875 markings, 168869964 edges, 671793 markings/sec, 95 secs
lola: 70976392 markings, 177112624 edges, 659703 markings/sec, 100 secs
lola: 74251257 markings, 185300630 edges, 654973 markings/sec, 105 secs
lola: 77516992 markings, 193461765 edges, 653147 markings/sec, 110 secs
lola: 80783015 markings, 201627878 edges, 653205 markings/sec, 115 secs
lola: 84010244 markings, 209695460 edges, 645446 markings/sec, 120 secs
lola: 87261918 markings, 217824960 edges, 650335 markings/sec, 125 secs
lola: 90527663 markings, 225986705 edges, 653149 markings/sec, 130 secs
lola: 93182315 markings, 232626018 edges, 530930 markings/sec, 135 secs
lola: 95088670 markings, 237389398 edges, 381271 markings/sec, 140 secs
lola: 97451411 markings, 243298545 edges, 472548 markings/sec, 145 secs
lola: 99246081 markings, 247782653 edges, 358934 markings/sec, 150 secs
lola: 102072320 markings, 254847592 edges, 565248 markings/sec, 155 secs
lola: 104478291 markings, 260863313 edges, 481194 markings/sec, 160 secs
lola: 106480229 markings, 265866853 edges, 400388 markings/sec, 165 secs
lola: 109039818 markings, 272266871 edges, 511918 markings/sec, 170 secs
lola: 111589069 markings, 278636796 edges, 509850 markings/sec, 175 secs
lola: 113050434 markings, 282290045 edges, 292273 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p0)))
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 ((1 <= p0)))
lola: processed formula length: 17
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 5975369 markings, 9345825 edges, 1195074 markings/sec, 0 secs
lola: 12192952 markings, 19190917 edges, 1243517 markings/sec, 5 secs
lola: 18275853 markings, 28821785 edges, 1216580 markings/sec, 10 secs
lola: 24304441 markings, 38367442 edges, 1205718 markings/sec, 15 secs
lola: 30286305 markings, 47839006 edges, 1196373 markings/sec, 20 secs
lola: 35393537 markings, 55926088 edges, 1021446 markings/sec, 25 secs
lola: 40538189 markings, 64071645 edges, 1028930 markings/sec, 30 secs
lola: 45738306 markings, 72306055 edges, 1040023 markings/sec, 35 secs
lola: 51420125 markings, 81302671 edges, 1136364 markings/sec, 40 secs
lola: 57463128 markings, 90870144 edges, 1208601 markings/sec, 45 secs
lola: 63471840 markings, 100384001 edges, 1201742 markings/sec, 50 secs
lola: 69450177 markings, 109849688 edges, 1195667 markings/sec, 55 secs
lola: 75437876 markings, 119331834 edges, 1197540 markings/sec, 60 secs
lola: 81398306 markings, 128767857 edges, 1192086 markings/sec, 65 secs
lola: 86746680 markings, 137237029 edges, 1069675 markings/sec, 70 secs
lola: 91968161 markings, 145503550 edges, 1044296 markings/sec, 75 secs
lola: 96941680 markings, 153378126 edges, 994704 markings/sec, 80 secs
lola: 101958635 markings, 161323515 edges, 1003391 markings/sec, 85 secs
lola: 107119604 markings, 169495597 edges, 1032194 markings/sec, 90 secs
lola: 112017761 markings, 177253706 edges, 979631 markings/sec, 95 secs
lola: 114903160 markings, 181820737 edges, 577080 markings/sec, 100 secs
lola: 118199730 markings, 187041944 edges, 659314 markings/sec, 105 secs
lola: 121363444 markings, 192049585 edges, 632743 markings/sec, 110 secs
lola: 124534530 markings, 197070191 edges, 634217 markings/sec, 115 secs
lola: 129067031 markings, 204245825 edges, 906500 markings/sec, 120 secs
lola: 131927272 markings, 208773514 edges, 572048 markings/sec, 125 secs
lola: 135795690 markings, 214898735 edges, 773684 markings/sec, 130 secs
lola: 138201178 markings, 218707427 edges, 481098 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no yes no unknown no no unknown no no
lola:
preliminary result: unknown no no no yes no unknown no no unknown no no
lola: memory consumption: 3636 KB
lola: time consumption: 1085 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="ERK-PT-100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ERK-PT-100000, 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 r178-tajo-158987883100921"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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