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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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.4K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.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-20480by10240-00
FORMULA_NAME CloudOpsManagement-PT-20480by10240-01
FORMULA_NAME CloudOpsManagement-PT-20480by10240-02
FORMULA_NAME CloudOpsManagement-PT-20480by10240-03
FORMULA_NAME CloudOpsManagement-PT-20480by10240-04
FORMULA_NAME CloudOpsManagement-PT-20480by10240-05
FORMULA_NAME CloudOpsManagement-PT-20480by10240-06
FORMULA_NAME CloudOpsManagement-PT-20480by10240-07
FORMULA_NAME CloudOpsManagement-PT-20480by10240-08
FORMULA_NAME CloudOpsManagement-PT-20480by10240-09
FORMULA_NAME CloudOpsManagement-PT-20480by10240-10
FORMULA_NAME CloudOpsManagement-PT-20480by10240-11
FORMULA_NAME CloudOpsManagement-PT-20480by10240-12
FORMULA_NAME CloudOpsManagement-PT-20480by10240-13
FORMULA_NAME CloudOpsManagement-PT-20480by10240-14
FORMULA_NAME CloudOpsManagement-PT-20480by10240-15

=== Now, execution of the tool begins

BK_START 1620903744262

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 11:02:25] [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 11:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:02:25] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-13 11:02:25] [INFO ] Transformed 27 places.
[2021-05-13 11:02:25] [INFO ] Transformed 29 transitions.
[2021-05-13 11:02:25] [INFO ] Parsed PT model containing 27 places and 29 transitions in 70 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 112650 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=1976 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 11:02:25] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-13 11:02:25] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-13 11:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 11:02:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-13 11:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 11:02:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 11:02:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:26] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:26] [INFO ] Added : 25 causal constraints over 5 iterations in 45 ms. Result :sat
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 34 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:02:26] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:26] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 11:02:26] [INFO ] Added : 25 causal constraints over 6 iterations in 116 ms. Result :sat
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 55 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 11:02:26] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:02:26] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 30 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:26] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2021-05-13 11:02:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 11:02:26] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 11:02:26] [INFO ] Added : 25 causal constraints over 6 iterations in 60 ms. Result :sat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 11:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 11:02:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:27] [INFO ] Added : 25 causal constraints over 5 iterations in 16 ms. Result :sat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned unsat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:27] [INFO ] Added : 25 causal constraints over 5 iterations in 116 ms. Result :sat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:27] [INFO ] Added : 17 causal constraints over 5 iterations in 26 ms. Result :sat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 43 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 11:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:27] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2021-05-13 11:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 66 ms returned sat
[2021-05-13 11:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2021-05-13 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:28] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 78 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Added 3 Read/Feed constraints in 11 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:28] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:28] [INFO ] Added : 22 causal constraints over 5 iterations in 18 ms. Result :sat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:28] [INFO ] Added : 22 causal constraints over 5 iterations in 43 ms. Result :sat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:02:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:28] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 11:02:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 5 iterations in 19 ms. Result :sat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 5 iterations in 13 ms. Result :sat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 11:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:02:29] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-13 11:02:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 11:02:29] [INFO ] Flatten gal took : 32 ms
FORMULA CloudOpsManagement-PT-20480by10240-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:02:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 11:02:29] [INFO ] Flatten gal took : 6 ms
[2021-05-13 11:02:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CloudOpsManagement-PT-20480by10240-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:02:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 11:02:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-20480by10240 @ 3570 seconds

FORMULA CloudOpsManagement-PT-20480by10240-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 11:02:29 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X ((F ((X ((p24 <= p20)) AND ((p14 <= 1) AND (p24 <= p20)))) OR (G ((p16 <= p8)) OR (p2 <= p0)))))",
"processed_size": 101,
"rewrites": 77
},
"result":
{
"edges": 20,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((G ((p26 + 1 <= p15)) AND (p3 + 1 <= p26)) OR (p26 + 1 <= p15))) OR (p14 <= p3)))",
"processed_size": 89,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p14) U (3 <= p7)) AND F ((1 <= p14))))))",
"processed_size": 57,
"rewrites": 77
},
"result":
{
"edges": 10245,
"markings": 10245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((p18 <= 2))))",
"processed_size": 22,
"rewrites": 77
},
"result":
{
"edges": 10361,
"markings": 10314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (F ((p10 + 1 <= p26))) AND (F (G ((3 <= p8))) AND G ((((2 <= p7) U (3 <= p8)) OR X (G ((3 <= p8))))))))",
"processed_size": 109,
"rewrites": 77
},
"result":
{
"edges": 10245,
"markings": 10245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p20 <= p8)))",
"processed_size": 19,
"rewrites": 77
},
"result":
{
"edges": 33946910,
"markings": 22569965,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3320,
"runtime": 574.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) U **) U X(X(G((F(**) OR (G(*) AND F(**))))))) : X((G(**) AND F(**))) : X(X((F((X(**) AND (** AND **))) OR (G(**) OR **)))) : X((G(((G(*) AND *) OR *)) OR **)) : X(X(F(((** U **) AND F(**))))) : X(X(G(*))) : F(G(**)) : (X(F(**)) U G(**)) : F(G((F((G(F(**)) OR (** U **))) AND (F(**) OR (G(F(**)) OR (** U **)))))) : X((G(F(*)) AND (F(G(**)) AND G(((** U **) OR X(G(**)))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no yes yes no no no unknown unknown no ",
"value": "no no yes yes no no no unknown 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 ((p7 <= p8)) U (2 <= p1)) U G (X (X ((NOT(F ((p15 <= p21))) U F ((1 <= p14))))))) : (G (X ((p13 <= p15))) AND X ((NOT(X (X (X (F ((2 <= p9)))))) U F ((3 <= p4))))) : X (X (((F (((X ((p24 <= p20)) AND (p14 <= 1)) AND (p24 <= p20))) OR G ((p16 <= p8))) OR (p2 <= p0)))) : (X (NOT(F (((F ((p15 <= p26)) OR (p26 <= p3)) AND (p15 <= p26))))) OR X ((p14 <= p3))) : NOT(G (NOT(X ((X (((1 <= p14) U (3 <= p7))) AND X (((p1 <= 2) U F ((1 <= p14))))))))) : G (X (NOT(((0 <= 0) U X ((3 <= p18)))))) : F (X ((F ((2 <= p24)) U G (F (G ((p20 <= p8))))))) : (F (X ((3 <= p20))) U G ((1 <= p0))) : F (G ((F ((1 <= p9)) U (G (NOT(F (NOT(F ((1 <= p12)))))) OR ((p6 <= p20) U (1 <= p9)))))) : X ((G (NOT(G (X ((p26 <= p10))))) AND G ((((2 <= p7) U (3 <= p8)) U X (G ((3 <= p8)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:338
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p7 <= p8)) U (2 <= p1)) U X (X (G ((F ((1 <= p14)) OR (G ((p21 + 1 <= p15)) AND F ((1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p7 <= p8)) U (2 <= p1)) U X (X (G ((F ((1 <= p14)) OR (G ((p21 + 1 <= p15)) AND F ((1 <= p14))))))))
lola: processed formula length: 106
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 35 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p13 <= p15)) AND F ((3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p13 <= p15)) AND F ((3 <= p4))))
lola: processed formula length: 40
lola: 77 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((X ((p24 <= p20)) AND ((p14 <= 1) AND (p24 <= p20)))) OR (G ((p16 <= p8)) OR (p2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((X ((p24 <= p20)) AND ((p14 <= 1) AND (p24 <= p20)))) OR (G ((p16 <= p8)) OR (p2 <= p0)))))
lola: processed formula length: 101
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 20 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((G ((p26 + 1 <= p15)) AND (p3 + 1 <= p26)) OR (p26 + 1 <= p15))) OR (p14 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((G ((p26 + 1 <= p15)) AND (p3 + 1 <= p26)) OR (p26 + 1 <= p15))) OR (p14 <= p3)))
lola: processed formula length: 89
lola: 77 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p14) U (3 <= p7)) AND F ((1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p14) U (3 <= p7)) AND F ((1 <= p14))))))
lola: processed formula length: 57
lola: 77 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p18 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p18 <= 2))))
lola: processed formula length: 22
lola: 77 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: 10314 markings, 10361 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p20))) U G ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((3 <= p20))) U G ((1 <= p0)))
lola: processed formula length: 36
lola: 77 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: 4274122 markings, 7985365 edges, 854824 markings/sec, 0 secs
lola: 8332837 markings, 15584773 edges, 811743 markings/sec, 5 secs
lola: 12303881 markings, 23021980 edges, 794209 markings/sec, 10 secs
lola: 16250000 markings, 30413475 edges, 789224 markings/sec, 15 secs
lola: 20164572 markings, 37746049 edges, 782914 markings/sec, 20 secs
lola: 23989858 markings, 44911963 edges, 765057 markings/sec, 25 secs
lola: 27753523 markings, 51963115 edges, 752733 markings/sec, 30 secs
lola: 31481724 markings, 58947520 edges, 745640 markings/sec, 35 secs
lola: 35249548 markings, 66006951 edges, 753565 markings/sec, 40 secs
lola: 38922376 markings, 72888534 edges, 734566 markings/sec, 45 secs
lola: 42634466 markings, 79843243 edges, 742418 markings/sec, 50 secs
lola: 46305758 markings, 86722084 edges, 734258 markings/sec, 55 secs
lola: 49961946 markings, 93573082 edges, 731238 markings/sec, 60 secs
lola: 53597868 markings, 100385739 edges, 727184 markings/sec, 65 secs
lola: 57181975 markings, 107101538 edges, 716821 markings/sec, 70 secs
lola: 60898607 markings, 114065668 edges, 743326 markings/sec, 75 secs
lola: 64570728 markings, 120946669 edges, 734424 markings/sec, 80 secs
lola: 68209748 markings, 127765385 edges, 727804 markings/sec, 85 secs
lola: 71829500 markings, 134548202 edges, 723950 markings/sec, 90 secs
lola: 75448848 markings, 141330392 edges, 723870 markings/sec, 95 secs
lola: 77158169 markings, 144535435 edges, 341864 markings/sec, 100 secs
lola: 80420495 markings, 150647962 edges, 652465 markings/sec, 105 secs
lola: 83793016 markings, 156968259 edges, 674504 markings/sec, 110 secs
lola: 85451893 markings, 160075980 edges, 331775 markings/sec, 115 secs
lola: 86160272 markings, 161402763 edges, 141676 markings/sec, 120 secs
lola: 89463106 markings, 167591840 edges, 660567 markings/sec, 125 secs
lola: 91206987 markings, 170860189 edges, 348776 markings/sec, 130 secs
lola: 93530570 markings, 175214880 edges, 464717 markings/sec, 135 secs
lola: 95222642 markings, 178385545 edges, 338414 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((p10 + 1 <= p26))) AND (F (G ((3 <= p8))) AND G ((((2 <= p7) U (3 <= p8)) OR X (G ((3 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((p10 + 1 <= p26))) AND (F (G ((3 <= p8))) AND G ((((2 <= p7) U (3 <= p8)) OR X (G ((3 <= p8))))))))
lola: processed formula length: 109
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 8 will run for 1709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p20 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p20 <= p8)))
lola: processed formula length: 19
lola: 77 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: 4429178 markings, 6675300 edges, 885836 markings/sec, 0 secs
lola: 8671336 markings, 13065324 edges, 848432 markings/sec, 5 secs
lola: 12830109 markings, 19306853 edges, 831755 markings/sec, 10 secs
lola: 17020008 markings, 25597388 edges, 837980 markings/sec, 15 secs
lola: 21277441 markings, 31992795 edges, 851487 markings/sec, 20 secs
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: 22569965 markings, 33946910 edges
lola: ========================================
lola: subprocess 9 will run for 3391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))) AND (F ((1 <= p9)) OR (G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))) AND (F ((1 <= p9)) OR (G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))))))
lola: processed formula length: 136
lola: 77 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: 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: 3826617 markings, 5740767 edges, 765323 markings/sec, 0 secs
lola: 7385291 markings, 11081510 edges, 711735 markings/sec, 5 secs
lola: 10974872 markings, 16467785 edges, 717916 markings/sec, 10 secs
lola: 14553978 markings, 21837781 edges, 715821 markings/sec, 15 secs
lola: 18124030 markings, 27195658 edges, 714010 markings/sec, 20 secs
lola: 21718793 markings, 32588205 edges, 718953 markings/sec, 25 secs
lola: 25267900 markings, 37912805 edges, 709821 markings/sec, 30 secs
lola: 28803915 markings, 43219383 edges, 707203 markings/sec, 35 secs
lola: 32332617 markings, 48512092 edges, 705740 markings/sec, 40 secs
lola: 35837615 markings, 53769833 edges, 701000 markings/sec, 45 secs
lola: 39306015 markings, 58973541 edges, 693680 markings/sec, 50 secs
lola: 42797538 markings, 64212737 edges, 698305 markings/sec, 55 secs
lola: 46256532 markings, 69400297 edges, 691799 markings/sec, 60 secs
lola: 49690002 markings, 74551787 edges, 686694 markings/sec, 65 secs
lola: 53106154 markings, 79677379 edges, 683230 markings/sec, 70 secs
lola: 56530402 markings, 84816707 edges, 684850 markings/sec, 75 secs
lola: 59943440 markings, 89934445 edges, 682608 markings/sec, 80 secs
lola: 63284177 markings, 94945039 edges, 668147 markings/sec, 85 secs
lola: 66659529 markings, 100011935 edges, 675070 markings/sec, 90 secs
lola: 69991219 markings, 105010404 edges, 666338 markings/sec, 95 secs
lola: 72900733 markings, 109374011 edges, 581903 markings/sec, 100 secs
lola: 75897701 markings, 113868914 edges, 599394 markings/sec, 105 secs
lola: 78994274 markings, 118514728 edges, 619315 markings/sec, 110 secs
lola: 82091128 markings, 123161919 edges, 619371 markings/sec, 115 secs
lola: 85091659 markings, 127664266 edges, 600106 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p20))) U G ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((3 <= p20))) U G ((1 <= p0)))
lola: processed formula length: 36
lola: 77 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: 4226815 markings, 7896845 edges, 845363 markings/sec, 0 secs
lola: 8282484 markings, 15490479 edges, 811134 markings/sec, 5 secs
lola: 12273618 markings, 22965511 edges, 798227 markings/sec, 10 secs
lola: 16202009 markings, 30323553 edges, 785678 markings/sec, 15 secs
lola: 20143221 markings, 37705803 edges, 788242 markings/sec, 20 secs
lola: 24020274 markings, 44969067 edges, 775411 markings/sec, 25 secs
lola: 27839742 markings, 52124581 edges, 763894 markings/sec, 30 secs
lola: 31658127 markings, 59278328 edges, 763677 markings/sec, 35 secs
lola: 35485741 markings, 66449125 edges, 765523 markings/sec, 40 secs
lola: 39254333 markings, 73510114 edges, 753718 markings/sec, 45 secs
lola: 42929502 markings, 80396023 edges, 735034 markings/sec, 50 secs
lola: 46661702 markings, 87388894 edges, 746440 markings/sec, 55 secs
lola: 50352414 markings, 94304146 edges, 738142 markings/sec, 60 secs
lola: 54111565 markings, 101347812 edges, 751830 markings/sec, 65 secs
lola: 57867578 markings, 108386180 edges, 751203 markings/sec, 70 secs
lola: 61622528 markings, 115421982 edges, 750990 markings/sec, 75 secs
lola: 65323460 markings, 122357035 edges, 740186 markings/sec, 80 secs
lola: 68995292 markings, 129237113 edges, 734366 markings/sec, 85 secs
lola: 72685377 markings, 136151921 edges, 738017 markings/sec, 90 secs
lola: 76348273 markings, 143015984 edges, 732579 markings/sec, 95 secs
lola: 79659397 markings, 149221905 edges, 662225 markings/sec, 100 secs
lola: 82944014 markings, 155377711 edges, 656923 markings/sec, 105 secs
lola: 86298156 markings, 161661362 edges, 670828 markings/sec, 110 secs
lola: 89674179 markings, 167988090 edges, 675205 markings/sec, 115 secs
lola: 92982173 markings, 174186432 edges, 661599 markings/sec, 120 secs
lola: 95291238 markings, 178513634 edges, 461813 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))) AND (F ((1 <= p9)) OR (G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))) AND (F ((1 <= p9)) OR (G (F ((1 <= p12))) OR ((p6 <= p20) U (1 <= p9)))))))
lola: processed formula length: 136
lola: 77 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: 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: 3760808 markings, 5642163 edges, 752162 markings/sec, 0 secs
lola: 7415888 markings, 11127297 edges, 731016 markings/sec, 5 secs
lola: 11011326 markings, 16522768 edges, 719088 markings/sec, 10 secs
lola: 14524153 markings, 21793341 edges, 702565 markings/sec, 15 secs
lola: 18080622 markings, 27130373 edges, 711294 markings/sec, 20 secs
lola: 21634651 markings, 32462140 edges, 710806 markings/sec, 25 secs
lola: 25132402 markings, 37709980 edges, 699550 markings/sec, 30 secs
lola: 28627102 markings, 42951689 edges, 698940 markings/sec, 35 secs
lola: 32119989 markings, 48192119 edges, 698577 markings/sec, 40 secs
lola: 35573768 markings, 53373512 edges, 690756 markings/sec, 45 secs
lola: 38979764 markings, 58483605 edges, 681199 markings/sec, 50 secs
lola: 42365739 markings, 63565514 edges, 677195 markings/sec, 55 secs
lola: 45812877 markings, 68736280 edges, 689428 markings/sec, 60 secs
lola: 49231911 markings, 73866001 edges, 683807 markings/sec, 65 secs
lola: 52643179 markings, 78983988 edges, 682254 markings/sec, 70 secs
lola: 56054172 markings, 84100435 edges, 682199 markings/sec, 75 secs
lola: 59371766 markings, 89076738 edges, 663519 markings/sec, 80 secs
lola: 62692784 markings, 94059903 edges, 664204 markings/sec, 85 secs
lola: 65987217 markings, 99001052 edges, 658887 markings/sec, 90 secs
lola: 69324217 markings, 104006187 edges, 667400 markings/sec, 95 secs
lola: 72381411 markings, 108595767 edges, 611439 markings/sec, 100 secs
lola: 75383603 markings, 113099134 edges, 600438 markings/sec, 105 secs
lola: 78426183 markings, 117662867 edges, 608516 markings/sec, 110 secs
lola: 81435523 markings, 122176092 edges, 601868 markings/sec, 115 secs
lola: 84447623 markings, 126698546 edges, 602420 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes yes no no no unknown unknown no
lola:
preliminary result: no no yes yes no no no unknown unknown no
lola: memory consumption: 3320 KB
lola: time consumption: 574 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-20480by10240"
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-20480by10240, 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-162038334800233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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