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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K 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.4K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.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-05120by02560-00
FORMULA_NAME CloudOpsManagement-PT-05120by02560-01
FORMULA_NAME CloudOpsManagement-PT-05120by02560-02
FORMULA_NAME CloudOpsManagement-PT-05120by02560-03
FORMULA_NAME CloudOpsManagement-PT-05120by02560-04
FORMULA_NAME CloudOpsManagement-PT-05120by02560-05
FORMULA_NAME CloudOpsManagement-PT-05120by02560-06
FORMULA_NAME CloudOpsManagement-PT-05120by02560-07
FORMULA_NAME CloudOpsManagement-PT-05120by02560-08
FORMULA_NAME CloudOpsManagement-PT-05120by02560-09
FORMULA_NAME CloudOpsManagement-PT-05120by02560-10
FORMULA_NAME CloudOpsManagement-PT-05120by02560-11
FORMULA_NAME CloudOpsManagement-PT-05120by02560-12
FORMULA_NAME CloudOpsManagement-PT-05120by02560-13
FORMULA_NAME CloudOpsManagement-PT-05120by02560-14
FORMULA_NAME CloudOpsManagement-PT-05120by02560-15

=== Now, execution of the tool begins

BK_START 1620903327301

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:55:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:55:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:55:28] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 10:55:28] [INFO ] Transformed 27 places.
[2021-05-13 10:55:28] [INFO ] Transformed 29 transitions.
[2021-05-13 10:55:28] [INFO ] Parsed PT model containing 27 places and 29 transitions in 52 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 104995 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=1909 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:55:28] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:55:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Added : 22 causal constraints over 5 iterations in 66 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:55:29] [INFO ] Added : 26 causal constraints over 6 iterations in 25 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 5 iterations in 22 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 5 iterations in 17 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 26 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:29] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-13 10:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:29] [INFO ] Added : 26 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 6 iterations in 42 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:29] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 5 iterations in 14 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:55:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:55:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:55:30] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:55:30] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:55:30] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-13 10:55:30] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 10:55:30] [INFO ] Flatten gal took : 21 ms
FORMULA CloudOpsManagement-PT-05120by02560-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:55:30] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:55:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 10:55:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-05120by02560 @ 3570 seconds

