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-162038334700197.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-00040by00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K 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.2K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K 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.0K 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-00040by00020-00
FORMULA_NAME CloudOpsManagement-PT-00040by00020-01
FORMULA_NAME CloudOpsManagement-PT-00040by00020-02
FORMULA_NAME CloudOpsManagement-PT-00040by00020-03
FORMULA_NAME CloudOpsManagement-PT-00040by00020-04
FORMULA_NAME CloudOpsManagement-PT-00040by00020-05
FORMULA_NAME CloudOpsManagement-PT-00040by00020-06
FORMULA_NAME CloudOpsManagement-PT-00040by00020-07
FORMULA_NAME CloudOpsManagement-PT-00040by00020-08
FORMULA_NAME CloudOpsManagement-PT-00040by00020-09
FORMULA_NAME CloudOpsManagement-PT-00040by00020-10
FORMULA_NAME CloudOpsManagement-PT-00040by00020-11
FORMULA_NAME CloudOpsManagement-PT-00040by00020-12
FORMULA_NAME CloudOpsManagement-PT-00040by00020-13
FORMULA_NAME CloudOpsManagement-PT-00040by00020-14
FORMULA_NAME CloudOpsManagement-PT-00040by00020-15

=== Now, execution of the tool begins

BK_START 1620902161307

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:36:03] [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:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:36:03] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 10:36:03] [INFO ] Transformed 27 places.
[2021-05-13 10:36:03] [INFO ] Transformed 29 transitions.
[2021-05-13 10:36:03] [INFO ] Parsed PT model containing 27 places and 29 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100028 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=1887 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:36:03] [INFO ] Computed 11 place invariants in 16 ms
[2021-05-13 10:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 37 ms returned sat
[2021-05-13 10:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:03] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-13 10:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:36:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:36:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2021-05-13 10:36:04] [INFO ] Added : 25 causal constraints over 5 iterations in 68 ms. Result :sat
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-13 10:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:36:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:04] [INFO ] Added : 22 causal constraints over 5 iterations in 41 ms. Result :sat
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-13 10:36:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:36:04] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 48 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-13 10:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:36:04] [INFO ] Added : 25 causal constraints over 5 iterations in 144 ms. Result :sat
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:04] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 14 ms.
[2021-05-13 10:36:05] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:36:05] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:05] [INFO ] Added : 17 causal constraints over 5 iterations in 63 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:36:05] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned unsat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:05] [INFO ] Added : 25 causal constraints over 6 iterations in 35 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:36:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:36:05] [INFO ] Added : 25 causal constraints over 6 iterations in 131 ms. Result :sat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:36:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:36:06] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-13 10:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 26 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 33 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:36:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-13 10:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:36:06] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:36:06] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-13 10:36:06] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 10:36:06] [INFO ] Flatten gal took : 24 ms
FORMULA CloudOpsManagement-PT-00040by00020-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00040by00020-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00040by00020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00040by00020-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00040by00020-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:36:06] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:36:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 10:36:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00040by00020 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00040by00020-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00040by00020-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2836
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00040by00020

{
"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:36:07 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((1 <= p26))))",
"processed_size": 22,
"rewrites": 54
},
"result":
{
"edges": 2693101,
"markings": 1737824,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"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 ((p11 <= p6))))",
"processed_size": 23,
"rewrites": 54
},
"result":
{
"edges": 20,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((p15 + 1 <= p11)))",
"processed_size": 24,
"rewrites": 54
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p24 <= p20))",
"processed_size": 16,
"rewrites": 54
},
"result":
{
"edges": 520,
"markings": 411,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "(X (((2 <= p14) OR (p16 <= p8))) U (1 <= p15))",
"processed_size": 47,
"rewrites": 54
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((p14 <= 0)) AND (X ((p7 <= 2)) AND (3 <= p7))))",
"processed_size": 54,
"rewrites": 54
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"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 ((F ((p16 <= p24)) AND F ((p24 + 1 <= p16)))))",
"processed_size": 51,
"rewrites": 54
},
"result":
{
"edges": 128,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p9)))",
"processed_size": 17,
"rewrites": 54
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((G ((p10 + 1 <= p26)) AND (p7 <= 1)) OR X (F ((p8 <= 2))))))",
"processed_size": 67,
"rewrites": 54
},
"result":
{
"edges": 2703535,
"markings": 1744550,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1605
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F ((p18 <= p2)) AND (2 <= p1))))",
"processed_size": 39,
"rewrites": 54
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3210
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3210
},
"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": 2,
"visible_transitions": 0
},
"processed": "((p10 + 1 <= p3) U (p3 <= p10))",
"processed_size": 31,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 10,
"type": "boolean"
}
},

