About the Execution of ITS-LoLa for CloudOpsManagement-PT-10240by05120
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15800.110 | 3600000.00 | 1085578.00 | 128582.90 | FFFFF??FFFFTFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806800458.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CloudOpsManagement-PT-10240by05120, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806800458
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.2K Mar 30 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 26 08:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 17K Mar 24 05:37 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 1591374928628
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 16:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 16:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 16:35:31] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2020-06-05 16:35:31] [INFO ] Transformed 27 places.
[2020-06-05 16:35:31] [INFO ] Transformed 29 transitions.
[2020-06-05 16:35:31] [INFO ] Parsed PT model containing 27 places and 29 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102415 steps, including 0 resets, run finished after 77 ms. (steps per millisecond=1330 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 16:35:31] [INFO ] Computed 11 place invariants in 5 ms
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-05 16:35:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 16:35:32] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 17 ms.
[2020-06-05 16:35:32] [INFO ] Added : 25 causal constraints over 6 iterations in 82 ms. Result :sat
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 10 ms.
[2020-06-05 16:35:32] [INFO ] Added : 25 causal constraints over 6 iterations in 72 ms. Result :sat
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 16:35:32] [INFO ] Added : 25 causal constraints over 6 iterations in 52 ms. Result :sat
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:32] [INFO ] Added : 25 causal constraints over 6 iterations in 35 ms. Result :sat
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:32] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 35 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 33 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 46 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 38 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 8 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 38 ms. Result :sat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:33] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-05 16:35:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:33] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 16:35:33] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:34] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 16:35:34] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:34] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:34] [INFO ] Added : 25 causal constraints over 6 iterations in 42 ms. Result :sat
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:35:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-05 16:35:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 16:35:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 16:35:34] [INFO ] Added : 25 causal constraints over 6 iterations in 42 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 16:35:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-05 16:35:35] [INFO ] Flatten gal took : 55 ms
FORMULA CloudOpsManagement-PT-10240by05120-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-10240by05120-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-10240by05120-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 16:35:35] [INFO ] Flatten gal took : 14 ms
[2020-06-05 16:35:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-05 16:35:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-10240by05120 @ 3570 seconds
FORMULA CloudOpsManagement-PT-10240by05120-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-04 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-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-10 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-02 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-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-10240by05120-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2165
rslt: Output for LTLFireability @ 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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 16:35:36 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (((p17 <= 0))) OR X (((p12 <= 0) OR (p17 <= 0)))))",
"processed_size": 57,
"rewrites": 72
},
"result":
{
"edges": 5153,
"markings": 5144,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((1 <= p8) AND (1 <= p9)) OR (G (((1 <= p8) AND (1 <= p9))) AND F (((1 <= p8) AND (1 <= p9))))))",
"processed_size": 100,
"rewrites": 72
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p21))",
"processed_size": 12,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 345
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (X (F (((1 <= p17))))) OR G ((1 <= p3))))",
"processed_size": 47,
"rewrites": 72
},
"result":
{
"edges": 5123,
"markings": 5123,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"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": "(p22 <= 0)",
"processed_size": 10,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p7 <= 0))",
"processed_size": 13,
"rewrites": 72
},
"result":
{
"edges": 266249,
"markings": 138247,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((G ((X ((1 <= p3)) AND (p3 <= 0))) OR (X ((p3 <= 0)) AND (X ((1 <= p3)) AND (p3 <= 0)))))",
"processed_size": 92,
"rewrites": 72
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 517
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p7) OR ((1 <= p21)))) OR ((1 <= p22) U X ((1 <= p18)))))",
"processed_size": 71,
"rewrites": 72
},
"result":
{
"edges": 5123,
"markings": 5123,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 715
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p2)))",
"processed_size": 17,
"rewrites": 72
},
"result":
{
"edges": 20483,
"markings": 20482,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 954
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((1 <= p15) OR ((G (((1 <= p21))) AND F ((1 <= p15))) OR (F (G (((1 <= p21)))) OR ((1 <= p18) U G ((1 <= p18)))))))",
"processed_size": 118,
"rewrites": 72
},
"result":
{
"edges": 30725,
"markings": 30725,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p3) AND (1 <= p4)) AND (((1 <= p3) AND (1 <= p4)) OR ((G ((1 <= p7)) AND F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p20))))))",
"processed_size": 136,
"rewrites": 72
},
"result":
{
"edges": 5131,
"markings": 5129,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"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": 2863
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(F (((p3 <= 0) OR (p4 <= 0))) U G ((G (((1 <= p8) AND (1 <= p25))) AND ((1 <= p0) AND (1 <= p26)))))",
"processed_size": 101,
"rewrites": 72
},
"result":
{
"edges": 87034,
"markings": 46082,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p21))",
"processed_size": 12,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 2912,
"runtime": 1405.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) U G((G(**) AND (** AND **)))) : F(G(**)) : G((F(*) OR X(*))) : (X((** OR (G(**) AND F(**)))) AND (G((G(**) OR **)) OR F(**))) : G((G((X(*) AND (* AND *))) AND X(G(*)))) : (F(G((F((X(**) OR **)) AND (** OR (X(**) OR **))))) OR **) : X((X(X(F(**))) OR G(**))) : (X(*) AND (G(*) AND **)) : F((G((X(*) AND *)) OR (X(*) AND (X(*) AND *)))) : F(G((** AND (** OR ((G(**) AND F(**)) OR **))))) : F((** OR ((G(**) AND F(**)) OR (F(G(**)) OR (** U G(**)))))) : X((F(**) OR (** U X(**)))) : X((G(*) OR **))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no no unknown unknown no no no no no no unknown ",
"value": "no no no no unknown unknown no no no no no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p19)
lola: LP says that atomic proposition is always true: (1 <= p19)
lola: LP says that atomic proposition is always true: (1 <= p19)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p19)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: (F ((F (((G (((1 <= p3) AND (1 <= p4))) AND (1 <= p6)) AND (1 <= p26))) U ((p3 <= 0) OR (p4 <= 0)))) U G (((G (((1 <= p8) AND (1 <= p25))) AND (1 <= p0)) AND (1 <= p26)))) : F (NOT(X (F (G (NOT(G ((1 <= p2)))))))) : NOT(F ((((1 <= p17)) U ((1 <= p12) U (G (((1 <= p17))) AND X (((1 <= p12) AND (1 <= p17)))))))) : (X ((G (((1 <= p8) AND (1 <= p9))) U ((1 <= p8) AND (1 <= p9)))) AND (G ((G ((p18 <= 0)) OR ((1 <= p8) AND (1 <= p9)))) OR F ((1 <= p22)))) : NOT(F ((F (((X (((1 <= p10) AND (1 <= p25))) OR (1 <= p22)) OR (1 <= p22))) OR X ((((1 <= p10) AND (1 <= p25)) U F ((1 <= p22))))))) : (F (G (X ((((1 <= p5) AND (1 <= p7) AND (1 <= p26)) U (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9))))))) OR ((1 <= p21))) : X ((F (X (X (((1 <= p17))))) OR G ((1 <= p3)))) : ((NOT(X (((1 <= p8) AND (1 <= p25)))) AND NOT(F ((1 <= p7)))) AND (p22 <= 0)) : NOT(G ((X ((1 <= p3)) U (X ((p3 <= 0)) OR (1 <= p3))))) : F (G ((((1 <= p3) AND (1 <= p4)) AND ((G ((1 <= p7)) U ((1 <= p3) AND (1 <= p4))) OR (1 <= p20))))) : F ((((G (((1 <= p21))) U (1 <= p15)) OR F (G (((1 <= p21))))) OR ((1 <= p18) U G ((1 <= p18))))) : (X (F (((1 <= p7) OR ((1 <= p21))))) OR (X ((1 <= p22)) U X (X ((1 <= p18))))) : X ((NOT(F ((1 <= p24))) OR ((1 <= p3) AND (1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p17 <= 0))) OR X (((p12 <= 0) OR (p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p17 <= 0))) OR X (((p12 <= 0) OR (p17 <= 0)))))
lola: processed formula length: 57
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 5144 markings, 5153 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p8) AND (1 <= p9)) OR (G (((1 <= p8) AND (1 <= p9))) AND F (((1 <= p8) AND (1 <= p9)))))) AND (G ((G ((p18 <= 0)) OR ((1 <= p8) AND (1 <= p9)))) OR F ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p8) AND (1 <= p9)) OR (G (((1 <= p8) AND (1 <= p9))) AND F (((1 <= p8) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p8) AND (1 <= p9)) OR (G (((1 <= p8) AND (1 <= p9))) AND F (((1 <= p8) AND (1 <= p9))))))
lola: processed formula length: 100
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X (((p10 <= 0) OR (p25 <= 0))) AND ((p22 <= 0) AND (p22 <= 0)))) AND X (G ((p22 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (((p10 <= 0) OR (p25 <= 0))) AND ((p22 <= 0) AND (p22 <= 0)))) AND X (G ((p22 <= 0)))))
lola: processed formula length: 98
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 3210589 markings, 4842077 edges, 642118 markings/sec, 0 secs
lola: 6403012 markings, 9647501 edges, 638485 markings/sec, 5 secs
lola: 9513464 markings, 14326880 edges, 622090 markings/sec, 10 secs
lola: 12648290 markings, 19041429 edges, 626965 markings/sec, 15 secs
lola: 15758250 markings, 23717574 edges, 621992 markings/sec, 20 secs
lola: 18844783 markings, 28357899 edges, 617307 markings/sec, 25 secs
lola: 21850338 markings, 32875706 edges, 601111 markings/sec, 30 secs
lola: 24741264 markings, 37221138 edges, 578185 markings/sec, 35 secs
lola: 27746154 markings, 41737322 edges, 600978 markings/sec, 40 secs
lola: 30589075 markings, 46009560 edges, 568584 markings/sec, 45 secs
lola: 33523013 markings, 50418714 edges, 586788 markings/sec, 50 secs
lola: 36339625 markings, 54651134 edges, 563322 markings/sec, 55 secs
lola: 39357209 markings, 59185408 edges, 603517 markings/sec, 60 secs
lola: 42333772 markings, 63657761 edges, 595313 markings/sec, 65 secs
lola: 45293085 markings, 68104083 edges, 591863 markings/sec, 70 secs
lola: 48031401 markings, 72218133 edges, 547663 markings/sec, 75 secs
lola: 51013559 markings, 76698814 edges, 596432 markings/sec, 80 secs
lola: 53931560 markings, 81082527 edges, 583600 markings/sec, 85 secs
lola: 56796016 markings, 85385546 edges, 572891 markings/sec, 90 secs
lola: 59546514 markings, 89517652 edges, 550100 markings/sec, 95 secs
lola: 62493894 markings, 93945289 edges, 589476 markings/sec, 100 secs
lola: 65377730 markings, 98277213 edges, 576767 markings/sec, 105 secs
lola: 68232877 markings, 102566120 edges, 571029 markings/sec, 110 secs
lola: 71051693 markings, 106800262 edges, 563763 markings/sec, 115 secs
lola: 73415052 markings, 110351507 edges, 472672 markings/sec, 120 secs
lola: 73870300 markings, 111035199 edges, 91050 markings/sec, 125 secs
lola: 75810176 markings, 113952863 edges, 387975 markings/sec, 130 secs
lola: 77007886 markings, 115748272 edges, 239542 markings/sec, 135 secs
lola: 78308482 markings, 117700669 edges, 260119 markings/sec, 140 secs
lola: 79850291 markings, 120016444 edges, 308362 markings/sec, 145 secs
lola: 80644145 markings, 121209166 edges, 158771 markings/sec, 150 secs
lola: 81678342 markings, 122762315 edges, 206839 markings/sec, 155 secs
lola: 83676026 markings, 125762829 edges, 399537 markings/sec, 160 secs
lola: 85991839 markings, 129241278 edges, 463163 markings/sec, 165 secs
lola: 88355003 markings, 132790588 edges, 472633 markings/sec, 170 secs
lola: 88477087 markings, 132973979 edges, 24417 markings/sec, 175 secs
lola: 89639807 markings, 134720288 edges, 232544 markings/sec, 180 secs
lola: 89825360 markings, 134999011 edges, 37111 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9))))))) OR ((1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21))
lola: processed formula length: 12
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 4 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))))))
lola: processed formula length: 227
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
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: 2945968 markings, 4443446 edges, 589194 markings/sec, 0 secs
lola: 5917796 markings, 8917212 edges, 594366 markings/sec, 5 secs
lola: 8591330 markings, 12939684 edges, 534707 markings/sec, 10 secs
lola: 11440055 markings, 17224298 edges, 569745 markings/sec, 15 secs
lola: 14330034 markings, 21570112 edges, 577996 markings/sec, 20 secs
lola: 17173257 markings, 25845014 edges, 568645 markings/sec, 25 secs
lola: 19975794 markings, 30058068 edges, 560507 markings/sec, 30 secs
lola: 22770229 markings, 34258570 edges, 558887 markings/sec, 35 secs
lola: 25533476 markings, 38411613 edges, 552649 markings/sec, 40 secs
lola: 28267542 markings, 42520875 edges, 546813 markings/sec, 45 secs
lola: 30988101 markings, 46609425 edges, 544112 markings/sec, 50 secs
lola: 33667527 markings, 50635977 edges, 535885 markings/sec, 55 secs
lola: 35794744 markings, 53832447 edges, 425443 markings/sec, 60 secs
lola: 38540331 markings, 57957977 edges, 549117 markings/sec, 65 secs
lola: 41330874 markings, 62150893 edges, 558109 markings/sec, 70 secs
lola: 44092280 markings, 66300070 edges, 552281 markings/sec, 75 secs
lola: 46790113 markings, 70353355 edges, 539567 markings/sec, 80 secs
lola: 49522174 markings, 74458043 edges, 546412 markings/sec, 85 secs
lola: 52237543 markings, 78537352 edges, 543074 markings/sec, 90 secs
lola: 54924468 markings, 82573951 edges, 537385 markings/sec, 95 secs
lola: 57559969 markings, 86533291 edges, 527100 markings/sec, 100 secs
lola: 60218230 markings, 90526737 edges, 531652 markings/sec, 105 secs
lola: 62950370 markings, 94631103 edges, 546428 markings/sec, 110 secs
lola: 65639334 markings, 98670298 edges, 537793 markings/sec, 115 secs
lola: 68287264 markings, 102647862 edges, 529586 markings/sec, 120 secs
lola: 70923795 markings, 106608218 edges, 527306 markings/sec, 125 secs
lola: 73423463 markings, 110365281 edges, 499934 markings/sec, 130 secs
lola: 75654499 markings, 113715754 edges, 446207 markings/sec, 135 secs
lola: 75751218 markings, 113859535 edges, 19344 markings/sec, 140 secs
lola: 76562002 markings, 115077392 edges, 162157 markings/sec, 145 secs
lola: 78095463 markings, 117380800 edges, 306692 markings/sec, 150 secs
lola: 80122157 markings, 120425092 edges, 405339 markings/sec, 155 secs
lola: 80232648 markings, 120590931 edges, 22098 markings/sec, 160 secs
lola: 81002967 markings, 121747987 edges, 154064 markings/sec, 165 secs
lola: 82575258 markings, 124109556 edges, 314458 markings/sec, 170 secs
lola: 82575258 markings, 124109556 edges, 0 markings/sec, 175 secs
lola: 84376410 markings, 126814724 edges, 360230 markings/sec, 180 secs
lola: 84877089 markings, 127566748 edges, 100136 markings/sec, 185 secs
lola: 85294993 markings, 128194473 edges, 83581 markings/sec, 190 secs
lola: 87297549 markings, 131202429 edges, 400511 markings/sec, 195 secs
lola: 89450867 markings, 134436508 edges, 430664 markings/sec, 200 secs
lola: 89563995 markings, 134606367 edges, 22626 markings/sec, 205 secs
lola: 89710608 markings, 134826666 edges, 29323 markings/sec, 210 secs
lola: 89811894 markings, 134978773 edges, 20257 markings/sec, 215 secs
lola: 89818819 markings, 134989288 edges, 1385 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (F (((1 <= p17))))) OR G ((1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (F (((1 <= p17))))) OR G ((1 <= p3))))
lola: processed formula length: 47
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5123 markings, 5123 edges
lola: ========================================
lola: subprocess 5 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p8 <= 0) OR (p25 <= 0))) AND (G ((p7 <= 0)) AND (p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p22 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= 0)
lola: processed formula length: 10
lola: 72 rewrites
lola: closed formula file LTLFireability.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 6 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p7 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p7 <= 0))
lola: processed formula length: 13
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 138247 markings, 266249 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((X ((1 <= p3)) AND (p3 <= 0))) OR (X ((p3 <= 0)) AND (X ((1 <= p3)) AND (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((X ((1 <= p3)) AND (p3 <= 0))) OR (X ((p3 <= 0)) AND (X ((1 <= p3)) AND (p3 <= 0)))))
lola: processed formula length: 92
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 7 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p7) OR ((1 <= p21)))) OR ((1 <= p22) U X ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p7) OR ((1 <= p21)))) OR ((1 <= p22) U X ((1 <= p18)))))
lola: processed formula length: 71
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 5123 markings, 5123 edges
lola: ========================================
lola: subprocess 8 will run for 621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p24 <= 0)) OR ((1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p24 <= 0)) OR ((1 <= p3) AND (1 <= p4))))
lola: processed formula length: 49
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 3121014 markings, 4707106 edges, 624203 markings/sec, 0 secs
lola: 6309487 markings, 9506742 edges, 637695 markings/sec, 5 secs
lola: 9413464 markings, 14176442 edges, 620795 markings/sec, 10 secs
lola: 12502964 markings, 18822825 edges, 617900 markings/sec, 15 secs
lola: 15539394 markings, 23388624 edges, 607286 markings/sec, 20 secs
lola: 18449950 markings, 27764302 edges, 582111 markings/sec, 25 secs
lola: 21465313 markings, 32296987 edges, 603073 markings/sec, 30 secs
lola: 24301279 markings, 36559803 edges, 567193 markings/sec, 35 secs
lola: 27311514 markings, 41084109 edges, 602047 markings/sec, 40 secs
lola: 30279188 markings, 45543997 edges, 593535 markings/sec, 45 secs
lola: 33216242 markings, 49957633 edges, 587411 markings/sec, 50 secs
lola: 36152258 markings, 54369635 edges, 587203 markings/sec, 55 secs
lola: 39161401 markings, 58891179 edges, 601829 markings/sec, 60 secs
lola: 41993044 markings, 63145913 edges, 566329 markings/sec, 65 secs
lola: 44960533 markings, 67604380 edges, 593498 markings/sec, 70 secs
lola: 47879601 markings, 71990202 edges, 583814 markings/sec, 75 secs
lola: 50853048 markings, 76457385 edges, 594689 markings/sec, 80 secs
lola: 53776794 markings, 80849787 edges, 584749 markings/sec, 85 secs
lola: 56673255 markings, 85201344 edges, 579292 markings/sec, 90 secs
lola: 59544500 markings, 89514516 edges, 574249 markings/sec, 95 secs
lola: 62528395 markings, 93997153 edges, 596779 markings/sec, 100 secs
lola: 65450450 markings, 98386521 edges, 584411 markings/sec, 105 secs
lola: 68325007 markings, 102704565 edges, 574911 markings/sec, 110 secs
lola: 71178121 markings, 106990473 edges, 570623 markings/sec, 115 secs
lola: 73817300 markings, 110956555 edges, 527836 markings/sec, 120 secs
lola: 74404576 markings, 111836936 edges, 117455 markings/sec, 125 secs
lola: 76705740 markings, 115297079 edges, 460233 markings/sec, 130 secs
lola: 79172848 markings, 119000056 edges, 493422 markings/sec, 135 secs
lola: 81485106 markings, 122472034 edges, 462452 markings/sec, 140 secs
lola: 81585374 markings, 122622775 edges, 20054 markings/sec, 145 secs
lola: 81585374 markings, 122622775 edges, 0 markings/sec, 150 secs
lola: 83263895 markings, 125143861 edges, 335704 markings/sec, 155 secs
lola: 83861507 markings, 126041426 edges, 119522 markings/sec, 160 secs
lola: 83861507 markings, 126041426 edges, 0 markings/sec, 165 secs
lola: 84836448 markings, 127505781 edges, 194988 markings/sec, 170 secs
lola: 86290433 markings, 129689538 edges, 290797 markings/sec, 175 secs
lola: 86306094 markings, 129713269 edges, 3132 markings/sec, 180 secs
lola: 87649460 markings, 131730976 edges, 268673 markings/sec, 185 secs
lola: 88256752 markings, 132643086 edges, 121458 markings/sec, 190 secs
lola: 89246245 markings, 134129264 edges, 197899 markings/sec, 195 secs
lola: 89806142 markings, 134970286 edges, 111979 markings/sec, 200 secs
lola: 89913102 markings, 135130768 edges, 21392 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p2)))
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 <= p2)))
lola: processed formula length: 17
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20482 markings, 20483 edges
lola: ========================================
lola: subprocess 10 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p15) OR ((G (((1 <= p21))) AND F ((1 <= p15))) OR (F (G (((1 <= p21)))) OR ((1 <= p18) U G ((1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p15) OR ((G (((1 <= p21))) AND F ((1 <= p15))) OR (F (G (((1 <= p21)))) OR ((1 <= p18) U G ((1 <= p18)))))))
lola: processed formula length: 118
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 30725 markings, 30725 edges
lola: ========================================
lola: subprocess 11 will run for 1431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p3) AND (1 <= p4)) AND (((1 <= p3) AND (1 <= p4)) OR ((G ((1 <= p7)) AND F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p3) AND (1 <= p4)) AND (((1 <= p3) AND (1 <= p4)) OR ((G ((1 <= p7)) AND F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p20))))))
lola: processed formula length: 136
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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 2
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: 5129 markings, 5131 edges
lola: ========================================
lola: subprocess 12 will run for 2863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p3 <= 0) OR (p4 <= 0))) U G ((G (((1 <= p8) AND (1 <= p25))) AND ((1 <= p0) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p3 <= 0) OR (p4 <= 0))) U G ((G (((1 <= p8) AND (1 <= p25))) AND ((1 <= p0) AND (1 <= p26)))))
lola: processed formula length: 101
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46082 markings, 87034 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G ((X (((p10 <= 0) OR (p25 <= 0))) AND ((p22 <= 0) AND (p22 <= 0)))) AND X (G ((p22 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (((p10 <= 0) OR (p25 <= 0))) AND ((p22 <= 0) AND (p22 <= 0)))) AND X (G ((p22 <= 0)))))
lola: processed formula length: 98
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 3076082 markings, 4639458 edges, 615216 markings/sec, 0 secs
lola: 6114685 markings, 9213550 edges, 607721 markings/sec, 5 secs
lola: 9170325 markings, 13810668 edges, 611128 markings/sec, 10 secs
lola: 12126547 markings, 18256779 edges, 591244 markings/sec, 15 secs
lola: 15251645 markings, 22955884 edges, 625020 markings/sec, 20 secs
lola: 18335072 markings, 27591618 edges, 616685 markings/sec, 25 secs
lola: 21359680 markings, 32138346 edges, 604922 markings/sec, 30 secs
lola: 24424878 markings, 36745465 edges, 613040 markings/sec, 35 secs
lola: 27436558 markings, 41271890 edges, 602336 markings/sec, 40 secs
lola: 30310095 markings, 45590399 edges, 574707 markings/sec, 45 secs
lola: 33249774 markings, 50008098 edges, 587936 markings/sec, 50 secs
lola: 36196822 markings, 54436541 edges, 589410 markings/sec, 55 secs
lola: 39181576 markings, 58921467 edges, 596951 markings/sec, 60 secs
lola: 42166317 markings, 63406329 edges, 596948 markings/sec, 65 secs
lola: 45107606 markings, 67825654 edges, 588258 markings/sec, 70 secs
lola: 47990145 markings, 72156226 edges, 576508 markings/sec, 75 secs
lola: 50951587 markings, 76605627 edges, 592288 markings/sec, 80 secs
lola: 53551473 markings, 80511510 edges, 519977 markings/sec, 85 secs
lola: 56433744 markings, 84841483 edges, 576454 markings/sec, 90 secs
lola: 59299768 markings, 89147000 edges, 573205 markings/sec, 95 secs
lola: 62266086 markings, 93603014 edges, 593264 markings/sec, 100 secs
lola: 65134738 markings, 97912347 edges, 573730 markings/sec, 105 secs
lola: 67981079 markings, 102188036 edges, 569268 markings/sec, 110 secs
lola: 70667933 markings, 106224086 edges, 537371 markings/sec, 115 secs
lola: 73282966 markings, 110152561 edges, 523007 markings/sec, 120 secs
lola: 74592203 markings, 112118638 edges, 261847 markings/sec, 125 secs
lola: 76904555 markings, 115591803 edges, 462470 markings/sec, 130 secs
lola: 76996711 markings, 115730220 edges, 18431 markings/sec, 135 secs
lola: 76996711 markings, 115730220 edges, 0 markings/sec, 140 secs
lola: 79011106 markings, 118756018 edges, 402879 markings/sec, 145 secs
lola: 79404339 markings, 119346671 edges, 78647 markings/sec, 150 secs
lola: 79404339 markings, 119346671 edges, 0 markings/sec, 155 secs
lola: 79992250 markings, 120229711 edges, 117582 markings/sec, 160 secs
lola: 81901433 markings, 123097389 edges, 381837 markings/sec, 165 secs
lola: 81901433 markings, 123097389 edges, 0 markings/sec, 170 secs
lola: 82714885 markings, 124319265 edges, 162690 markings/sec, 175 secs
lola: 84097899 markings, 126396670 edges, 276603 markings/sec, 180 secs
lola: 86232321 markings, 129602548 edges, 426884 markings/sec, 185 secs
lola: 86366039 markings, 129803067 edges, 26744 markings/sec, 190 secs
lola: 86366039 markings, 129803067 edges, 0 markings/sec, 195 secs
lola: 87951937 markings, 132185109 edges, 317180 markings/sec, 200 secs
lola: 89834706 markings, 135013105 edges, 376554 markings/sec, 205 secs
lola: 89837950 markings, 135018061 edges, 649 markings/sec, 210 secs
lola: 89911313 markings, 135127993 edges, 14673 markings/sec, 215 secs
lola: 89919188 markings, 135139932 edges, 1575 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9))))))) OR ((1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21))
lola: processed formula length: 12
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (X ((((1 <= p21)) OR ((1 <= p10) AND (1 <= p25)))) OR ((1 <= p8) AND (1 <= p9)))))))
lola: processed formula length: 227
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 3102343 markings, 4678976 edges, 620469 markings/sec, 0 secs
lola: 6071691 markings, 9148829 edges, 593870 markings/sec, 5 secs
lola: 8958595 markings, 13492222 edges, 577381 markings/sec, 10 secs
lola: 11816140 markings, 17790047 edges, 571509 markings/sec, 15 secs
lola: 14686477 markings, 22106127 edges, 574067 markings/sec, 20 secs
lola: 17521595 markings, 26368685 edges, 567024 markings/sec, 25 secs
lola: 20330507 markings, 30591238 edges, 561782 markings/sec, 30 secs
lola: 23126262 markings, 34793545 edges, 559151 markings/sec, 35 secs
lola: 25916960 markings, 38988082 edges, 558140 markings/sec, 40 secs
lola: 28670332 markings, 43126231 edges, 550674 markings/sec, 45 secs
lola: 31426369 markings, 47267970 edges, 551207 markings/sec, 50 secs
lola: 33992668 markings, 51124411 edges, 513260 markings/sec, 55 secs
lola: 36695656 markings, 55186129 edges, 540598 markings/sec, 60 secs
lola: 39472315 markings, 59358308 edges, 555332 markings/sec, 65 secs
lola: 42233019 markings, 63506456 edges, 552141 markings/sec, 70 secs
lola: 44966003 markings, 67612720 edges, 546597 markings/sec, 75 secs
lola: 47666733 markings, 71670340 edges, 540146 markings/sec, 80 secs
lola: 50430016 markings, 75821825 edges, 552657 markings/sec, 85 secs
lola: 53140385 markings, 79893871 edges, 542074 markings/sec, 90 secs
lola: 55833597 markings, 83939880 edges, 538642 markings/sec, 95 secs
lola: 58470938 markings, 87901893 edges, 527468 markings/sec, 100 secs
lola: 61166242 markings, 91950714 edges, 539061 markings/sec, 105 secs
lola: 63885819 markings, 96036360 edges, 543915 markings/sec, 110 secs
lola: 66544853 markings, 100030482 edges, 531807 markings/sec, 115 secs
lola: 69215886 markings, 104042842 edges, 534207 markings/sec, 120 secs
lola: 71857623 markings, 108010966 edges, 528347 markings/sec, 125 secs
lola: 73561938 markings, 110573790 edges, 340863 markings/sec, 130 secs
lola: 74854401 markings, 112512667 edges, 258493 markings/sec, 135 secs
lola: 76175860 markings, 114497480 edges, 264292 markings/sec, 140 secs
lola: 77142911 markings, 115949887 edges, 193410 markings/sec, 145 secs
lola: 78598453 markings, 118136324 edges, 291108 markings/sec, 150 secs
lola: 78968587 markings, 118692072 edges, 74027 markings/sec, 155 secs
lola: 80307362 markings, 120703150 edges, 267755 markings/sec, 160 secs
lola: 81534977 markings, 122547124 edges, 245523 markings/sec, 165 secs
lola: 82502232 markings, 123999852 edges, 193451 markings/sec, 170 secs
lola: 83865317 markings, 126047054 edges, 272617 markings/sec, 175 secs
lola: 85102670 markings, 127905710 edges, 247471 markings/sec, 180 secs
lola: 86487035 markings, 129985073 edges, 276873 markings/sec, 185 secs
lola: 87328724 markings, 131249160 edges, 168338 markings/sec, 190 secs
lola: 88776720 markings, 133424122 edges, 289599 markings/sec, 195 secs
lola: 89624090 markings, 134696846 edges, 169474 markings/sec, 200 secs
lola: 89883508 markings, 135086297 edges, 51884 markings/sec, 205 secs
lola: 89892663 markings, 135100069 edges, 1831 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((p24 <= 0)) OR ((1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p24 <= 0)) OR ((1 <= p3) AND (1 <= p4))))
lola: processed formula length: 49
lola: 72 rewrites
lola: closed formula file LTLFireability.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: 3233540 markings, 4876614 edges, 646708 markings/sec, 0 secs
lola: 6422926 markings, 9677414 edges, 637877 markings/sec, 5 secs
lola: 9403862 markings, 14162031 edges, 596187 markings/sec, 10 secs
lola: 12523237 markings, 18853276 edges, 623875 markings/sec, 15 secs
lola: 15627329 markings, 23520743 edges, 620818 markings/sec, 20 secs
lola: 18710865 markings, 28156414 edges, 616707 markings/sec, 25 secs
lola: 21688584 markings, 32632678 edges, 595544 markings/sec, 30 secs
lola: 24712862 markings, 37178364 edges, 604856 markings/sec, 35 secs
lola: 27669436 markings, 41621973 edges, 591315 markings/sec, 40 secs
lola: 30623945 markings, 46062069 edges, 590902 markings/sec, 45 secs
lola: 33548603 markings, 50457133 edges, 584932 markings/sec, 50 secs
lola: 36456710 markings, 54827168 edges, 581621 markings/sec, 55 secs
lola: 39437840 markings, 59306615 edges, 596226 markings/sec, 60 secs
lola: 42411000 markings, 63773907 edges, 594632 markings/sec, 65 secs
lola: 45361716 markings, 68207322 edges, 590143 markings/sec, 70 secs
lola: 48287203 markings, 72602615 edges, 585097 markings/sec, 75 secs
lola: 51259639 markings, 77068392 edges, 594487 markings/sec, 80 secs
lola: 54200750 markings, 81486895 edges, 588222 markings/sec, 85 secs
lola: 57090920 markings, 85828726 edges, 578034 markings/sec, 90 secs
lola: 59960256 markings, 90139097 edges, 573867 markings/sec, 95 secs
lola: 62941772 markings, 94618093 edges, 596303 markings/sec, 100 secs
lola: 65842817 markings, 98975989 edges, 580209 markings/sec, 105 secs
lola: 68733742 markings, 103318587 edges, 578185 markings/sec, 110 secs
lola: 71602276 markings, 107627614 edges, 573707 markings/sec, 115 secs
lola: 73630232 markings, 110676043 edges, 405591 markings/sec, 120 secs
lola: 75198541 markings, 113029390 edges, 313662 markings/sec, 125 secs
lola: 77530820 markings, 116535009 edges, 466456 markings/sec, 130 secs
lola: 79842985 markings, 120006126 edges, 462433 markings/sec, 135 secs
lola: 82257035 markings, 123631599 edges, 482810 markings/sec, 140 secs
lola: 82369221 markings, 123799945 edges, 22437 markings/sec, 145 secs
lola: 83266471 markings, 125147669 edges, 179450 markings/sec, 150 secs
lola: 84882193 markings, 127574382 edges, 323144 markings/sec, 155 secs
lola: 87188557 markings, 131038655 edges, 461273 markings/sec, 160 secs
lola: 87339490 markings, 131265199 edges, 30187 markings/sec, 165 secs
lola: 88143113 markings, 132472542 edges, 160725 markings/sec, 170 secs
lola: 89679611 markings, 134780177 edges, 307300 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no unknown unknown no no no no no no unknown
lola:
preliminary result: no no no no unknown unknown no no no no no no unknown
lola: memory consumption: 2912 KB
lola: time consumption: 1405 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is CloudOpsManagement-PT-10240by05120, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806800458"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;