FORMULA CloudOpsManagement-PT-05120by02560-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2886
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-05120by02560

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p3 <= p2) OR (p5 <= p18)))",
"processed_size": 32,
"rewrites": 91
},
"result":
{
"edges": 20497,
"markings": 20492,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X (X (X (((p3 <= p10) OR (G ((p3 <= p2)) AND F ((p3 <= p10))))))))",
"processed_size": 69,
"rewrites": 91
},
"result":
{
"edges": 628,
"markings": 289,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p8 <= p3) OR (1 <= p26))",
"processed_size": 27,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"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 ((p3 + 1 <= p8))",
"processed_size": 18,
"rewrites": 91
},
"result":
{
"edges": 15365,
"markings": 15365,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (X (F ((3 <= p7)))) OR F ((p6 + 1 <= p11)))))",
"processed_size": 54,
"rewrites": 91
},
"result":
{
"edges": 2565,
"markings": 2565,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((3 <= p8) U X (G ((F ((p26 <= p10)) AND ((F (G ((p7 + 1 <= p25))) AND (p8 <= 2)) OR (p26 <= p10)))))))",
"processed_size": 106,
"rewrites": 91
},
"result":
{
"edges": 2565,
"markings": 2565,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"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": 1077
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p20 <= 2)))",
"processed_size": 18,
"rewrites": 91
},
"result":
{
"edges": 49235,
"markings": 43817,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p14) OR (p18 <= p2))))",
"processed_size": 36,
"rewrites": 91
},
"result":
{
"edges": 10300,
"markings": 10280,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": "F ((F (G ((p15 <= 0))) AND (G ((p15 <= 0)) AND (p24 <= 1))))",
"processed_size": 60,
"rewrites": 91
},
"result":
{
"edges": 48661,
"markings": 43533,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p8 <= p3) OR (1 <= p26))",
"processed_size": 27,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((p3 + 1 <= p8))",
"processed_size": 18,
"rewrites": 91
},
"result":
{
"edges": 15365,
"markings": 15365,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 684.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X((F(G((X(*) AND **))) AND G((X(**) OR G((X(*) AND **)))))) : (X(X(X(X((** OR (G(**) AND F(**))))))) OR G(**)) : (X(G(**)) OR (G(**) AND **)) : X(F((X(X(F(**))) OR F(*)))) : F((F(G(*)) AND (G(*) AND *))) : F(G(*)) : X(G((F(**) OR (G(*) OR X(G(**)))))) : X((** U X(G((F(**) AND ((F(G(*)) AND **) OR **))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no unknown yes unknown no no no unknown no ",
"value": "no unknown yes unknown 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: (F ((F ((2 <= p1)) AND G ((p18 <= p2)))) U F (G (F (((1 <= p14) OR (p18 <= p2)))))) : X (G ((X ((3 <= p4)) U G ((NOT(X ((3 <= p4))) AND (p22 <= p9)))))) : (NOT(X (X (X (X (NOT((G ((p3 <= p2)) U (p3 <= p10)))))))) OR G (((p3 <= p2) OR (p5 <= p18)))) : (X (G ((p22 <= p3))) OR (G ((p3 + 1 <= p8)) AND ((p8 <= p3) OR (1 <= p26)))) : X (F ((F (X (X ((3 <= p7)))) OR NOT(G ((p11 <= p6)))))) : NOT(G (((G (F (((1 <= 0) U (1 <= p15)))) OR F ((1 <= p15))) OR (2 <= p24)))) : F (NOT(X (NOT(X (G (X (NOT(F ((3 <= p20)))))))))) : NOT(F (NOT(X (((F ((p15 + 1 <= p23)) OR NOT(F ((1 <= p12)))) OR G (X ((1 <= p12)))))))) : X (((3 <= p8) U X (G (((NOT(G (F ((p25 <= p7)))) AND (p8 <= 2)) U (p26 <= p10))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: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:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((X ((p4 <= 2)) AND (p22 <= p9)))) AND G ((X ((3 <= p4)) OR G ((X ((p4 <= 2)) AND (p22 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((X ((p4 <= 2)) AND (p22 <= p9)))) AND G ((X ((3 <= p4)) OR G ((X ((p4 <= 2)) AND (p22 <= p9)))))))
lola: processed formula length: 108
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 5428070 markings, 8190920 edges, 1085614 markings/sec, 0 secs
lola: 10486414 markings, 15806692 edges, 1011669 markings/sec, 5 secs
lola: 15463163 markings, 23295335 edges, 995350 markings/sec, 10 secs
lola: 20429450 markings, 30765642 edges, 993257 markings/sec, 15 secs
lola: 25416848 markings, 38266029 edges, 997480 markings/sec, 20 secs
lola: 30318200 markings, 45636142 edges, 980270 markings/sec, 25 secs
lola: 35183792 markings, 52951142 edges, 973118 markings/sec, 30 secs
lola: 39998675 markings, 60189346 edges, 962977 markings/sec, 35 secs
lola: 44771340 markings, 67363725 edges, 954533 markings/sec, 40 secs
lola: 49574380 markings, 74582893 edges, 960608 markings/sec, 45 secs
lola: 54302750 markings, 81689292 edges, 945674 markings/sec, 50 secs
lola: 59021518 markings, 88781071 edges, 943754 markings/sec, 55 secs
lola: 63732439 markings, 95860531 edges, 942184 markings/sec, 60 secs
lola: 68399891 markings, 102874531 edges, 933490 markings/sec, 65 secs
lola: 72994296 markings, 109778226 edges, 918881 markings/sec, 70 secs
lola: 77673956 markings, 116809956 edges, 935932 markings/sec, 75 secs
lola: 81213320 markings, 122128481 edges, 707873 markings/sec, 80 secs
lola: 83734343 markings, 125918260 edges, 504205 markings/sec, 85 secs
lola: 87843370 markings, 132090838 edges, 821805 markings/sec, 90 secs
lola: 91917150 markings, 138211563 edges, 814756 markings/sec, 95 secs
lola: 95716054 markings, 143918271 edges, 759781 markings/sec, 100 secs
lola: 99385343 markings, 149430818 edges, 733858 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (((p3 <= p10) OR (G ((p3 <= p2)) AND F ((p3 <= p10)))))))) OR G (((p3 <= p2) OR (p5 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= p2) OR (p5 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= p2) OR (p5 <= p18)))
lola: processed formula length: 32
lola: 91 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: 20492 markings, 20497 edges
lola: ========================================
lola: subprocess 2 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (((p3 <= p10) OR (G ((p3 <= p2)) AND F ((p3 <= p10))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (((p3 <= p10) OR (G ((p3 <= p2)) AND F ((p3 <= p10))))))))
lola: processed formula length: 69
lola: 91 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: 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: 289 markings, 628 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p22 <= p3))) OR (G ((p3 + 1 <= p8)) AND ((p8 <= p3) OR (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= p3) OR (1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p8 <= p3) OR (1 <= p26))
lola: processed formula length: 27
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 3 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p3 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p3 + 1 <= p8))
lola: processed formula length: 18
lola: 91 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: 15365 markings, 15365 edges
lola: ========================================
lola: subprocess 4 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p22 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p22 <= p3)))
lola: processed formula length: 19
lola: 91 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: 5233918 markings, 7889338 edges, 1046784 markings/sec, 0 secs
lola: 10196361 markings, 15355156 edges, 992489 markings/sec, 5 secs
lola: 15073786 markings, 22689794 edges, 975485 markings/sec, 10 secs
lola: 19916485 markings, 29970174 edges, 968540 markings/sec, 15 secs
lola: 24747631 markings, 37231935 edges, 966229 markings/sec, 20 secs
lola: 29453562 markings, 44304654 edges, 941186 markings/sec, 25 secs
lola: 34182042 markings, 51410328 edges, 945696 markings/sec, 30 secs
lola: 38933971 markings, 58550706 edges, 950386 markings/sec, 35 secs
lola: 43768675 markings, 65815180 edges, 966941 markings/sec, 40 secs
lola: 48432410 markings, 72822046 edges, 932747 markings/sec, 45 secs
lola: 53038942 markings, 79742650 edges, 921306 markings/sec, 50 secs
lola: 57577507 markings, 86560812 edges, 907713 markings/sec, 55 secs
lola: 62143746 markings, 93420590 edges, 913248 markings/sec, 60 secs
lola: 66672838 markings, 100223944 edges, 905818 markings/sec, 65 secs
lola: 71208346 markings, 107037044 edges, 907102 markings/sec, 70 secs
lola: 75411490 markings, 113351817 edges, 840629 markings/sec, 75 secs
lola: 79484082 markings, 119485861 edges, 814518 markings/sec, 80 secs
lola: 83194170 markings, 125045079 edges, 742018 markings/sec, 85 secs
lola: 87148643 markings, 130980246 edges, 790895 markings/sec, 90 secs
lola: 89835153 markings, 135015027 edges, 537302 markings/sec, 95 secs
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: subprocess 3 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (F ((3 <= p7)))) OR F ((p6 + 1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (F ((3 <= p7)))) OR F ((p6 + 1 <= p11)))))
lola: processed formula length: 54
lola: 91 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: 2565 markings, 2565 edges
lola: ========================================
lola: subprocess 4 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p15 + 1 <= p23)) OR (G ((p12 <= 0)) OR X (G ((1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p15 + 1 <= p23)) OR (G ((p12 <= 0)) OR X (G ((1 <= p12)))))))
lola: processed formula length: 72
lola: 91 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: 5057107 markings, 7623295 edges, 1011421 markings/sec, 0 secs
lola: 9901008 markings, 14910927 edges, 968780 markings/sec, 5 secs
lola: 14774315 markings, 22239426 edges, 974661 markings/sec, 10 secs
lola: 19590258 markings, 29479819 edges, 963189 markings/sec, 15 secs
lola: 24264201 markings, 36505287 edges, 934789 markings/sec, 20 secs
lola: 28914996 markings, 43495158 edges, 930159 markings/sec, 25 secs
lola: 33539165 markings, 50444165 edges, 924834 markings/sec, 30 secs
lola: 38141828 markings, 57360589 edges, 920533 markings/sec, 35 secs
lola: 42878529 markings, 64477556 edges, 947340 markings/sec, 40 secs
lola: 47544719 markings, 71488464 edges, 933238 markings/sec, 45 secs
lola: 52166923 markings, 78432752 edges, 924441 markings/sec, 50 secs
lola: 56702166 markings, 85245956 edges, 907049 markings/sec, 55 secs
lola: 61265630 markings, 92101425 edges, 912693 markings/sec, 60 secs
lola: 65875663 markings, 99026710 edges, 922007 markings/sec, 65 secs
lola: 70430169 markings, 105868240 edges, 910901 markings/sec, 70 secs
lola: 74671605 markings, 112240340 edges, 848287 markings/sec, 75 secs
lola: 78649075 markings, 118216249 edges, 795494 markings/sec, 80 secs
lola: 82549419 markings, 124074564 edges, 780069 markings/sec, 85 secs
lola: 86417582 markings, 129884493 edges, 773633 markings/sec, 90 secs
lola: 89852331 markings, 135040755 edges, 686950 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((3 <= p8) U X (G ((F ((p26 <= p10)) AND ((F (G ((p7 + 1 <= p25))) AND (p8 <= 2)) OR (p26 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((3 <= p8) U X (G ((F ((p26 <= p10)) AND ((F (G ((p7 + 1 <= p25))) AND (p8 <= 2)) OR (p26 <= p10)))))))
lola: processed formula length: 106
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 20 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: 2565 markings, 2565 edges
lola: ========================================
lola: subprocess 6 will run for 1077 seconds at most (--localtimelimit=0)
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: 91 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: 43817 markings, 49235 edges
lola: ========================================
lola: subprocess 7 will run for 1616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p14) OR (p18 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p14) OR (p18 <= p2))))
lola: processed formula length: 36
lola: 91 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: 10280 markings, 10300 edges
lola: ========================================
lola: subprocess 8 will run for 3233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p15 <= 0))) AND (G ((p15 <= 0)) AND (p24 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p15 <= 0))) AND (G ((p15 <= 0)) AND (p24 <= 1))))
lola: processed formula length: 60
lola: 91 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: 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: 43533 markings, 48661 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F (G ((X ((p4 <= 2)) AND (p22 <= p9)))) AND G ((X ((3 <= p4)) OR G ((X ((p4 <= 2)) AND (p22 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((X ((p4 <= 2)) AND (p22 <= p9)))) AND G ((X ((3 <= p4)) OR G ((X ((p4 <= 2)) AND (p22 <= p9)))))))
lola: processed formula length: 108
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 5179819 markings, 7816886 edges, 1035964 markings/sec, 0 secs
lola: 10066198 markings, 15174104 edges, 977276 markings/sec, 5 secs
lola: 15019460 markings, 22627630 edges, 990652 markings/sec, 10 secs
lola: 19813496 markings, 29839238 edges, 958807 markings/sec, 15 secs
lola: 24657248 markings, 37123963 edges, 968750 markings/sec, 20 secs
lola: 29601312 markings, 44558006 edges, 988813 markings/sec, 25 secs
lola: 34444578 markings, 51839865 edges, 968653 markings/sec, 30 secs
lola: 39222224 markings, 59022181 edges, 955529 markings/sec, 35 secs
lola: 43948876 markings, 66127252 edges, 945330 markings/sec, 40 secs
lola: 48719407 markings, 73297702 edges, 954106 markings/sec, 45 secs
lola: 53396470 markings, 80327043 edges, 935413 markings/sec, 50 secs
lola: 58039531 markings, 87305330 edges, 928612 markings/sec, 55 secs
lola: 62673605 markings, 94269192 edges, 926815 markings/sec, 60 secs
lola: 67365653 markings, 101320483 edges, 938410 markings/sec, 65 secs
lola: 71949535 markings, 108208485 edges, 916776 markings/sec, 70 secs
lola: 76596858 markings, 115191384 edges, 929465 markings/sec, 75 secs
lola: 81407604 markings, 122423642 edges, 962149 markings/sec, 80 secs
lola: 85522000 markings, 128603242 edges, 822879 markings/sec, 85 secs
lola: 89725330 markings, 134918584 edges, 840666 markings/sec, 90 secs
lola: 91308516 markings, 137299323 edges, 316637 markings/sec, 95 secs
lola: 95333131 markings, 143345113 edges, 804923 markings/sec, 100 secs
lola: 99092968 markings, 148993274 edges, 751967 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (G ((p22 <= p3))) OR (G ((p3 + 1 <= p8)) AND ((p8 <= p3) OR (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p8 <= p3) OR (1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p8 <= p3) OR (1 <= p26))
lola: processed formula length: 27
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: G ((p3 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p3 + 1 <= p8))
lola: processed formula length: 18
lola: 91 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: 15365 markings, 15365 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p22 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p22 <= p3)))
lola: processed formula length: 19
lola: 91 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: 5143813 markings, 7753747 edges, 1028763 markings/sec, 0 secs
lola: 10037870 markings, 15116823 edges, 978811 markings/sec, 5 secs
lola: 14932748 markings, 22477649 edges, 978976 markings/sec, 10 secs
lola: 19796299 markings, 29789470 edges, 972710 markings/sec, 15 secs
lola: 24585584 markings, 36988355 edges, 957857 markings/sec, 20 secs
lola: 29316526 markings, 44098499 edges, 946188 markings/sec, 25 secs
lola: 34003963 markings, 51142644 edges, 937487 markings/sec, 30 secs
lola: 38655422 markings, 58132209 edges, 930292 markings/sec, 35 secs
lola: 43337932 markings, 65167726 edges, 936502 markings/sec, 40 secs
lola: 47981865 markings, 72145123 edges, 928787 markings/sec, 45 secs
lola: 52644772 markings, 79150377 edges, 932581 markings/sec, 50 secs
lola: 57218834 markings, 86022183 edges, 914812 markings/sec, 55 secs
lola: 61781179 markings, 92876005 edges, 912469 markings/sec, 60 secs
lola: 66355415 markings, 99747419 edges, 914847 markings/sec, 65 secs
lola: 70926565 markings, 106613831 edges, 914230 markings/sec, 70 secs
lola: 75098562 markings, 112882128 edges, 834399 markings/sec, 75 secs
lola: 78744006 markings, 118358656 edges, 729089 markings/sec, 80 secs
lola: 80320486 markings, 120724084 edges, 315296 markings/sec, 85 secs
lola: 82886146 markings, 124577708 edges, 513132 markings/sec, 90 secs
lola: 84493419 markings, 126991919 edges, 321455 markings/sec, 95 secs
lola: 86450866 markings, 129931908 edges, 391489 markings/sec, 100 secs
lola: 89490261 markings, 134496949 edges, 607879 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p15 + 1 <= p23)) OR (G ((p12 <= 0)) OR X (G ((1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p15 + 1 <= p23)) OR (G ((p12 <= 0)) OR X (G ((1 <= p12)))))))
lola: processed formula length: 72
lola: 91 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: 4844192 markings, 7302776 edges, 968838 markings/sec, 0 secs
lola: 9429799 markings, 14202246 edges, 917121 markings/sec, 5 secs
lola: 14036570 markings, 21130181 edges, 921354 markings/sec, 10 secs
lola: 18665568 markings, 28089785 edges, 925800 markings/sec, 15 secs
lola: 23250698 markings, 34982006 edges, 917026 markings/sec, 20 secs
lola: 27765002 markings, 41766881 edges, 902861 markings/sec, 25 secs
lola: 32164471 markings, 48378475 edges, 879894 markings/sec, 30 secs
lola: 36710549 markings, 55209803 edges, 909216 markings/sec, 35 secs
lola: 41379913 markings, 62225919 edges, 933873 markings/sec, 40 secs
lola: 46035828 markings, 69221327 edges, 931183 markings/sec, 45 secs
lola: 50654271 markings, 76160260 edges, 923689 markings/sec, 50 secs
lola: 55215699 markings, 83012844 edges, 912286 markings/sec, 55 secs
lola: 59735353 markings, 89802810 edges, 903931 markings/sec, 60 secs
lola: 64331105 markings, 96706482 edges, 919150 markings/sec, 65 secs
lola: 68883211 markings, 103544488 edges, 910421 markings/sec, 70 secs
lola: 73248452 markings, 110102928 edges, 873048 markings/sec, 75 secs
lola: 75397940 markings, 113330344 edges, 429898 markings/sec, 80 secs
lola: 77852058 markings, 117028186 edges, 490824 markings/sec, 85 secs
lola: 81514170 markings, 122554102 edges, 732422 markings/sec, 90 secs
lola: 84750350 markings, 127377726 edges, 647236 markings/sec, 95 secs
lola: 88038605 markings, 132316770 edges, 657651 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown yes unknown no no no unknown no
lola:
preliminary result: no unknown yes unknown no no no unknown no
lola: memory consumption: 3372 KB
lola: time consumption: 684 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-05120by02560"
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-05120by02560, 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-162038334800225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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