{
"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": 2,
"visible_transitions": 0
},
"processed": "((p10 + 1 <= p3) U (p3 <= p10))",
"processed_size": 31,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p3 <= p10) OR (G ((p26 <= p13)) AND F ((p3 <= p10)))) U (p18 + 1 <= p5))",
"processed_size": 75,
"rewrites": 54
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3676,
"runtime": 733.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((F(**) AND *))) : (((** OR (G(**) AND F(**))) U **) AND (** U **)) : X(X(G(**))) : X(X(F(**))) : X(X(*)) : ((X(**) U **) OR G(**)) : X((F(*) AND (X(**) AND **))) : (F(*) OR X(X(F(*)))) : (F(G((F(**) AND F(*)))) OR X(F(**))) : F(G(*)) : G(F(((G(*) AND *) OR X(F(*)))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no yes no no no no no unknown no ",
"value": "no no no yes no no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: NOT(X (F (G ((NOT(((p15 <= p21) U F ((p18 <= p2)))) OR (p1 <= 1)))))) : (((G ((p26 <= p13)) U (p3 <= p10)) U (p18 + 1 <= p5)) AND ((p10 + 1 <= p3) U (p3 <= p10))) : X (X (G ((1 <= p26)))) : F (X (X ((p11 <= p6)))) : X ((NOT(X ((p11 <= p15))) OR (((p15 <= p8) U (1 <= 0)) AND F ((p0 <= p25))))) : ((X (((2 <= p14) OR (p16 <= p8))) U (1 <= p15)) OR G ((p24 <= p20))) : X ((((X (((3 <= p1) AND (3 <= p7))) U NOT(G ((1 <= p14)))) AND X ((p7 <= 2))) AND (3 <= p7))) : (NOT(G ((1 <= p0))) OR NOT(G (X (X ((1 <= p0)))))) : (F (X (G ((F ((p16 <= p24)) AND NOT(G ((p16 <= p24))))))) OR F (X ((1 <= p9)))) : F (NOT(F (X ((2 <= p4))))) : X (NOT(G (F (G (((F ((p26 <= p10)) OR (2 <= p7)) AND X (G ((3 <= p8)))))))))
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((1 <= p26))))
lola: processed formula length: 22
lola: 54 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: 1737824 markings, 2693101 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p11 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p11 <= p6))))
lola: processed formula length: 23
lola: 54 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p15 + 1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p15 + 1 <= p11)))
lola: processed formula length: 24
lola: 54 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((2 <= p14) OR (p16 <= p8))) U (1 <= p15)) OR G ((p24 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p24 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p24 <= p20))
lola: processed formula length: 16
lola: 54 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: 411 markings, 520 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((2 <= p14) OR (p16 <= p8))) U (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((2 <= p14) OR (p16 <= p8))) U (1 <= p15))
lola: processed formula length: 47
lola: 54 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: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p14 <= 0)) AND (X ((p7 <= 2)) AND (3 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p14 <= 0)) AND (X ((p7 <= 2)) AND (3 <= p7))))
lola: processed formula length: 54
lola: 54 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p0 <= 0)) OR X (X (F ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 81 markings, 81 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p0 <= 0))))
lola: processed formula length: 21
lola: 54 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: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((p16 <= p24)) AND F ((p24 + 1 <= p16))))) OR X (F ((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p16 <= p24)) AND F ((p24 + 1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p16 <= p24)) AND F ((p24 + 1 <= p16)))))
lola: processed formula length: 51
lola: 54 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: 127 markings, 128 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p9)))
lola: processed formula length: 17
lola: 54 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G ((p10 + 1 <= p26)) AND (p7 <= 1)) OR X (F ((p8 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G ((p10 + 1 <= p26)) AND (p7 <= 1)) OR X (F ((p8 <= 2))))))
lola: processed formula length: 67
lola: 54 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: 1744550 markings, 2703535 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 <= 1)))
lola: processed formula length: 17
lola: 54 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: 3016932 markings, 9482255 edges, 603386 markings/sec, 0 secs
lola: 5867468 markings, 18627030 edges, 570107 markings/sec, 5 secs
lola: 8372685 markings, 27138480 edges, 501043 markings/sec, 10 secs
lola: 9873449 markings, 35158417 edges, 300153 markings/sec, 15 secs
lola: 12311542 markings, 44463261 edges, 487619 markings/sec, 20 secs
lola: 15132455 markings, 53631398 edges, 564183 markings/sec, 25 secs
lola: 17181222 markings, 62434523 edges, 409753 markings/sec, 30 secs
lola: 19254817 markings, 71966100 edges, 414719 markings/sec, 35 secs
lola: 22137208 markings, 81224321 edges, 576478 markings/sec, 40 secs
lola: 24561451 markings, 89951421 edges, 484849 markings/sec, 45 secs
lola: 26232868 markings, 98937503 edges, 334283 markings/sec, 50 secs
lola: 28668893 markings, 108076166 edges, 487205 markings/sec, 55 secs
lola: 30393425 markings, 117253440 edges, 344906 markings/sec, 60 secs
lola: 33094688 markings, 126771452 edges, 540253 markings/sec, 65 secs
lola: 35816567 markings, 135675564 edges, 544376 markings/sec, 70 secs
lola: 37673582 markings, 144361350 edges, 371403 markings/sec, 75 secs
lola: 39758035 markings, 153641164 edges, 416891 markings/sec, 80 secs
lola: 41729306 markings, 162295397 edges, 394254 markings/sec, 85 secs
lola: 43886533 markings, 171836949 edges, 431445 markings/sec, 90 secs
lola: 46729015 markings, 180975813 edges, 568496 markings/sec, 95 secs
lola: 49068939 markings, 189542015 edges, 467985 markings/sec, 100 secs
lola: 50726964 markings, 198447613 edges, 331605 markings/sec, 105 secs
lola: 53099829 markings, 207382852 edges, 474573 markings/sec, 110 secs
lola: 54701409 markings, 215892550 edges, 320316 markings/sec, 115 secs
lola: 56961432 markings, 224736846 edges, 452005 markings/sec, 120 secs
lola: 58725777 markings, 233527853 edges, 352869 markings/sec, 125 secs
lola: 61237468 markings, 243140207 edges, 502338 markings/sec, 130 secs
lola: 63975972 markings, 252035939 edges, 547701 markings/sec, 135 secs
lola: 66000306 markings, 260563032 edges, 404867 markings/sec, 140 secs
lola: 67801585 markings, 269642875 edges, 360256 markings/sec, 145 secs
lola: 70020501 markings, 278336433 edges, 443783 markings/sec, 150 secs
lola: 71722214 markings, 287397167 edges, 340343 markings/sec, 155 secs
lola: 74043232 markings, 296123257 edges, 464204 markings/sec, 160 secs
lola: 75736314 markings, 305174076 edges, 338616 markings/sec, 165 secs
lola: 78621833 markings, 314560664 edges, 577104 markings/sec, 170 secs
lola: 81279991 markings, 323308092 edges, 531632 markings/sec, 175 secs
lola: 83005751 markings, 331960951 edges, 345152 markings/sec, 180 secs
lola: 85143613 markings, 341013637 edges, 427572 markings/sec, 185 secs
lola: 87022264 markings, 349667102 edges, 375730 markings/sec, 190 secs
lola: 89023917 markings, 358803330 edges, 400331 markings/sec, 195 secs
lola: 91038701 markings, 367408667 edges, 402957 markings/sec, 200 secs
lola: 92867703 markings, 376494925 edges, 365800 markings/sec, 205 secs
lola: 95118776 markings, 385352383 edges, 450215 markings/sec, 210 secs
lola: 97129703 markings, 394865404 edges, 402185 markings/sec, 215 secs
lola: 99984874 markings, 404029684 edges, 571034 markings/sec, 220 secs
lola: 102435075 markings, 412585875 edges, 490040 markings/sec, 225 secs
lola: 104066959 markings, 421312312 edges, 326377 markings/sec, 230 secs
lola: 106396906 markings, 430186663 edges, 465989 markings/sec, 235 secs
lola: 108067735 markings, 438914157 edges, 334166 markings/sec, 240 secs
lola: 110262526 markings, 447917435 edges, 438958 markings/sec, 245 secs
lola: 112054698 markings, 456469908 edges, 358434 markings/sec, 250 secs
lola: 114081553 markings, 465492876 edges, 405371 markings/sec, 255 secs
lola: 116031179 markings, 474006415 edges, 389925 markings/sec, 260 secs
lola: 118164870 markings, 483205800 edges, 426738 markings/sec, 265 secs
lola: 120355984 markings, 490258382 edges, 438223 markings/sec, 270 secs
lola: 122386612 markings, 496913779 edges, 406126 markings/sec, 275 secs
lola: 123850775 markings, 503707765 edges, 292833 markings/sec, 280 secs
lola: 125136585 markings, 510786085 edges, 257162 markings/sec, 285 secs
lola: 127138732 markings, 517650808 edges, 400429 markings/sec, 290 secs
lola: 128458973 markings, 524598203 edges, 264048 markings/sec, 295 secs
lola: 130017542 markings, 532043370 edges, 311714 markings/sec, 300 secs
lola: 131822807 markings, 538876226 edges, 361053 markings/sec, 305 secs
lola: 133116224 markings, 545733394 edges, 258683 markings/sec, 310 secs
lola: 134794199 markings, 552822135 edges, 335595 markings/sec, 315 secs
lola: 136387203 markings, 559527886 edges, 318601 markings/sec, 320 secs
lola: 137527672 markings, 565571317 edges, 228094 markings/sec, 325 secs
lola: 139285972 markings, 572643031 edges, 351660 markings/sec, 330 secs
lola: 140813598 markings, 579307349 edges, 305525 markings/sec, 335 secs
lola: 142253153 markings, 586737510 edges, 287911 markings/sec, 340 secs
lola: 144741947 markings, 594568202 edges, 497759 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p18 <= p2)) AND (2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p18 <= p2)) AND (2 <= p1))))
lola: processed formula length: 39
lola: 54 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 10 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= p10) OR (G ((p26 <= p13)) AND F ((p3 <= p10)))) U (p18 + 1 <= p5)) AND ((p10 + 1 <= p3) U (p3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 + 1 <= p3) U (p3 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p10 + 1 <= p3) U (p3 <= p10))
lola: processed formula length: 31
lola: 54 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: 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: F (G ((p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 <= 1)))
lola: processed formula length: 17
lola: 54 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: 2994189 markings, 9410617 edges, 598838 markings/sec, 0 secs
lola: 5946937 markings, 18875373 edges, 590550 markings/sec, 5 secs
lola: 8517916 markings, 27886151 edges, 514196 markings/sec, 10 secs
lola: 10200937 markings, 36937562 edges, 336604 markings/sec, 15 secs
lola: 12927028 markings, 46439014 edges, 545218 markings/sec, 20 secs
lola: 15425005 markings, 54608412 edges, 499595 markings/sec, 25 secs
lola: 17156806 markings, 62312148 edges, 346360 markings/sec, 30 secs
lola: 18652796 markings, 70182230 edges, 299198 markings/sec, 35 secs
lola: 21386831 markings, 78773860 edges, 546807 markings/sec, 40 secs
lola: 23721805 markings, 86448230 edges, 466995 markings/sec, 45 secs
lola: 25274514 markings, 93759297 edges, 310542 markings/sec, 50 secs
lola: 26785723 markings, 101541081 edges, 302242 markings/sec, 55 secs
lola: 28928905 markings, 109437964 edges, 428636 markings/sec, 60 secs
lola: 30412216 markings, 117361179 edges, 296662 markings/sec, 65 secs
lola: 32912244 markings, 126182359 edges, 500006 markings/sec, 70 secs
lola: 35312818 markings, 133999291 edges, 480115 markings/sec, 75 secs
lola: 37070073 markings, 141140843 edges, 351451 markings/sec, 80 secs
lola: 38476852 markings, 148701264 edges, 281356 markings/sec, 85 secs
lola: 40659296 markings, 156682616 edges, 436489 markings/sec, 90 secs
lola: 42096713 markings, 164239657 edges, 287483 markings/sec, 95 secs
lola: 44204058 markings, 172840859 edges, 421469 markings/sec, 100 secs
lola: 46828272 markings, 181298994 edges, 524843 markings/sec, 105 secs
lola: 48888818 markings, 188602044 edges, 412109 markings/sec, 110 secs
lola: 50270711 markings, 195970444 edges, 276379 markings/sec, 115 secs
lola: 52120230 markings, 203741854 edges, 369904 markings/sec, 120 secs
lola: 53801136 markings, 211076365 edges, 336181 markings/sec, 125 secs
lola: 55296590 markings, 219040788 edges, 299091 markings/sec, 130 secs
lola: 57513870 markings, 227107461 edges, 443456 markings/sec, 135 secs
lola: 59000055 markings, 234972025 edges, 297237 markings/sec, 140 secs
lola: 61447997 markings, 243817740 edges, 489588 markings/sec, 145 secs
lola: 64014426 markings, 252165280 edges, 513286 markings/sec, 150 secs
lola: 65851299 markings, 259778913 edges, 367375 markings/sec, 155 secs
lola: 67282873 markings, 267552421 edges, 286315 markings/sec, 160 secs
lola: 69478005 markings, 275485465 edges, 439026 markings/sec, 165 secs
lola: 71040646 markings, 283761722 edges, 312528 markings/sec, 170 secs
lola: 73199078 markings, 292485165 edges, 431686 markings/sec, 175 secs
lola: 74885391 markings, 300567048 edges, 337263 markings/sec, 180 secs
lola: 77058538 markings, 309559288 edges, 434629 markings/sec, 185 secs
lola: 79792738 markings, 318370394 edges, 546840 markings/sec, 190 secs
lola: 82038738 markings, 326791864 edges, 449200 markings/sec, 195 secs
lola: 83676892 markings, 335630073 edges, 327631 markings/sec, 200 secs
lola: 86039119 markings, 344461187 edges, 472445 markings/sec, 205 secs
lola: 87696519 markings, 353295738 edges, 331480 markings/sec, 210 secs
lola: 90027082 markings, 362188466 edges, 466113 markings/sec, 215 secs
lola: 91702475 markings, 370936314 edges, 335079 markings/sec, 220 secs
lola: 93959461 markings, 380107222 edges, 451397 markings/sec, 225 secs
lola: 95795043 markings, 388938249 edges, 367116 markings/sec, 230 secs
lola: 98266915 markings, 398480040 edges, 494374 markings/sec, 235 secs
lola: 100993249 markings, 407320740 edges, 545267 markings/sec, 240 secs
lola: 102966655 markings, 415398336 edges, 394681 markings/sec, 245 secs
lola: 104580721 markings, 424095693 edges, 322813 markings/sec, 250 secs
lola: 106876881 markings, 432587995 edges, 459232 markings/sec, 255 secs
lola: 108495313 markings, 441266761 edges, 323686 markings/sec, 260 secs
lola: 110792669 markings, 449849463 edges, 459471 markings/sec, 265 secs
lola: 112380372 markings, 458212119 edges, 317541 markings/sec, 270 secs
lola: 114514255 markings, 466961466 edges, 426777 markings/sec, 275 secs
lola: 116266281 markings, 475258089 edges, 350405 markings/sec, 280 secs
lola: 118582037 markings, 484532932 edges, 463151 markings/sec, 285 secs
lola: 120759907 markings, 491555456 edges, 435574 markings/sec, 290 secs
lola: 122866258 markings, 498541745 edges, 421270 markings/sec, 295 secs
lola: 123979935 markings, 504416557 edges, 222735 markings/sec, 300 secs
lola: 125405694 markings, 511850644 edges, 285152 markings/sec, 305 secs
lola: 127329549 markings, 518612929 edges, 384771 markings/sec, 310 secs
lola: 128641585 markings, 525583158 edges, 262407 markings/sec, 315 secs
lola: 130292248 markings, 532951928 edges, 330133 markings/sec, 320 secs
lola: 132004432 markings, 539847745 edges, 342437 markings/sec, 325 secs
lola: 133321649 markings, 546857657 edges, 263443 markings/sec, 330 secs
lola: 135144338 markings, 554013169 edges, 364538 markings/sec, 335 secs
lola: 136620790 markings, 560760999 edges, 295290 markings/sec, 340 secs
lola: 138008424 markings, 567966685 edges, 277527 markings/sec, 345 secs
lola: 139901517 markings, 574740202 edges, 378619 markings/sec, 350 secs
lola: 141409747 markings, 582428015 edges, 301646 markings/sec, 355 secs
lola: 143552057 markings, 590755539 edges, 428462 markings/sec, 360 secs
lola: 145821228 markings, 598072426 edges, 453834 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((p3 <= p10) OR (G ((p26 <= p13)) AND F ((p3 <= p10)))) U (p18 + 1 <= p5)) AND ((p10 + 1 <= p3) U (p3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p10 + 1 <= p3) U (p3 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p10 + 1 <= p3) U (p3 <= p10))
lola: processed formula length: 31
lola: 54 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: (((p3 <= p10) OR (G ((p26 <= p13)) AND F ((p3 <= p10)))) U (p18 + 1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p3 <= p10) OR (G ((p26 <= p13)) AND F ((p3 <= p10)))) U (p18 + 1 <= p5))
lola: processed formula length: 75
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no unknown no
lola:
preliminary result: no no no yes no no no no no unknown no
lola: ========================================
lola: memory consumption: 3676 KB
lola: time consumption: 733 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-00040by00020"
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-00040by00020, 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-162038334700197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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