Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334700209.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudOpsManagement-PT-00320by00160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620902826322

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:47:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:47:08] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 10:47:08] [INFO ] Transformed 27 places.
[2021-05-13 10:47:08] [INFO ] Transformed 29 transitions.
[2021-05-13 10:47:08] [INFO ] Parsed PT model containing 27 places and 29 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100171 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=2329 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:47:08] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 10:47:08] [INFO ] Added : 22 causal constraints over 5 iterations in 44 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:47:08] [INFO ] Added : 17 causal constraints over 5 iterations in 16 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:08] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 19 ms.
[2021-05-13 10:47:09] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 48 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 5 iterations in 13 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 67 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:09] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:09] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 10:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:47:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:47:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 10:47:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:47:10] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:47:10] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-13 10:47:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 10:47:10] [INFO ] Flatten gal took : 39 ms
FORMULA CloudOpsManagement-PT-00320by00160-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:47:10] [INFO ] Flatten gal took : 4 ms
[2021-05-13 10:47:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-13 10:47:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00320by00160 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00320by00160-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3349
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00320by00160

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X (F ((p20 + 1 <= p6))) OR (p9 <= 0)) AND X ((X ((p15 + 1 <= p23)) R F ((1 <= p9))))))",
"processed_size": 91,
"rewrites": 81
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p17 <= p12) AND (p17 <= p12))))",
"processed_size": 39,
"rewrites": 81
},
"result":
{
"edges": 186,
"markings": 176,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 691
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p20 <= p8)))",
"processed_size": 19,
"rewrites": 81
},
"result":
{
"edges": 13940,
"markings": 8405,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 864
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p11 <= p6) U (3 <= p7))",
"processed_size": 25,
"rewrites": 81
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3458
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((1 <= p26) AND (p4 <= p7)))",
"processed_size": 31,
"rewrites": 81
},
"result":
{
"edges": 2725,
"markings": 1444,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

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

{
"child":
[

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

{
"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 ((p20 <= 2)))",
"processed_size": 18,
"rewrites": 81
},
"result":
{
"edges": 3635,
"markings": 3017,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3596,
"runtime": 221.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((X(G(*)) AND (F(*) OR **))))) : X((X(X(F(**))) AND (G(**) AND **))) : (G(**) AND **) : (** U **) : X(F(((X(*) R *) OR **))) : ((** U G(**)) U (X(*) AND **)) : (** U (G((F(G(**)) AND (** AND **))) OR G(**))) : (X(F(*)) R (X(F(*)) OR *)) : F(G(**)) : (F(G(*)) AND **) : X(((X(F(*)) OR *) AND X((X(*) R F(*))))) : F(G((** AND *))) : G(F((G(*) OR (G((X(*) AND *)) AND *))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no unknown ",
"value": "no no no no no no no no no no no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X (G (X ((NOT(X (F ((p18 <= p2)))) AND (NOT(G ((p7 <= p8))) OR (p8 + 1 <= p7))))))) : X (((F (X (X ((p18 + 1 <= p21)))) AND G ((p26 <= p13))) AND (p21 <= p18))) : (G (((1 <= p26) AND (p4 <= p7))) AND (p4 <= p7)) : ((p11 <= p6) U (3 <= p7)) : F (X ((NOT((X (((p15 + 1 <= p11) AND (p15 <= p8))) U (2 <= p25))) OR (p25 <= 1)))) : (((p24 <= p20) U G ((1 <= p15))) U (NOT(X ((p24 <= p20))) AND (p8 + 1 <= p16))) : ((p5 <= p3) U (G (((X (F (G ((p26 <= p3)))) AND (p26 <= p3)) AND (p15 <= p26))) OR G ((p5 <= p3)))) : NOT((G (X ((p3 <= p21))) U (X (G ((p3 <= p21))) AND (p3 <= p21)))) : ((0 <= 0) U X (((p15 <= 0) U F ((X ((p6 <= p2)) U G ((p20 <= p8))))))) : (X (NOT(G (F ((3 <= p20))))) AND (p24 <= p3)) : NOT(X (((X (G ((p6 <= p20))) AND (1 <= p9)) OR X ((X ((p23 <= p15)) U G ((p9 <= 0))))))) : F (X (X (X (G ((G ((p17 <= p12)) AND NOT(F ((p12 + 1 <= p17))))))))) : F (G (NOT(X (G ((F ((X ((p26 <= p10)) OR (p26 <= p10))) U (3 <= p8)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (G ((p2 + 1 <= p18))) AND (F ((p8 + 1 <= p7)) OR (p8 + 1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (G ((p2 + 1 <= p18))) AND (F ((p8 + 1 <= p7)) OR (p8 + 1 <= p7))))))
lola: processed formula length: 80
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (F ((p18 + 1 <= p21)))) AND (G ((p26 <= p13)) AND (p21 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (F ((p18 + 1 <= p21)))) AND (G ((p26 <= p13)) AND (p21 <= p18))))
lola: processed formula length: 74
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 164 markings, 164 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((X (((p11 <= p15) OR (p8 + 1 <= p15))) R (p25 <= 1)) OR (p25 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((X (((p11 <= p15) OR (p8 + 1 <= p15))) R (p25 <= 1)) OR (p25 <= 1))))
lola: processed formula length: 77
lola: 81 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p24 <= p20) U G ((1 <= p15))) U (X ((p20 + 1 <= p24)) AND (p8 + 1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p24 <= p20) U G ((1 <= p15))) U (X ((p20 + 1 <= p24)) AND (p8 + 1 <= p16)))
lola: processed formula length: 78
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 166 markings, 167 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p21 + 1 <= p3))) R (X (F ((p21 + 1 <= p3))) OR (p21 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((p21 + 1 <= p3))) R (X (F ((p21 + 1 <= p3))) OR (p21 + 1 <= p3)))
lola: processed formula length: 72
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F ((p20 + 1 <= p6))) OR (p9 <= 0)) AND X ((X ((p15 + 1 <= p23)) R F ((1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F ((p20 + 1 <= p6))) OR (p9 <= 0)) AND X ((X ((p15 + 1 <= p23)) R F ((1 <= p9))))))
lola: processed formula length: 91
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p8 <= 2)) OR (G ((X ((p10 + 1 <= p26)) AND (p10 + 1 <= p26))) AND (p8 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p8 <= 2)) OR (G ((X ((p10 + 1 <= p26)) AND (p10 + 1 <= p26))) AND (p8 <= 2)))))
lola: processed formula length: 90
lola: 81 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: 5038064 markings, 7605944 edges, 1007613 markings/sec, 0 secs
lola: 10283103 markings, 15506429 edges, 1049008 markings/sec, 5 secs
lola: 15378593 markings, 23181729 edges, 1019098 markings/sec, 10 secs
lola: 20423092 markings, 30779887 edges, 1008900 markings/sec, 15 secs
lola: 25416869 markings, 38301804 edges, 998755 markings/sec, 20 secs
lola: 30385098 markings, 45785306 edges, 993646 markings/sec, 25 secs
lola: 35385223 markings, 53316544 edges, 1000025 markings/sec, 30 secs
lola: 40335115 markings, 60772429 edges, 989978 markings/sec, 35 secs
lola: 45228153 markings, 68142522 edges, 978608 markings/sec, 40 secs
lola: 50149876 markings, 75555840 edges, 984345 markings/sec, 45 secs
lola: 54898546 markings, 82708402 edges, 949734 markings/sec, 50 secs
lola: 59930587 markings, 90287992 edges, 1006408 markings/sec, 55 secs
lola: 64780035 markings, 97592413 edges, 969890 markings/sec, 60 secs
lola: 69673303 markings, 104963033 edges, 978654 markings/sec, 65 secs
lola: 74616684 markings, 112408862 edges, 988676 markings/sec, 70 secs
lola: 79512580 markings, 119783530 edges, 979179 markings/sec, 75 secs
lola: 84062807 markings, 126638263 edges, 910045 markings/sec, 80 secs
lola: 88469129 markings, 133275777 edges, 881264 markings/sec, 85 secs
lola: 92708769 markings, 139661619 edges, 847928 markings/sec, 90 secs
lola: 96962349 markings, 146067913 edges, 850716 markings/sec, 95 secs
lola: 101047600 markings, 152221238 edges, 817050 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p17 <= p12) AND (p17 <= p12))))
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 (((p17 <= p12) AND (p17 <= p12))))
lola: processed formula length: 39
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 176 markings, 186 edges
lola: ========================================
lola: subprocess 8 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p20 <= p8)))
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 ((p20 <= p8)))
lola: processed formula length: 19
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 8405 markings, 13940 edges
lola: ========================================
lola: subprocess 9 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11 <= p6) U (3 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p11 <= p6) U (3 <= p7))
lola: processed formula length: 25
lola: 81 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 10 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= p3) U (G ((F (G ((p26 <= p3))) AND ((p26 <= p3) AND (p15 <= p26)))) OR G ((p5 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p5 <= p3) U (G ((F (G ((p26 <= p3))) AND ((p26 <= p3) AND (p15 <= p26)))) OR G ((p5 <= p3))))
lola: processed formula length: 95
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 12
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: 329 markings, 333 edges
lola: ========================================
lola: subprocess 11 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p26) AND (p4 <= p7))) AND (p4 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p4 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 <= p7)
lola: processed formula length: 10
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p26) AND (p4 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p26) AND (p4 <= p7)))
lola: processed formula length: 31
lola: 81 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: 1444 markings, 2725 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p20 <= 2))) AND (p24 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p24 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 <= p3)
lola: processed formula length: 11
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p8 <= 2)) OR (G ((X ((p10 + 1 <= p26)) AND (p10 + 1 <= p26))) AND (p8 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p8 <= 2)) OR (G ((X ((p10 + 1 <= p26)) AND (p10 + 1 <= p26))) AND (p8 <= 2)))))
lola: processed formula length: 90
lola: 81 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: 5083106 markings, 7673659 edges, 1016621 markings/sec, 0 secs
lola: 10415613 markings, 15706184 edges, 1066501 markings/sec, 5 secs
lola: 15548945 markings, 23438168 edges, 1026666 markings/sec, 10 secs
lola: 20714036 markings, 31218080 edges, 1033018 markings/sec, 15 secs
lola: 25826418 markings, 38918667 edges, 1022476 markings/sec, 20 secs
lola: 30885819 markings, 46539344 edges, 1011880 markings/sec, 25 secs
lola: 35924631 markings, 54129025 edges, 1007762 markings/sec, 30 secs
lola: 40938665 markings, 61681332 edges, 1002807 markings/sec, 35 secs
lola: 45939202 markings, 69213557 edges, 1000107 markings/sec, 40 secs
lola: 50790313 markings, 76520382 edges, 970222 markings/sec, 45 secs
lola: 55560454 markings, 83705547 edges, 954028 markings/sec, 50 secs
lola: 60493263 markings, 91135566 edges, 986562 markings/sec, 55 secs
lola: 65470993 markings, 98633315 edges, 995546 markings/sec, 60 secs
lola: 70351533 markings, 105984466 edges, 976108 markings/sec, 65 secs
lola: 75198083 markings, 113284729 edges, 969310 markings/sec, 70 secs
lola: 80144215 markings, 120734851 edges, 989226 markings/sec, 75 secs
lola: 84612226 markings, 127464887 edges, 893602 markings/sec, 80 secs
lola: 88812712 markings, 133791786 edges, 840097 markings/sec, 85 secs
lola: 92952722 markings, 140030386 edges, 828002 markings/sec, 90 secs
lola: 97163946 markings, 146370785 edges, 842245 markings/sec, 95 secs
lola: 101287327 markings, 152581610 edges, 824676 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((p20 <= 2))) AND (p24 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p24 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 <= p3)
lola: processed formula length: 11
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p20 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p20 <= 2)))
lola: processed formula length: 18
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 3017 markings, 3635 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no unknown
lola:
preliminary result: no no no no no no no no no no no no unknown
lola: memory consumption: 3596 KB
lola: time consumption: 221 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="CloudOpsManagement-PT-00320by00160"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CloudOpsManagement-PT-00320by00160, 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 r056-oct2-162038334700209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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