Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815400105.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FMS-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 2.6K Apr 1 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 1 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 13:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 1 13:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 1 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 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 1591164012458

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

FORMULA FMS-PT-50000-02 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-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-06 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-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-15 TRUE 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-03 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-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2220
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 Jun 3 06:00:21 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 313
},
"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 ((p8 <= 1)))",
"processed_size": 17,
"rewrites": 43
},
"result":
{
"edges": 250012,
"markings": 250010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 348
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"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": "F ((X (F ((p8 + 1 <= p21))) AND (1 <= p8)))",
"processed_size": 43,
"rewrites": 43
},
"result":
{
"edges": 250003,
"markings": 250003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": "((p19 <= p8) U (p7 <= p4))",
"processed_size": 26,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 580
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((p3 <= p21) U (X (X (G ((p7 <= p8)))) OR (1 <= p14))) OR G ((3 <= p8)))))",
"processed_size": 81,
"rewrites": 43
},
"result":
{
"edges": 200012,
"markings": 200010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 27
},
"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": 726
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p6 + 1 <= p20) U X ((2 <= p14))))",
"processed_size": 38,
"rewrites": 43
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 967
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((G ((p0 + 1 <= p4)) OR X (F ((p5 <= p15)))) U X (((p4 <= p17) OR (p5 <= p15))))",
"processed_size": 81,
"rewrites": 43
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1451
},
"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 ((p0 <= 0)))",
"processed_size": 17,
"rewrites": 43
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2902
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((p3 + 1 <= p18) AND (F ((p9 + 1 <= p13)) OR G ((p3 + 1 <= p18)))))",
"processed_size": 70,
"rewrites": 43
},
"result":
{
"edges": 250006,
"markings": 250006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": "((p19 <= p8) U (p7 <= p4))",
"processed_size": 26,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3516,
"runtime": 1350.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((X(**) U **) OR (** U **)))) : X(X((F(**) U G((G(**) AND F(**)))))) : (G(F(**)) OR F((X(F(**)) AND **))) : F((* AND (F(*) OR G(*)))) : (X(G(**)) OR (** OR (G(**) AND F((X(G(**)) OR **))))) : (G(*) AND (X(**) OR G(**))) : X(X(F(**))) : F(G(*)) : ((** U **) AND F((G(**) AND X(**)))) : F(G(((** U (X(X(G(**))) OR **)) OR G(**)))) : X((** U X(*))) : ((G(*) OR X(F(**))) U X(**))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "unknown unknown no no no no no no unknown no no yes ",
"value": "unknown unknown no no no no no no unknown no no yes "
},
"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: X (G (((X ((p8 <= p9)) U (p12 <= p4)) OR (((p6 + 1 <= p7) OR (p13 + 1 <= p20)) U (p7 <= p6))))) : X ((F (X (F ((p16 <= p3)))) U G (X ((G ((p1 <= p15)) AND F ((1 <= p10))))))) : (((p21 <= p8) U X (G (F ((p8 <= 1))))) OR F ((X (F ((p8 + 1 <= p21))) AND (1 <= p8)))) : F (NOT((G ((((p18 <= p3) U (0 <= 0)) AND (p13 <= p9))) U (p18 <= p3)))) : (G ((1 <= p16)) U (X (G (((p19 + 1 <= p18) AND (3 <= p2)))) OR (3 <= p2))) : (NOT(((p3 <= p5) U ((0 <= 0) U (3 <= p17)))) AND (X ((p14 <= p0)) OR G ((3 <= p17)))) : X ((X (((p16 <= p5) AND (3 <= p6))) U X (F ((p8 <= p19))))) : ((0 <= 0) U G (NOT(F ((1 <= p0))))) : (((p19 <= p8) U (p7 <= p4)) AND F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4))))) : X (F (G ((((p3 <= p21) U (X (G (X ((p7 <= p8)))) OR (1 <= p14))) OR G ((3 <= p8)))))) : X (((p6 + 1 <= p20) U NOT(X ((p14 <= 1))))) : ((NOT(F ((p4 <= p0))) OR NOT(G (NOT(X ((p5 <= p15)))))) U X (((p4 <= p17) OR (p5 <= p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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 (((X ((p8 <= p9)) U (p12 <= p4)) OR (((p6 + 1 <= p7) OR (p13 + 1 <= p20)) U (p7 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X ((p8 <= p9)) U (p12 <= p4)) OR (((p6 + 1 <= p7) OR (p13 + 1 <= p20)) U (p7 <= p6)))))
lola: processed formula length: 96
lola: 43 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: 3247184 markings, 4270745 edges, 649437 markings/sec, 0 secs
lola: 6356412 markings, 8409559 edges, 621846 markings/sec, 5 secs
lola: 9608564 markings, 12758629 edges, 650430 markings/sec, 10 secs
lola: 12869351 markings, 17103900 edges, 652157 markings/sec, 15 secs
lola: 16059028 markings, 21359137 edges, 637935 markings/sec, 20 secs
lola: 18941359 markings, 25191485 edges, 576466 markings/sec, 25 secs
lola: 22141272 markings, 29461689 edges, 639983 markings/sec, 30 secs
lola: 25050230 markings, 33350099 edges, 581792 markings/sec, 35 secs
lola: 28136596 markings, 37454615 edges, 617273 markings/sec, 40 secs
lola: 30988302 markings, 41257146 edges, 570341 markings/sec, 45 secs
lola: 34055527 markings, 45355754 edges, 613445 markings/sec, 50 secs
lola: 37117616 markings, 49426055 edges, 612418 markings/sec, 55 secs
lola: 40191902 markings, 53537454 edges, 614857 markings/sec, 60 secs
lola: 43168108 markings, 57501733 edges, 595241 markings/sec, 65 secs
lola: 46266066 markings, 61623638 edges, 619592 markings/sec, 70 secs
lola: 49120218 markings, 65429838 edges, 570830 markings/sec, 75 secs
lola: 52122210 markings, 69432796 edges, 600398 markings/sec, 80 secs
lola: 54974870 markings, 73236757 edges, 570532 markings/sec, 85 secs
lola: 57756825 markings, 76957210 edges, 556391 markings/sec, 90 secs
lola: 60606428 markings, 80756831 edges, 569921 markings/sec, 95 secs
lola: 63609019 markings, 84759443 edges, 600518 markings/sec, 100 secs
lola: 66440765 markings, 88535484 edges, 566349 markings/sec, 105 secs
lola: 69427462 markings, 92515501 edges, 597339 markings/sec, 110 secs
lola: 72187983 markings, 96188464 edges, 552104 markings/sec, 115 secs
lola: 75101071 markings, 100075857 edges, 582618 markings/sec, 120 secs
lola: 78062157 markings, 104017457 edges, 592217 markings/sec, 125 secs
lola: 81094954 markings, 108066621 edges, 606559 markings/sec, 130 secs
lola: 83909035 markings, 111812714 edges, 562816 markings/sec, 135 secs
lola: 86943066 markings, 115863731 edges, 606806 markings/sec, 140 secs
lola: 89824907 markings, 119711465 edges, 576368 markings/sec, 145 secs
lola: 92330044 markings, 123044143 edges, 501027 markings/sec, 150 secs
lola: 93903000 markings, 125155121 edges, 314591 markings/sec, 155 secs
lola: 95678456 markings, 127516730 edges, 355091 markings/sec, 160 secs
lola: 97172660 markings, 129508019 edges, 298841 markings/sec, 165 secs
lola: 98676710 markings, 131514081 edges, 300810 markings/sec, 170 secs
lola: 100465797 markings, 133897692 edges, 357817 markings/sec, 175 secs
lola: 101365508 markings, 135097250 edges, 179942 markings/sec, 180 secs
lola: 102831162 markings, 137045716 edges, 293131 markings/sec, 185 secs
lola: 104872465 markings, 139773163 edges, 408261 markings/sec, 190 secs
lola: 105707410 markings, 140885060 edges, 166989 markings/sec, 195 secs
lola: 108003129 markings, 143953617 edges, 459144 markings/sec, 200 secs
lola: 108596302 markings, 144743370 edges, 118635 markings/sec, 205 secs
lola: 110838165 markings, 147731142 edges, 448373 markings/sec, 210 secs
lola: 111527886 markings, 148640716 edges, 137944 markings/sec, 215 secs
lola: 112975873 markings, 150576625 edges, 289597 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p16 <= p3)) U G ((G ((p1 <= p15)) AND F ((1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p16 <= p3)) U G ((G ((p1 <= p15)) AND F ((1 <= p10)))))))
lola: processed formula length: 68
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 3642915 markings, 4792922 edges, 728583 markings/sec, 0 secs
lola: 7103016 markings, 9404355 edges, 692020 markings/sec, 5 secs
lola: 10740358 markings, 14260287 edges, 727468 markings/sec, 10 secs
lola: 14093258 markings, 18739559 edges, 670580 markings/sec, 15 secs
lola: 17655237 markings, 23482444 edges, 712396 markings/sec, 20 secs
lola: 21226359 markings, 28239043 edges, 714224 markings/sec, 25 secs
lola: 24737586 markings, 32930801 edges, 702245 markings/sec, 30 secs
lola: 28178766 markings, 37517491 edges, 688236 markings/sec, 35 secs
lola: 31647538 markings, 42145568 edges, 693754 markings/sec, 40 secs
lola: 34794064 markings, 46340284 edges, 629305 markings/sec, 45 secs
lola: 38175352 markings, 50837138 edges, 676258 markings/sec, 50 secs
lola: 41566513 markings, 55366522 edges, 678232 markings/sec, 55 secs
lola: 45063673 markings, 60019459 edges, 699432 markings/sec, 60 secs
lola: 48236172 markings, 64253130 edges, 634500 markings/sec, 65 secs
lola: 51597254 markings, 68744678 edges, 672216 markings/sec, 70 secs
lola: 54948342 markings, 73198352 edges, 670218 markings/sec, 75 secs
lola: 58307781 markings, 77685310 edges, 671888 markings/sec, 80 secs
lola: 61708617 markings, 82211485 edges, 680167 markings/sec, 85 secs
lola: 65062063 markings, 86691577 edges, 670689 markings/sec, 90 secs
lola: 68392735 markings, 91137506 edges, 666134 markings/sec, 95 secs
lola: 71694908 markings, 95540690 edges, 660435 markings/sec, 100 secs
lola: 74905023 markings, 99805785 edges, 642023 markings/sec, 105 secs
lola: 78223408 markings, 104233286 edges, 663677 markings/sec, 110 secs
lola: 81592816 markings, 108737321 edges, 673882 markings/sec, 115 secs
lola: 84820041 markings, 113028083 edges, 645445 markings/sec, 120 secs
lola: 88236929 markings, 117586938 edges, 683378 markings/sec, 125 secs
lola: 91461215 markings, 121891813 edges, 644857 markings/sec, 130 secs
lola: 93071676 markings, 124031828 edges, 322092 markings/sec, 135 secs
lola: 95092920 markings, 126738544 edges, 404249 markings/sec, 140 secs
lola: 97062527 markings, 129362533 edges, 393921 markings/sec, 145 secs
lola: 97970029 markings, 130570036 edges, 181500 markings/sec, 150 secs
lola: 99930787 markings, 133180793 edges, 392152 markings/sec, 155 secs
lola: 101096088 markings, 134741773 edges, 233060 markings/sec, 160 secs
lola: 103681406 markings, 138181412 edges, 517064 markings/sec, 165 secs
lola: 105489731 markings, 140589739 edges, 361665 markings/sec, 170 secs
lola: 107537921 markings, 143329371 edges, 409638 markings/sec, 175 secs
lola: 109675201 markings, 146175208 edges, 427456 markings/sec, 180 secs
lola: 111506165 markings, 148606642 edges, 366193 markings/sec, 185 secs
lola: 113343787 markings, 151063034 edges, 367524 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p8 <= 1))) OR F ((X (F ((p8 + 1 <= p21))) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p8 <= 1)))
lola: processed formula length: 17
lola: 43 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: 250010 markings, 250012 edges
lola: ========================================
lola: subprocess 3 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p8 + 1 <= p21))) AND (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p8 + 1 <= p21))) AND (1 <= p8)))
lola: processed formula length: 43
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250003 markings, 250003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p19 + 1 <= p18) AND (3 <= p2)))) OR ((3 <= p2) OR (G ((1 <= p16)) AND F ((X (G (((p19 + 1 <= p18) AND (3 <= p2)))) OR (3 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2)
lola: processed formula length: 9
lola: 43 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 4 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p16))
lola: processed formula length: 14
lola: 43 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 5 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p19 + 1 <= p18) AND (3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p19 + 1 <= p18) AND (3 <= p2))))
lola: processed formula length: 40
lola: 43 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p17 <= 2)) AND (X ((p14 <= p0)) OR G ((3 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p17))
lola: processed formula length: 14
lola: 43 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 5 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p17 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p17 <= 2))
lola: processed formula length: 14
lola: 43 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: 300056 markings, 300066 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p8 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p8 <= p19))))
lola: processed formula length: 23
lola: 43 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: 449997 markings, 449997 edges
lola: ========================================
lola: subprocess 6 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p19 <= p8) U (p7 <= p4)) AND F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p19 <= p8) U (p7 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p19 <= p8) U (p7 <= p4))
lola: processed formula length: 26
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4))))
lola: processed formula length: 57
lola: 43 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: 4006641 markings, 5284923 edges, 801328 markings/sec, 0 secs
lola: 7746639 markings, 10269884 edges, 748000 markings/sec, 5 secs
lola: 11411676 markings, 15161753 edges, 733007 markings/sec, 10 secs
lola: 14855498 markings, 19755599 edges, 688764 markings/sec, 15 secs
lola: 18132762 markings, 24123964 edges, 655453 markings/sec, 20 secs
lola: 21528685 markings, 28642815 edges, 679185 markings/sec, 25 secs
lola: 25067623 markings, 33367790 edges, 707788 markings/sec, 30 secs
lola: 28552146 markings, 38002935 edges, 696905 markings/sec, 35 secs
lola: 32065927 markings, 42698575 edges, 702756 markings/sec, 40 secs
lola: 35529038 markings, 47318207 edges, 692622 markings/sec, 45 secs
lola: 38969125 markings, 51903302 edges, 688017 markings/sec, 50 secs
lola: 42516468 markings, 56624281 edges, 709469 markings/sec, 55 secs
lola: 46003640 markings, 61280004 edges, 697434 markings/sec, 60 secs
lola: 49455023 markings, 65882044 edges, 690277 markings/sec, 65 secs
lola: 52805458 markings, 70355810 edges, 670087 markings/sec, 70 secs
lola: 55922612 markings, 74508361 edges, 623431 markings/sec, 75 secs
lola: 59328910 markings, 79042775 edges, 681260 markings/sec, 80 secs
lola: 62617704 markings, 83425930 edges, 657759 markings/sec, 85 secs
lola: 65979311 markings, 87918311 edges, 672321 markings/sec, 90 secs
lola: 69230951 markings, 92245737 edges, 650328 markings/sec, 95 secs
lola: 72434480 markings, 96526000 edges, 640706 markings/sec, 100 secs
lola: 75717622 markings, 100900679 edges, 656628 markings/sec, 105 secs
lola: 79139658 markings, 105458699 edges, 684407 markings/sec, 110 secs
lola: 82575289 markings, 110037111 edges, 687126 markings/sec, 115 secs
lola: 85944768 markings, 114541298 edges, 673896 markings/sec, 120 secs
lola: 89377987 markings, 119116092 edges, 686644 markings/sec, 125 secs
lola: 92086683 markings, 122729112 edges, 541739 markings/sec, 130 secs
lola: 94570190 markings, 126033908 edges, 496701 markings/sec, 135 secs
lola: 97230168 markings, 129580818 edges, 531996 markings/sec, 140 secs
lola: 99482236 markings, 132582900 edges, 450414 markings/sec, 145 secs
lola: 100323425 markings, 133709136 edges, 168238 markings/sec, 150 secs
lola: 102314804 markings, 136365485 edges, 398276 markings/sec, 155 secs
lola: 103676789 markings, 138177480 edges, 272397 markings/sec, 160 secs
lola: 105067455 markings, 140025134 edges, 278133 markings/sec, 165 secs
lola: 106769498 markings, 142303181 edges, 340409 markings/sec, 170 secs
lola: 108721139 markings, 144905623 edges, 390328 markings/sec, 175 secs
lola: 109889588 markings, 146458283 edges, 233690 markings/sec, 180 secs
lola: 111858894 markings, 149087223 edges, 393861 markings/sec, 185 secs
lola: 113005192 markings, 150606659 edges, 229260 markings/sec, 190 secs
lola: 113287231 markings, 150987985 edges, 56408 markings/sec, 195 secs
lola: 113387613 markings, 151130287 edges, 20076 markings/sec, 200 secs
lola: 113388499 markings, 151131616 edges, 177 markings/sec, 205 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 7 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p3 <= p21) U (X (X (G ((p7 <= p8)))) OR (1 <= p14))) OR G ((3 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p3 <= p21) U (X (X (G ((p7 <= p8)))) OR (1 <= p14))) OR G ((3 <= p8)))))
lola: processed formula length: 81
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 27 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 19
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: 200010 markings, 200012 edges
lola: ========================================
lola: subprocess 8 will run for 726 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p6 + 1 <= p20) U X ((2 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p6 + 1 <= p20) U X ((2 <= p14))))
lola: processed formula length: 38
lola: 43 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 9 will run for 967 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p0 + 1 <= p4)) OR X (F ((p5 <= p15)))) U X (((p4 <= p17) OR (p5 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((p0 + 1 <= p4)) OR X (F ((p5 <= p15)))) U X (((p4 <= p17) OR (p5 <= p15))))
lola: processed formula length: 81
lola: 43 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= 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 ((p0 <= 0)))
lola: processed formula length: 17
lola: 43 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: subprocess 11 will run for 2902 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p3 + 1 <= p18) AND (F ((p9 + 1 <= p13)) OR G ((p3 + 1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((p3 + 1 <= p18) AND (F ((p9 + 1 <= p13)) OR G ((p3 + 1 <= p18)))))
lola: processed formula length: 70
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250006 markings, 250006 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((X ((p8 <= p9)) U (p12 <= p4)) OR (((p6 + 1 <= p7) OR (p13 + 1 <= p20)) U (p7 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X ((p8 <= p9)) U (p12 <= p4)) OR (((p6 + 1 <= p7) OR (p13 + 1 <= p20)) U (p7 <= p6)))))
lola: processed formula length: 96
lola: 43 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: 3238727 markings, 4258060 edges, 647745 markings/sec, 0 secs
lola: 6542668 markings, 8663938 edges, 660788 markings/sec, 5 secs
lola: 9757441 markings, 12957505 edges, 642955 markings/sec, 10 secs
lola: 12976073 markings, 17238980 edges, 643726 markings/sec, 15 secs
lola: 16149916 markings, 21474715 edges, 634769 markings/sec, 20 secs
lola: 19279908 markings, 25644671 edges, 625998 markings/sec, 25 secs
lola: 22456321 markings, 29884258 edges, 635283 markings/sec, 30 secs
lola: 25587763 markings, 34056391 edges, 626288 markings/sec, 35 secs
lola: 28629799 markings, 38119415 edges, 608407 markings/sec, 40 secs
lola: 31698360 markings, 42198571 edges, 613712 markings/sec, 45 secs
lola: 34689470 markings, 46189701 edges, 598222 markings/sec, 50 secs
lola: 37657787 markings, 50158038 edges, 593663 markings/sec, 55 secs
lola: 40732914 markings, 54248965 edges, 615025 markings/sec, 60 secs
lola: 43499058 markings, 57948154 edges, 553229 markings/sec, 65 secs
lola: 46494989 markings, 61942021 edges, 599186 markings/sec, 70 secs
lola: 49359431 markings, 65759760 edges, 572888 markings/sec, 75 secs
lola: 52321029 markings, 69706022 edges, 592320 markings/sec, 80 secs
lola: 55296592 markings, 73669337 edges, 595113 markings/sec, 85 secs
lola: 58242541 markings, 77592929 edges, 589190 markings/sec, 90 secs
lola: 61237732 markings, 81588139 edges, 599038 markings/sec, 95 secs
lola: 64225799 markings, 85576227 edges, 597613 markings/sec, 100 secs
lola: 66961555 markings, 89216665 edges, 547151 markings/sec, 105 secs
lola: 69966324 markings, 93223788 edges, 600954 markings/sec, 110 secs
lola: 72904795 markings, 97155281 edges, 587694 markings/sec, 115 secs
lola: 75830733 markings, 101045343 edges, 585188 markings/sec, 120 secs
lola: 78848519 markings, 105071992 edges, 603557 markings/sec, 125 secs
lola: 81858121 markings, 109086365 edges, 601920 markings/sec, 130 secs
lola: 84867147 markings, 113099873 edges, 601805 markings/sec, 135 secs
lola: 87866084 markings, 117098250 edges, 599787 markings/sec, 140 secs
lola: 90838261 markings, 121056485 edges, 594435 markings/sec, 145 secs
lola: 93214863 markings, 124221812 edges, 475320 markings/sec, 150 secs
lola: 94793146 markings, 126338774 edges, 315657 markings/sec, 155 secs
lola: 95986017 markings, 127928068 edges, 238574 markings/sec, 160 secs
lola: 97531699 markings, 129982348 edges, 309136 markings/sec, 165 secs
lola: 98903573 markings, 131804372 edges, 274375 markings/sec, 170 secs
lola: 100373916 markings, 133774585 edges, 294069 markings/sec, 175 secs
lola: 102026843 markings, 135977523 edges, 330585 markings/sec, 180 secs
lola: 103476032 markings, 137913016 edges, 289838 markings/sec, 185 secs
lola: 105483958 markings, 140584660 edges, 401585 markings/sec, 190 secs
lola: 107370933 markings, 143105327 edges, 377395 markings/sec, 195 secs
lola: 108511384 markings, 144615992 edges, 228090 markings/sec, 200 secs
lola: 110043971 markings, 146664857 edges, 306517 markings/sec, 205 secs
lola: 110226901 markings, 146914252 edges, 36586 markings/sec, 210 secs
lola: 112274736 markings, 149635983 edges, 409567 markings/sec, 215 secs
lola: 112958630 markings, 150559383 edges, 136779 markings/sec, 220 secs
lola: 113158175 markings, 150811131 edges, 39909 markings/sec, 225 secs
lola: 113158248 markings, 150811241 edges, 15 markings/sec, 230 secs
lola: 113287231 markings, 150987986 edges, 25797 markings/sec, 235 secs
lola: 113289254 markings, 150990008 edges, 405 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p16 <= p3)) U G ((G ((p1 <= p15)) AND F ((1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p16 <= p3)) U G ((G ((p1 <= p15)) AND F ((1 <= p10)))))))
lola: processed formula length: 68
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 3636541 markings, 4786548 edges, 727308 markings/sec, 0 secs
lola: 7124518 markings, 9436608 edges, 697595 markings/sec, 5 secs
lola: 10682091 markings, 14182098 edges, 711515 markings/sec, 10 secs
lola: 14054872 markings, 18681978 edges, 674556 markings/sec, 15 secs
lola: 17551576 markings, 23351583 edges, 699341 markings/sec, 20 secs
lola: 21076231 markings, 28038853 edges, 704931 markings/sec, 25 secs
lola: 24546269 markings, 32668829 edges, 694008 markings/sec, 30 secs
lola: 27824623 markings, 37036283 edges, 655671 markings/sec, 35 secs
lola: 31260531 markings, 41615064 edges, 687182 markings/sec, 40 secs
lola: 34089714 markings, 45389723 edges, 565837 markings/sec, 45 secs
lola: 37181010 markings, 49520647 edges, 618259 markings/sec, 50 secs
lola: 40332691 markings, 53723094 edges, 630336 markings/sec, 55 secs
lola: 43783556 markings, 58324312 edges, 690173 markings/sec, 60 secs
lola: 47208863 markings, 62887191 edges, 685061 markings/sec, 65 secs
lola: 50601527 markings, 67401534 edges, 678533 markings/sec, 70 secs
lola: 53872178 markings, 71772185 edges, 654130 markings/sec, 75 secs
lola: 57162323 markings, 76162330 edges, 658029 markings/sec, 80 secs
lola: 60557658 markings, 80685073 edges, 679067 markings/sec, 85 secs
lola: 63898013 markings, 85145528 edges, 668071 markings/sec, 90 secs
lola: 67019923 markings, 89303320 edges, 624382 markings/sec, 95 secs
lola: 70337437 markings, 93729513 edges, 663503 markings/sec, 100 secs
lola: 73546338 markings, 97996344 edges, 641780 markings/sec, 105 secs
lola: 76774543 markings, 102310022 edges, 645641 markings/sec, 110 secs
lola: 80216990 markings, 106898612 edges, 688489 markings/sec, 115 secs
lola: 83588399 markings, 111388406 edges, 674282 markings/sec, 120 secs
lola: 86947908 markings, 115869832 edges, 671902 markings/sec, 125 secs
lola: 90316705 markings, 120366711 edges, 673759 markings/sec, 130 secs
lola: 92574293 markings, 123374299 edges, 451518 markings/sec, 135 secs
lola: 94408875 markings, 125818537 edges, 366916 markings/sec, 140 secs
lola: 97202016 markings, 129551422 edges, 558628 markings/sec, 145 secs
lola: 97496567 markings, 129942881 edges, 58910 markings/sec, 150 secs
lola: 100117382 markings, 133424555 edges, 524163 markings/sec, 155 secs
lola: 100907814 markings, 134484364 edges, 158086 markings/sec, 160 secs
lola: 103077996 markings, 137378003 edges, 434036 markings/sec, 165 secs
lola: 104989950 markings, 139932475 edges, 382391 markings/sec, 170 secs
lola: 107055006 markings, 142680009 edges, 413011 markings/sec, 175 secs
lola: 108555811 markings, 144681181 edges, 300161 markings/sec, 180 secs
lola: 110242243 markings, 146935791 edges, 337286 markings/sec, 185 secs
lola: 111747974 markings, 148944353 edges, 301146 markings/sec, 190 secs
lola: 113245537 markings, 150940663 edges, 299513 markings/sec, 195 secs
lola: 113375571 markings, 151110710 edges, 26007 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((p19 <= p8) U (p7 <= p4)) AND F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p19 <= p8) U (p7 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p19 <= p8) U (p7 <= p4))
lola: processed formula length: 26
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p7 <= p4) OR (p19 <= p8))) AND X ((p7 <= p4))))
lola: processed formula length: 57
lola: 43 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: 3517947 markings, 4626885 edges, 703589 markings/sec, 0 secs
lola: 7232833 markings, 9582881 edges, 742977 markings/sec, 5 secs
lola: 10840759 markings, 14390831 edges, 721585 markings/sec, 10 secs
lola: 14391757 markings, 19137493 edges, 710200 markings/sec, 15 secs
lola: 17797412 markings, 23670942 edges, 681131 markings/sec, 20 secs
lola: 21352190 markings, 28403073 edges, 710956 markings/sec, 25 secs
lola: 24835366 markings, 33052802 edges, 696635 markings/sec, 30 secs
lola: 28260096 markings, 37614863 edges, 684946 markings/sec, 35 secs
lola: 31561301 markings, 42016637 edges, 660241 markings/sec, 40 secs
lola: 35010616 markings, 46615575 edges, 689863 markings/sec, 45 secs
lola: 38374429 markings, 51111260 edges, 672763 markings/sec, 50 secs
lola: 41864704 markings, 55764983 edges, 698055 markings/sec, 55 secs
lola: 45300347 markings, 60350069 edges, 687129 markings/sec, 60 secs
lola: 48749962 markings, 64949458 edges, 689923 markings/sec, 65 secs
lola: 52118673 markings, 69427489 edges, 673742 markings/sec, 70 secs
lola: 55468323 markings, 73901932 edges, 669930 markings/sec, 75 secs
lola: 58677788 markings, 78178179 edges, 641893 markings/sec, 80 secs
lola: 62015721 markings, 82622963 edges, 667587 markings/sec, 85 secs
lola: 65193715 markings, 86864922 edges, 635599 markings/sec, 90 secs
lola: 68492260 markings, 91262707 edges, 659709 markings/sec, 95 secs
lola: 71647313 markings, 95470255 edges, 631011 markings/sec, 100 secs
lola: 74904945 markings, 99806670 edges, 651526 markings/sec, 105 secs
lola: 78083687 markings, 104049751 edges, 635748 markings/sec, 110 secs
lola: 81449898 markings, 108549034 edges, 673242 markings/sec, 115 secs
lola: 84705534 markings, 112882455 edges, 651127 markings/sec, 120 secs
lola: 88048003 markings, 117346126 edges, 668494 markings/sec, 125 secs
lola: 91151102 markings, 121475743 edges, 620620 markings/sec, 130 secs
lola: 92685862 markings, 123529025 edges, 306952 markings/sec, 135 secs
lola: 94192549 markings, 125538771 edges, 301337 markings/sec, 140 secs
lola: 96257799 markings, 128290555 edges, 413050 markings/sec, 145 secs
lola: 97771573 markings, 130306384 edges, 302755 markings/sec, 150 secs
lola: 99661231 markings, 132815850 edges, 377932 markings/sec, 155 secs
lola: 100626210 markings, 134113309 edges, 192996 markings/sec, 160 secs
lola: 102988084 markings, 137256096 edges, 472375 markings/sec, 165 secs
lola: 104347828 markings, 139070699 edges, 271949 markings/sec, 170 secs
lola: 106106882 markings, 141409262 edges, 351811 markings/sec, 175 secs
lola: 107602945 markings, 143403661 edges, 299213 markings/sec, 180 secs
lola: 109175671 markings, 145512419 edges, 314545 markings/sec, 185 secs
lola: 111089650 markings, 148058366 edges, 382796 markings/sec, 190 secs
lola: 112366491 markings, 149767239 edges, 255368 markings/sec, 195 secs
lola: 113154162 markings, 150805111 edges, 157534 markings/sec, 200 secs
lola: 113311839 markings, 151016625 edges, 31535 markings/sec, 205 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 no no no no no no unknown no no yes
lola:
preliminary result: unknown unknown no no no no no no unknown no no yes
lola: memory consumption: 3516 KB
lola: time consumption: 1350 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="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 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 r170-smll-158987815400105"
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 ;