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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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 17K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620903582377

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

FORMULA CloudOpsManagement-PT-10240by05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2866
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-10240by05120

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((F ((1 <= p14)) OR (1 <= p14))) AND ((X (X ((p18 <= p2))) U (X ((1 <= p14)) AND (p15 <= p21))) OR X ((F ((1 <= p14)) OR (1 <= p14))))))",
"processed_size": 142,
"rewrites": 76
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (G (((p26 + 1 <= p15))))",
"processed_size": 26,
"rewrites": 76
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"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": "(2 <= p25)",
"processed_size": 10,
"rewrites": 78
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1039
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((p12 + 1 <= p17) R (p11 + 1 <= p8)) AND (p4 <= 1))))",
"processed_size": 60,
"rewrites": 76
},
"result":
{
"edges": 6291348,
"markings": 3593218,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 1557
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3114
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p7 + 1 <= p25)",
"processed_size": 15,
"rewrites": 78
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 704.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F((F(**) OR **)) AND ((X(X(**)) U (X(**) AND **)) OR X((F(**) OR **))))) : F(((X((X(**) U **)) AND (F(*) OR X(G((F(**) AND (X(**) OR **)))))) OR *)) : F(*) : (F(G(**)) AND **) : X(G(*)) : X(G((X((* R *)) OR F(G(*))))) : (X(X(X(X(F(*))))) AND F(G(**))) : F(**) : F(G(((* R *) AND *))) : (F(**) AND F(G((F((F(**) AND (** AND **))) AND (** OR (F(**) AND (** AND **)))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no unknown no no no unknown no no no no ",
"value": "no unknown no no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: LP says that atomic proposition is always true: (1 <= p23)
lola: G (((X (X ((p18 <= p2))) U (X ((1 <= p14)) AND (p15 <= p21))) U X ((F ((1 <= p14)) OR (1 <= p14))))) : NOT(G (((G (((p11 <= p6) AND (2 <= p10))) U X (NOT((X ((p11 <= p6)) U (2 <= p10))))) AND (p13 <= p21)))) : F (NOT(G ((2 <= p25)))) : (F (G ((p14 <= p1))) AND (p14 <= p1)) : NOT(F (X (F (((p15 <= p26)))))) : X (NOT(F ((X (((p6 <= p2) U (p8 + 1 <= p20))) AND G (F ((2 <= p24))))))) : (F (X (X (F (X (NOT(X ((1 <= p0)))))))) AND X (F (G ((1 <= p0))))) : (F (((p23 <= p15) U (p16 <= p24))) OR G (F (G ((F ((p23 <= p15)) U (1 <= 0)))))) : NOT(F (G (F ((((p17 <= p12) U (p8 <= p11)) OR (2 <= p4)))))) : (F ((p25 <= p7)) AND F (G (((p8 + 1 <= p22) U ((F ((p22 <= p8)) AND (3 <= p8)) AND (2 <= p7))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F ((1 <= p14)) OR (1 <= p14))) AND ((X (X ((p18 <= p2))) U (X ((1 <= p14)) AND (p15 <= p21))) OR X ((F ((1 <= p14)) OR (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F ((1 <= p14)) OR (1 <= p14))) AND ((X (X ((p18 <= p2))) U (X ((1 <= p14)) AND (p15 <= p21))) OR X ((F ((1 <= p14)) OR (1 <= p14))))))
lola: processed formula length: 142
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 5125 markings, 5125 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X ((X ((p11 <= p6)) U (2 <= p10))) AND (F (((p6 + 1 <= p11) OR (p10 <= 1))) OR X (G ((F ((2 <= p10)) AND (X ((p11 <= p6)) OR (2 <= p10))))))) OR (p21 + 1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((X ((p11 <= p6)) U (2 <= p10))) AND (F (((p6 + 1 <= p11) OR (p10 <= 1))) OR X (G ((F ((2 <= p10)) AND (X ((p11 <= p6)) OR (2 <= p10))))))) OR (p21 + 1 <= p13)))
lola: processed formula length: 169
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 4301127 markings, 6483901 edges, 860225 markings/sec, 0 secs
lola: 8420921 markings, 12683183 edges, 823959 markings/sec, 5 secs
lola: 12472777 markings, 18777396 edges, 810371 markings/sec, 10 secs
lola: 16499266 markings, 24831577 edges, 805298 markings/sec, 15 secs
lola: 20477706 markings, 30812350 edges, 795688 markings/sec, 20 secs
lola: 24477258 markings, 36824090 edges, 799910 markings/sec, 25 secs
lola: 28450105 markings, 42795118 edges, 794569 markings/sec, 30 secs
lola: 32391407 markings, 48717963 edges, 788260 markings/sec, 35 secs
lola: 36301690 markings, 54593864 edges, 782057 markings/sec, 40 secs
lola: 40249297 markings, 60525704 edges, 789521 markings/sec, 45 secs
lola: 44203273 markings, 66466535 edges, 790795 markings/sec, 50 secs
lola: 48100767 markings, 72322275 edges, 779499 markings/sec, 55 secs
lola: 52016701 markings, 78205400 edges, 783187 markings/sec, 60 secs
lola: 55915056 markings, 84062069 edges, 779671 markings/sec, 65 secs
lola: 59754838 markings, 89830389 edges, 767956 markings/sec, 70 secs
lola: 63512128 markings, 95474673 edges, 751458 markings/sec, 75 secs
lola: 67276983 markings, 101130169 edges, 752971 markings/sec, 80 secs
lola: 70974141 markings, 106683786 edges, 739432 markings/sec, 85 secs
lola: 71310604 markings, 107189218 edges, 67293 markings/sec, 90 secs
lola: 74383710 markings, 111816058 edges, 614621 markings/sec, 95 secs
lola: 76072847 markings, 114344083 edges, 337827 markings/sec, 100 secs
lola: 77855942 markings, 117022128 edges, 356619 markings/sec, 105 secs
lola: 79886388 markings, 120070304 edges, 406089 markings/sec, 110 secs
lola: 83117508 markings, 124923947 edges, 646224 markings/sec, 115 secs
lola: 85975393 markings, 129216312 edges, 571577 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p26 + 1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p26 + 1 <= p15))))
lola: processed formula length: 26
lola: 76 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: 5125 markings, 5125 edges
lola: ========================================
lola: subprocess 3 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p2 + 1 <= p6) R (p20 <= p8))) OR F (G ((p24 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p2 + 1 <= p6) R (p20 <= p8))) OR F (G ((p24 <= 1))))))
lola: processed formula length: 66
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4706460 markings, 7101205 edges, 941292 markings/sec, 0 secs
lola: 9339882 markings, 14078440 edges, 926684 markings/sec, 5 secs
lola: 13910015 markings, 20956000 edges, 914027 markings/sec, 10 secs
lola: 18333695 markings, 27610904 edges, 884736 markings/sec, 15 secs
lola: 22898998 markings, 34477152 edges, 913061 markings/sec, 20 secs
lola: 27542210 markings, 41459663 edges, 928642 markings/sec, 25 secs
lola: 32172161 markings, 48420827 edges, 925990 markings/sec, 30 secs
lola: 36791529 markings, 55365493 edges, 923874 markings/sec, 35 secs
lola: 41355049 markings, 62225609 edges, 912704 markings/sec, 40 secs
lola: 45852736 markings, 68986485 edges, 899537 markings/sec, 45 secs
lola: 50377433 markings, 75787467 edges, 904939 markings/sec, 50 secs
lola: 54900675 markings, 82585218 edges, 904648 markings/sec, 55 secs
lola: 59348030 markings, 89269304 edges, 889471 markings/sec, 60 secs
lola: 63847470 markings, 96030841 edges, 899888 markings/sec, 65 secs
lola: 68260712 markings, 102662642 edges, 882648 markings/sec, 70 secs
lola: 72624143 markings, 109219483 edges, 872686 markings/sec, 75 secs
lola: 77026612 markings, 115834804 edges, 880494 markings/sec, 80 secs
lola: 81486643 markings, 122537751 edges, 892006 markings/sec, 85 secs
lola: 85297922 markings, 128264965 edges, 762256 markings/sec, 90 secs
lola: 89028922 markings, 133870021 edges, 746200 markings/sec, 95 secs
lola: 92859814 markings, 139672162 edges, 766178 markings/sec, 100 secs
lola: 95804899 markings, 144049182 edges, 589017 markings/sec, 105 secs
lola: 99547094 markings, 149671314 edges, 748439 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (F ((p0 <= 0)))))) AND F (G ((1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p0)))
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 ((1 <= p0)))
lola: processed formula length: 17
lola: 76 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: 3699747 markings, 6624616 edges, 739949 markings/sec, 0 secs
lola: 7659349 markings, 13690230 edges, 791920 markings/sec, 5 secs
lola: 11610499 markings, 20743138 edges, 790230 markings/sec, 10 secs
lola: 15487579 markings, 27641801 edges, 775416 markings/sec, 15 secs
lola: 19352681 markings, 34532472 edges, 773020 markings/sec, 20 secs
lola: 23213787 markings, 41391861 edges, 772221 markings/sec, 25 secs
lola: 27017777 markings, 48164510 edges, 760798 markings/sec, 30 secs
lola: 30816360 markings, 54910883 edges, 759717 markings/sec, 35 secs
lola: 34566596 markings, 61555389 edges, 750047 markings/sec, 40 secs
lola: 38373660 markings, 68317141 edges, 761413 markings/sec, 45 secs
lola: 42189293 markings, 75077086 edges, 763127 markings/sec, 50 secs
lola: 45950775 markings, 81726023 edges, 752296 markings/sec, 55 secs
lola: 49682669 markings, 88325352 edges, 746379 markings/sec, 60 secs
lola: 53399727 markings, 94895574 edges, 743412 markings/sec, 65 secs
lola: 57114868 markings, 101451948 edges, 743028 markings/sec, 70 secs
lola: 60901922 markings, 108129254 edges, 757411 markings/sec, 75 secs
lola: 64585639 markings, 114617064 edges, 736743 markings/sec, 80 secs
lola: 68263289 markings, 121094625 edges, 735530 markings/sec, 85 secs
lola: 72176235 markings, 127962342 edges, 782589 markings/sec, 90 secs
lola: 76031936 markings, 134733669 edges, 771140 markings/sec, 95 secs
lola: 79867788 markings, 141457171 edges, 767170 markings/sec, 100 secs
lola: 83709737 markings, 148185272 edges, 768390 markings/sec, 105 secs
lola: 87496477 markings, 154807717 edges, 757348 markings/sec, 110 secs
lola: 91281729 markings, 161412274 edges, 757050 markings/sec, 115 secs
lola: 95015341 markings, 167914346 edges, 746722 markings/sec, 120 secs
lola: 98752449 markings, 174415582 edges, 747422 markings/sec, 125 secs
lola: 102495879 markings, 180922733 edges, 748686 markings/sec, 130 secs
lola: 106239955 markings, 187420740 edges, 748815 markings/sec, 135 secs
lola: 109959231 markings, 193850998 edges, 743855 markings/sec, 140 secs
lola: 113699937 markings, 200319448 edges, 748141 markings/sec, 145 secs
lola: 117403127 markings, 206703748 edges, 740638 markings/sec, 150 secs
lola: 120800649 markings, 212554598 edges, 679504 markings/sec, 155 secs
lola: 124204061 markings, 218390881 edges, 680682 markings/sec, 160 secs
lola: 127672494 markings, 224332427 edges, 693687 markings/sec, 165 secs
lola: 131190207 markings, 230345385 edges, 703543 markings/sec, 170 secs
lola: 134653309 markings, 236248303 edges, 692620 markings/sec, 175 secs
lola: 137678969 markings, 241394006 edges, 605132 markings/sec, 180 secs
lola: 140766595 markings, 246636904 edges, 617525 markings/sec, 185 secs
lola: 143764348 markings, 251706723 edges, 599551 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (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 (X (X (F ((p0 <= 0))))))
lola: processed formula length: 29
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5125 markings, 5125 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p25 <= 1))
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: (2 <= p25)
lola: processed formula length: 10
lola: 78 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: 5125 markings, 5125 edges
lola: ========================================
lola: subprocess 6 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p16 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p24 + 1 <= p16)
lola: processed formula length: 16
lola: 78 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: 30725 markings, 30725 edges
lola: ========================================
lola: subprocess 7 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p12 + 1 <= p17) R (p11 + 1 <= p8)) AND (p4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p12 + 1 <= p17) R (p11 + 1 <= p8)) AND (p4 <= 1))))
lola: processed formula length: 60
lola: 76 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: 3593218 markings, 6291348 edges
lola: ========================================
lola: subprocess 8 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p14 <= p1))) AND (p14 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p1)
lola: processed formula length: 11
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p14 <= p1)))
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 ((p14 <= p1)))
lola: processed formula length: 19
lola: 76 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 24
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: 20490 markings, 20496 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p25 <= p7)) AND F (G ((F ((F ((p22 <= p8)) AND ((3 <= p8) AND (2 <= p7)))) AND ((p8 + 1 <= p22) OR (F ((p22 <= p8)) AND ((3 <= p8) AND (2 <= p7))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p25 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p7 + 1 <= p25)
lola: processed formula length: 15
lola: 78 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: 5125 markings, 5125 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((X ((X ((p11 <= p6)) U (2 <= p10))) AND (F (((p6 + 1 <= p11) OR (p10 <= 1))) OR X (G ((F ((2 <= p10)) AND (X ((p11 <= p6)) OR (2 <= p10))))))) OR (p21 + 1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((X ((p11 <= p6)) U (2 <= p10))) AND (F (((p6 + 1 <= p11) OR (p10 <= 1))) OR X (G ((F ((2 <= p10)) AND (X ((p11 <= p6)) OR (2 <= p10))))))) OR (p21 + 1 <= p13)))
lola: processed formula length: 169
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 4112873 markings, 6200534 edges, 822575 markings/sec, 0 secs
lola: 8284410 markings, 12477976 edges, 834307 markings/sec, 5 secs
lola: 12422328 markings, 18701390 edges, 827584 markings/sec, 10 secs
lola: 16513805 markings, 24853454 edges, 818295 markings/sec, 15 secs
lola: 20422791 markings, 30729846 edges, 781797 markings/sec, 20 secs
lola: 24353056 markings, 36637353 edges, 786053 markings/sec, 25 secs
lola: 28317098 markings, 42595003 edges, 792808 markings/sec, 30 secs
lola: 32259622 markings, 48520007 edges, 788505 markings/sec, 35 secs
lola: 36114405 markings, 54312678 edges, 770957 markings/sec, 40 secs
lola: 39936546 markings, 60055719 edges, 764428 markings/sec, 45 secs
lola: 43847811 markings, 65932435 edges, 782253 markings/sec, 50 secs
lola: 47754222 markings, 71801719 edges, 781282 markings/sec, 55 secs
lola: 51710525 markings, 77745490 edges, 791261 markings/sec, 60 secs
lola: 55529426 markings, 83482702 edges, 763780 markings/sec, 65 secs
lola: 59333706 markings, 89197909 edges, 760856 markings/sec, 70 secs
lola: 63232208 markings, 95054023 edges, 779700 markings/sec, 75 secs
lola: 67147912 markings, 100936296 edges, 783141 markings/sec, 80 secs
lola: 71015180 markings, 106745140 edges, 773454 markings/sec, 85 secs
lola: 74095440 markings, 111372809 edges, 616052 markings/sec, 90 secs
lola: 77291400 markings, 116174503 edges, 639192 markings/sec, 95 secs
lola: 80550594 markings, 121068774 edges, 651839 markings/sec, 100 secs
lola: 83900120 markings, 126099229 edges, 669905 markings/sec, 105 secs
lola: 86581637 markings, 130126995 edges, 536303 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p2 + 1 <= p6) R (p20 <= p8))) OR F (G ((p24 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p2 + 1 <= p6) R (p20 <= p8))) OR F (G ((p24 <= 1))))))
lola: processed formula length: 66
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5088749 markings, 7677113 edges, 1017750 markings/sec, 0 secs
lola: 9947765 markings, 14993379 edges, 971803 markings/sec, 5 secs
lola: 14734048 markings, 22195783 edges, 957257 markings/sec, 10 secs
lola: 19437797 markings, 29271607 edges, 940750 markings/sec, 15 secs
lola: 24067739 markings, 36234863 edges, 925988 markings/sec, 20 secs
lola: 28812827 markings, 43370227 edges, 949018 markings/sec, 25 secs
lola: 33424890 markings, 50304522 edges, 922413 markings/sec, 30 secs
lola: 38001459 markings, 57184703 edges, 915314 markings/sec, 35 secs
lola: 42509553 markings, 63960986 edges, 901619 markings/sec, 40 secs
lola: 47057425 markings, 70796903 edges, 909574 markings/sec, 45 secs
lola: 51597463 markings, 77620817 edges, 908008 markings/sec, 50 secs
lola: 56073142 markings, 84347390 edges, 895136 markings/sec, 55 secs
lola: 60621013 markings, 91182047 edges, 909574 markings/sec, 60 secs
lola: 65197202 markings, 98059295 edges, 915238 markings/sec, 65 secs
lola: 69726188 markings, 104864913 edges, 905797 markings/sec, 70 secs
lola: 74250160 markings, 111662749 edges, 904794 markings/sec, 75 secs
lola: 78908201 markings, 118662131 edges, 931608 markings/sec, 80 secs
lola: 83132381 markings, 125009662 edges, 844836 markings/sec, 85 secs
lola: 86986391 markings, 130823845 edges, 770802 markings/sec, 90 secs
lola: 90801774 markings, 136535179 edges, 763077 markings/sec, 95 secs
lola: 94718621 markings, 142420068 edges, 783369 markings/sec, 100 secs
lola: 97712985 markings, 146916013 edges, 598873 markings/sec, 105 secs
lola: 100855373 markings, 151636858 edges, 628478 markings/sec, 110 secs
lola: 101185414 markings, 152132939 edges, 66008 markings/sec, 115 secs
lola: 101188909 markings, 152138138 edges, 699 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no unknown no no no no
lola:
preliminary result: no unknown no no no unknown no no no no
lola: memory consumption: 3328 KB
lola: time consumption: 704 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-10240by05120"
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-10240by05120, 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-162038334800229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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