About the Execution of ITS-LoLa for CloudOpsManagement-PT-00160by00080
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15797.250 | 3600000.00 | 718913.00 | 42373.00 | FTFFFTFFTFFF?FFT | 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-158987806700409.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-00160by00080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806700409
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.5K Mar 30 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:06 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.0K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 27 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 26 08:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 26 08:11 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-00160by00080-00
FORMULA_NAME CloudOpsManagement-PT-00160by00080-01
FORMULA_NAME CloudOpsManagement-PT-00160by00080-02
FORMULA_NAME CloudOpsManagement-PT-00160by00080-03
FORMULA_NAME CloudOpsManagement-PT-00160by00080-04
FORMULA_NAME CloudOpsManagement-PT-00160by00080-05
FORMULA_NAME CloudOpsManagement-PT-00160by00080-06
FORMULA_NAME CloudOpsManagement-PT-00160by00080-07
FORMULA_NAME CloudOpsManagement-PT-00160by00080-08
FORMULA_NAME CloudOpsManagement-PT-00160by00080-09
FORMULA_NAME CloudOpsManagement-PT-00160by00080-10
FORMULA_NAME CloudOpsManagement-PT-00160by00080-11
FORMULA_NAME CloudOpsManagement-PT-00160by00080-12
FORMULA_NAME CloudOpsManagement-PT-00160by00080-13
FORMULA_NAME CloudOpsManagement-PT-00160by00080-14
FORMULA_NAME CloudOpsManagement-PT-00160by00080-15
=== Now, execution of the tool begins
BK_START 1591338538226
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:29:00] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-06-05 06:29:00] [INFO ] Transformed 27 places.
[2020-06-05 06:29:00] [INFO ] Transformed 29 transitions.
[2020-06-05 06:29:00] [INFO ] Parsed PT model containing 27 places and 29 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100158 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=1001 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 06:29:01] [INFO ] Computed 11 place invariants in 6 ms
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-05 06:29:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-05 06:29:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 06:29:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:01] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-05 06:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-06-05 06:29:01] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 06:29:01] [INFO ] Added : 26 causal constraints over 6 iterations in 58 ms. Result :sat
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:01] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 14 ms.
[2020-06-05 06:29:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:01] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2020-06-05 06:29:01] [INFO ] Added : 25 causal constraints over 6 iterations in 60 ms. Result :sat
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-05 06:29:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:01] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 06:29:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:01] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 06:29:01] [INFO ] Added : 25 causal constraints over 6 iterations in 56 ms. Result :sat
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 06:29:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2020-06-05 06:29:02] [INFO ] Added : 25 causal constraints over 6 iterations in 48 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Added 3 Read/Feed constraints in 9 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:02] [INFO ] Added : 25 causal constraints over 6 iterations in 35 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 06:29:02] [INFO ] Added : 25 causal constraints over 6 iterations in 42 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:02] [INFO ] Added : 22 causal constraints over 5 iterations in 24 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 06:29:02] [INFO ] Added : 25 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:02] [INFO ] Added : 25 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:02] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 06:29:02] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-05 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 06:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:03] [INFO ] Added : 25 causal constraints over 6 iterations in 83 ms. Result :sat
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-05 06:29:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:03] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:03] [INFO ] Added : 25 causal constraints over 6 iterations in 31 ms. Result :sat
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 06:29:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:29:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-05 06:29:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 06:29:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 06:29:03] [INFO ] Added : 25 causal constraints over 6 iterations in 35 ms. Result :sat
[2020-06-05 06:29:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2020-06-05 06:29:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 06:29:03] [INFO ] Flatten gal took : 35 ms
FORMULA CloudOpsManagement-PT-00160by00080-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00160by00080-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00160by00080-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00160by00080-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:29:03] [INFO ] Flatten gal took : 11 ms
[2020-06-05 06:29:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 06:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00160by00080 @ 3570 seconds
FORMULA CloudOpsManagement-PT-00160by00080-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00160by00080-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2757
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00160by00080
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 06:29:05 2020
",
"timelimit": 3570
},
"child":
[
{
"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": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p21 <= 2)))",
"processed_size": 18,
"rewrites": 71
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 1,
"visible_transitions": 0
},
"processed": "F (G ((X ((p8 <= 0)) OR (p8 <= 0))))",
"processed_size": 36,
"rewrites": 71
},
"result":
{
"edges": 87,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X ((3 <= p26)) U (G ((2 <= p4)) OR (G ((G (F ((p10 <= p5))) OR F ((p10 <= p5)))) AND F (G ((2 <= p4))))))",
"processed_size": 106,
"rewrites": 71
},
"result":
{
"edges": 181,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 57
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((((p24 + 1 <= p12)) AND (3 <= p25)))))",
"processed_size": 47,
"rewrites": 71
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p5 + 1 <= p12)",
"processed_size": 15,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p12 <= p5)",
"processed_size": 11,
"rewrites": 73
},
"result":
{
"edges": 328,
"markings": 328,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((p21 <= 0))))",
"processed_size": 22,
"rewrites": 71
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((p5 <= 0))) R F (((p18 + 1 <= p22) AND (p5 <= 0))))))",
"processed_size": 66,
"rewrites": 71
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p1 <= p7)",
"processed_size": 10,
"rewrites": 73
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((p10 <= p8) AND (p8 <= 0))))",
"processed_size": 35,
"rewrites": 71
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p2 <= 2) AND (F ((p22 <= 2)) OR G ((p2 <= 2)))))",
"processed_size": 53,
"rewrites": 71
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p14 <= p10)))",
"processed_size": 20,
"rewrites": 71
},
"result":
{
"edges": 95,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p6) OR (p14 <= p1))))",
"processed_size": 35,
"rewrites": 71
},
"result":
{
"edges": 1459206,
"markings": 789283,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3384,
"runtime": 813.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (X(F(*)) OR G((F(**) AND (F(**) OR X(F(**)))))) : F(G((X(*) OR *))) : (X(**) U (G(**) OR (G((G(F(**)) OR F(**))) AND F(G(**))))) : X(X(G(*))) : (X(X(G(*))) OR (** OR (F(**) AND F(*)))) : X(X((X(F(*)) R F(*)))) : (X(G(**)) AND F(*)) : F(G(**)) : G(F(**)) : X(G(**)) : X((* AND (F(*) OR G(*))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no yes no no no no no no unknown no no yes ",
"value": "no yes no no no no no no unknown no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (2 <= p23)
lola: F (G (((2 <= p6) OR (p14 <= p1)))) : (X (NOT(G ((3 <= p21)))) OR G ((F ((p24 <= p15)) U X (F ((p1 <= p15)))))) : X (F (NOT(((0 <= 0) U (X ((1 <= p8)) AND (1 <= p8)))))) : (X ((3 <= p26)) U (G ((G (X (G (F ((p10 <= p5))))) OR F ((p10 <= p5)))) U G ((2 <= p4)))) : X (NOT(((0 <= 0) U ((3 <= p25) U X ((((p12 <= p24)) OR (p25 <= 2))))))) : ((NOT(F (X (X ((1 <= p21))))) OR (p5 + 1 <= p12)) OR (((0 <= 0) U (p15 <= p24)) AND NOT(G ((p12 <= p5))))) : NOT(X (X ((G (X ((1 <= p5))) U G (((p22 <= p18) OR (1 <= p5))))))) : (X (G ((p18 <= p26))) AND ((p20 <= p24) U NOT(G ((p1 <= p7))))) : G (F (G (X (G (((((p5 <= p7) AND (2 <= p10)) U (0 <= 0)) AND X ((p6 <= p0)))))))) : G ((X (X (((1 <= p8)))) U G (F ((p14 <= p10))))) : X (G (((p10 <= p8) AND (p8 <= 0)))) : X (NOT((G ((3 <= p22)) U (3 <= p2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p21 <= 2))) OR G ((F ((p1 <= p15)) AND (F ((p24 <= p15)) OR X (F ((p1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p21 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p21 <= 2)))
lola: processed formula length: 18
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p8 <= 0)) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p8 <= 0)) OR (p8 <= 0))))
lola: processed formula length: 36
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 25
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 86 markings, 87 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((3 <= p26)) U (G ((2 <= p4)) OR (G ((G (F ((p10 <= p5))) OR F ((p10 <= p5)))) AND F (G ((2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((3 <= p26)) U (G ((2 <= p4)) OR (G ((G (F ((p10 <= p5))) OR F ((p10 <= p5)))) AND F (G ((2 <= p4))))))
lola: processed formula length: 106
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 57 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: 180 markings, 181 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p24 + 1 <= p12)) AND (3 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p24 + 1 <= p12)) AND (3 <= p25)))))
lola: processed formula length: 47
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 85 markings, 85 edges
lola: ========================================
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p21 <= 0)))) OR ((p5 + 1 <= p12) OR (F ((p15 <= p24)) AND F ((p5 + 1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 + 1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 + 1 <= p12)
lola: processed formula length: 15
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p5 + 1 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p12 <= p5)
lola: processed formula length: 11
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 328 markings, 328 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p21 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p21 <= 0))))
lola: processed formula length: 22
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 85 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((p5 <= 0))) R F (((p18 + 1 <= p22) AND (p5 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((p5 <= 0))) R F (((p18 + 1 <= p22) AND (p5 <= 0))))))
lola: processed formula length: 66
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 85 markings, 85 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p18 <= p26))) AND F ((p7 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p7 + 1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p1 <= p7)
lola: processed formula length: 10
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 85 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p10 <= p8) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p10 <= p8) AND (p8 <= 0))))
lola: processed formula length: 35
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 85 markings, 85 edges
lola: ========================================
lola: subprocess 8 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2 <= 2) AND (F ((p22 <= 2)) OR G ((p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2 <= 2) AND (F ((p22 <= 2)) OR G ((p2 <= 2)))))
lola: processed formula length: 53
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p6 <= p0)))
lola: processed formula length: 18
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2425517 markings, 5993513 edges, 485103 markings/sec, 0 secs
lola: 4862162 markings, 12019537 edges, 487329 markings/sec, 5 secs
lola: 7358345 markings, 17880257 edges, 499237 markings/sec, 10 secs
lola: 9736626 markings, 23326450 edges, 475656 markings/sec, 15 secs
lola: 12088233 markings, 28700076 edges, 470321 markings/sec, 20 secs
lola: 14448712 markings, 33991361 edges, 472096 markings/sec, 25 secs
lola: 16729262 markings, 39276395 edges, 456110 markings/sec, 30 secs
lola: 19013517 markings, 44525359 edges, 456851 markings/sec, 35 secs
lola: 21335086 markings, 49788547 edges, 464314 markings/sec, 40 secs
lola: 23619300 markings, 54996603 edges, 456843 markings/sec, 45 secs
lola: 25892223 markings, 60200422 edges, 454585 markings/sec, 50 secs
lola: 28142673 markings, 65378212 edges, 450090 markings/sec, 55 secs
lola: 30431062 markings, 70546740 edges, 457678 markings/sec, 60 secs
lola: 32765623 markings, 75737501 edges, 466912 markings/sec, 65 secs
lola: 35045601 markings, 80920737 edges, 455996 markings/sec, 70 secs
lola: 37298212 markings, 86176830 edges, 450522 markings/sec, 75 secs
lola: 39534153 markings, 91372606 edges, 447188 markings/sec, 80 secs
lola: 41918170 markings, 96556575 edges, 476803 markings/sec, 85 secs
lola: 44134084 markings, 101711391 edges, 443183 markings/sec, 90 secs
lola: 46358200 markings, 106959642 edges, 444823 markings/sec, 95 secs
lola: 48761998 markings, 112135119 edges, 480760 markings/sec, 100 secs
lola: 50964570 markings, 117324063 edges, 440514 markings/sec, 105 secs
lola: 53221488 markings, 122523301 edges, 451384 markings/sec, 110 secs
lola: 55564919 markings, 127681909 edges, 468686 markings/sec, 115 secs
lola: 57741216 markings, 132894805 edges, 435259 markings/sec, 120 secs
lola: 60136185 markings, 138036346 edges, 478994 markings/sec, 125 secs
lola: 62304556 markings, 143228046 edges, 433674 markings/sec, 130 secs
lola: 64650420 markings, 148429546 edges, 469173 markings/sec, 135 secs
lola: 66868343 markings, 153578151 edges, 443585 markings/sec, 140 secs
lola: 69151602 markings, 158764850 edges, 456652 markings/sec, 145 secs
lola: 71408065 markings, 163894647 edges, 451293 markings/sec, 150 secs
lola: 73666524 markings, 169093443 edges, 451692 markings/sec, 155 secs
lola: 75930054 markings, 174193133 edges, 452706 markings/sec, 160 secs
lola: 78179744 markings, 179374949 edges, 449938 markings/sec, 165 secs
lola: 80458294 markings, 184526494 edges, 455710 markings/sec, 170 secs
lola: 82733250 markings, 189718690 edges, 454991 markings/sec, 175 secs
lola: 84946144 markings, 194792327 edges, 442579 markings/sec, 180 secs
lola: 87261803 markings, 199955011 edges, 463132 markings/sec, 185 secs
lola: 89434144 markings, 205078652 edges, 434468 markings/sec, 190 secs
lola: 91832062 markings, 210261576 edges, 479584 markings/sec, 195 secs
lola: 93928571 markings, 215392020 edges, 419302 markings/sec, 200 secs
lola: 96325981 markings, 220512400 edges, 479482 markings/sec, 205 secs
lola: 98394734 markings, 225648694 edges, 413751 markings/sec, 210 secs
lola: 100768298 markings, 230747782 edges, 474713 markings/sec, 215 secs
lola: 102979075 markings, 235934357 edges, 442155 markings/sec, 220 secs
lola: 105232847 markings, 241038996 edges, 450754 markings/sec, 225 secs
lola: 107593298 markings, 246223815 edges, 472090 markings/sec, 230 secs
lola: 109677518 markings, 251295817 edges, 416844 markings/sec, 235 secs
lola: 112071436 markings, 256419393 edges, 478784 markings/sec, 240 secs
lola: 114163150 markings, 261543915 edges, 418343 markings/sec, 245 secs
lola: 116474375 markings, 266623947 edges, 462245 markings/sec, 250 secs
lola: 118800319 markings, 271809837 edges, 465189 markings/sec, 255 secs
lola: 120873610 markings, 276821590 edges, 414658 markings/sec, 260 secs
lola: 123040742 markings, 281464739 edges, 433426 markings/sec, 265 secs
lola: 125128699 markings, 286425284 edges, 417591 markings/sec, 270 secs
lola: 126701148 markings, 290097164 edges, 314490 markings/sec, 275 secs
lola: 128302631 markings, 293538748 edges, 320297 markings/sec, 280 secs
lola: 129765183 markings, 296645559 edges, 292510 markings/sec, 285 secs
lola: 130851397 markings, 299424326 edges, 217243 markings/sec, 290 secs
lola: 132455209 markings, 303237535 edges, 320762 markings/sec, 295 secs
lola: 134528680 markings, 307684108 edges, 414694 markings/sec, 300 secs
lola: 135583774 markings, 309926884 edges, 211019 markings/sec, 305 secs
lola: 136926375 markings, 313299782 edges, 268520 markings/sec, 310 secs
lola: 138407884 markings, 316808843 edges, 296302 markings/sec, 315 secs
lola: 140194796 markings, 320658115 edges, 357382 markings/sec, 320 secs
lola: 141868690 markings, 324255571 edges, 334779 markings/sec, 325 secs
lola: 143240219 markings, 327755654 edges, 274306 markings/sec, 330 secs
lola: 144603186 markings, 330933855 edges, 272593 markings/sec, 335 secs
lola: 146223392 markings, 334417275 edges, 324041 markings/sec, 340 secs
lola: 148164078 markings, 338589329 edges, 388137 markings/sec, 345 secs
lola: 148972459 markings, 340660466 edges, 161676 markings/sec, 350 secs
lola: 150890261 markings, 345263326 edges, 383560 markings/sec, 355 secs
lola: 151995836 markings, 347647022 edges, 221115 markings/sec, 360 secs
lola: 152033002 markings, 347725626 edges, 7433 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p14 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p14 <= p10)))
lola: processed formula length: 20
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 91 markings, 95 edges
lola: ========================================
lola: subprocess 11 will run for 3188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p6) OR (p14 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p6) OR (p14 <= p1))))
lola: processed formula length: 35
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 24
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 789283 markings, 1459206 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p6 <= p0)))
lola: processed formula length: 18
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2516501 markings, 6218662 edges, 503300 markings/sec, 0 secs
lola: 4973628 markings, 12295420 edges, 491425 markings/sec, 5 secs
lola: 7463535 markings, 18127879 edges, 497981 markings/sec, 10 secs
lola: 9851804 markings, 23597044 edges, 477654 markings/sec, 15 secs
lola: 12196596 markings, 28969338 edges, 468958 markings/sec, 20 secs
lola: 14580056 markings, 34281783 edges, 476692 markings/sec, 25 secs
lola: 16864234 markings, 39616956 edges, 456836 markings/sec, 30 secs
lola: 19206977 markings, 44938317 edges, 468549 markings/sec, 35 secs
lola: 21527264 markings, 50197563 edges, 464057 markings/sec, 40 secs
lola: 23828172 markings, 55440540 edges, 460182 markings/sec, 45 secs
lola: 26118982 markings, 60683190 edges, 458162 markings/sec, 50 secs
lola: 28395409 markings, 65918623 edges, 455285 markings/sec, 55 secs
lola: 30666624 markings, 71149126 edges, 454243 markings/sec, 60 secs
lola: 32970712 markings, 76263243 edges, 460818 markings/sec, 65 secs
lola: 35292061 markings, 81442885 edges, 464270 markings/sec, 70 secs
lola: 37433971 markings, 86467250 edges, 428382 markings/sec, 75 secs
lola: 39674875 markings, 91709288 edges, 448181 markings/sec, 80 secs
lola: 41905420 markings, 96523918 edges, 446109 markings/sec, 85 secs
lola: 44121833 markings, 101685446 edges, 443283 markings/sec, 90 secs
lola: 46327266 markings, 106894130 edges, 441087 markings/sec, 95 secs
lola: 48705300 markings, 111997618 edges, 475607 markings/sec, 100 secs
lola: 50813286 markings, 117000102 edges, 421597 markings/sec, 105 secs
lola: 53082094 markings, 122164582 edges, 453762 markings/sec, 110 secs
lola: 55373244 markings, 127275192 edges, 458230 markings/sec, 115 secs
lola: 57577620 markings, 132535205 edges, 440875 markings/sec, 120 secs
lola: 59982124 markings, 137669948 edges, 480901 markings/sec, 125 secs
lola: 62132099 markings, 142857916 edges, 429995 markings/sec, 130 secs
lola: 64500005 markings, 148040882 edges, 473581 markings/sec, 135 secs
lola: 66676862 markings, 153168533 edges, 435371 markings/sec, 140 secs
lola: 68989733 markings, 158346034 edges, 462574 markings/sec, 145 secs
lola: 71208594 markings, 163468624 edges, 443772 markings/sec, 150 secs
lola: 73491632 markings, 168641332 edges, 456608 markings/sec, 155 secs
lola: 75732044 markings, 173770739 edges, 448082 markings/sec, 160 secs
lola: 78020925 markings, 178964252 edges, 457776 markings/sec, 165 secs
lola: 80117313 markings, 183800541 edges, 419278 markings/sec, 170 secs
lola: 82437799 markings, 188953881 edges, 464097 markings/sec, 175 secs
lola: 84620016 markings, 194096596 edges, 436443 markings/sec, 180 secs
lola: 87009130 markings, 199301015 edges, 477823 markings/sec, 185 secs
lola: 89143142 markings, 204456401 edges, 426802 markings/sec, 190 secs
lola: 91581482 markings, 209652677 edges, 487668 markings/sec, 195 secs
lola: 93668852 markings, 214834243 edges, 417474 markings/sec, 200 secs
lola: 96060101 markings, 219946946 edges, 478250 markings/sec, 205 secs
lola: 98133650 markings, 225002309 edges, 414710 markings/sec, 210 secs
lola: 100455905 markings, 230079358 edges, 464451 markings/sec, 215 secs
lola: 102702081 markings, 235216640 edges, 449235 markings/sec, 220 secs
lola: 104899482 markings, 240327349 edges, 439480 markings/sec, 225 secs
lola: 107294575 markings, 245465828 edges, 479019 markings/sec, 230 secs
lola: 109375942 markings, 250648452 edges, 416273 markings/sec, 235 secs
lola: 111772982 markings, 255785953 edges, 479408 markings/sec, 240 secs
lola: 113926060 markings, 260928837 edges, 430616 markings/sec, 245 secs
lola: 116189696 markings, 266015933 edges, 452727 markings/sec, 250 secs
lola: 118577961 markings, 271232440 edges, 477653 markings/sec, 255 secs
lola: 120664417 markings, 276369703 edges, 417291 markings/sec, 260 secs
lola: 123046998 markings, 281478132 edges, 476516 markings/sec, 265 secs
lola: 124607023 markings, 285071084 edges, 312005 markings/sec, 270 secs
lola: 125961145 markings, 288501185 edges, 270824 markings/sec, 275 secs
lola: 127654131 markings, 292151605 edges, 338597 markings/sec, 280 secs
lola: 128947444 markings, 294909606 edges, 258663 markings/sec, 285 secs
lola: 130556415 markings, 298658279 edges, 321794 markings/sec, 290 secs
lola: 132123227 markings, 302514705 edges, 313362 markings/sec, 295 secs
lola: 133284265 markings, 305021989 edges, 232208 markings/sec, 300 secs
lola: 134863675 markings, 308399215 edges, 315882 markings/sec, 305 secs
lola: 136178783 markings, 311357577 edges, 263022 markings/sec, 310 secs
lola: 137297236 markings, 314262681 edges, 223691 markings/sec, 315 secs
lola: 138673829 markings, 317391372 edges, 275319 markings/sec, 320 secs
lola: 140379088 markings, 321052374 edges, 341052 markings/sec, 325 secs
lola: 141942158 markings, 324412385 edges, 312614 markings/sec, 330 secs
lola: 143712726 markings, 328983204 edges, 354114 markings/sec, 335 secs
lola: 145598807 markings, 333077910 edges, 377216 markings/sec, 340 secs
lola: 146903821 markings, 335870908 edges, 261003 markings/sec, 345 secs
lola: 148422511 markings, 339231027 edges, 303738 markings/sec, 350 secs
lola: 149878457 markings, 343014700 edges, 291189 markings/sec, 355 secs
lola: 151232631 markings, 346007478 edges, 270835 markings/sec, 360 secs
lola: 152035154 markings, 347730126 edges, 160505 markings/sec, 365 secs
lola: 152204341 markings, 348095010 edges, 33837 markings/sec, 370 secs
lola: 152204372 markings, 348095106 edges, 6 markings/sec, 375 secs
lola: 152204395 markings, 348095196 edges, 5 markings/sec, 380 secs
lola: 152204434 markings, 348095354 edges, 8 markings/sec, 385 secs
lola: 152204498 markings, 348095484 edges, 13 markings/sec, 390 secs
lola: 152204552 markings, 348095586 edges, 11 markings/sec, 395 secs
lola: 152204609 markings, 348095691 edges, 11 markings/sec, 400 secs
lola: 152204660 markings, 348095782 edges, 10 markings/sec, 405 secs
lola: 152204715 markings, 348095880 edges, 11 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no no no no unknown no no yes
lola:
preliminary result: no yes no no no no no no unknown no no yes
lola: memory consumption: 3384 KB
lola: time consumption: 813 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00160by00080"
export BK_EXAMINATION="LTLCardinality"
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-00160by00080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806700409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00160by00080.tgz
mv CloudOpsManagement-PT-00160by00080 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;