About the Execution of ITS-LoLa for CloudOpsManagement-PT-00010by00005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.340 | 3600000.00 | 23043.00 | 385.80 | FFTFTTFFTTFFFTFF | 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-158987806600377.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-00010by00005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600377
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.5K Mar 30 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 28 16:03 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.1K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 20K Mar 27 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 08:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 08:10 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-00010by00005-00
FORMULA_NAME CloudOpsManagement-PT-00010by00005-01
FORMULA_NAME CloudOpsManagement-PT-00010by00005-02
FORMULA_NAME CloudOpsManagement-PT-00010by00005-03
FORMULA_NAME CloudOpsManagement-PT-00010by00005-04
FORMULA_NAME CloudOpsManagement-PT-00010by00005-05
FORMULA_NAME CloudOpsManagement-PT-00010by00005-06
FORMULA_NAME CloudOpsManagement-PT-00010by00005-07
FORMULA_NAME CloudOpsManagement-PT-00010by00005-08
FORMULA_NAME CloudOpsManagement-PT-00010by00005-09
FORMULA_NAME CloudOpsManagement-PT-00010by00005-10
FORMULA_NAME CloudOpsManagement-PT-00010by00005-11
FORMULA_NAME CloudOpsManagement-PT-00010by00005-12
FORMULA_NAME CloudOpsManagement-PT-00010by00005-13
FORMULA_NAME CloudOpsManagement-PT-00010by00005-14
FORMULA_NAME CloudOpsManagement-PT-00010by00005-15
=== Now, execution of the tool begins
BK_START 1591324911739
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:41:54] [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 02:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:41:54] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-05 02:41:54] [INFO ] Transformed 27 places.
[2020-06-05 02:41:54] [INFO ] Transformed 29 transitions.
[2020-06-05 02:41:54] [INFO ] Parsed PT model containing 27 places and 29 transitions in 132 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 100009 steps, including 0 resets, run finished after 233 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 02:41:54] [INFO ] Computed 11 place invariants in 6 ms
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-05 02:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-05 02:41:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 02:41:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:55] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-05 02:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2020-06-05 02:41:55] [INFO ] Added : 26 causal constraints over 6 iterations in 76 ms. Result :sat
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-05 02:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 02:41:55] [INFO ] Added : 25 causal constraints over 6 iterations in 78 ms. Result :sat
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-05 02:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 02:41:55] [INFO ] Added : 22 causal constraints over 5 iterations in 42 ms. Result :sat
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 15 ms.
[2020-06-05 02:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2020-06-05 02:41:55] [INFO ] Added : 25 causal constraints over 6 iterations in 60 ms. Result :sat
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 02:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 02:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 45 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:56] [INFO ] Added : 22 causal constraints over 5 iterations in 30 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 02:41:56] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 02:41:56] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 02:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-05 02:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:57] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-05 02:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:57] [INFO ] Added : 25 causal constraints over 6 iterations in 49 ms. Result :sat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 02:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:57] [INFO ] Added : 25 causal constraints over 5 iterations in 43 ms. Result :sat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 02:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:57] [INFO ] Added : 25 causal constraints over 6 iterations in 45 ms. Result :sat
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 02:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 02:41:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 02:41:57] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 02:41:57] [INFO ] Added : 25 causal constraints over 5 iterations in 46 ms. Result :sat
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2020-06-05 02:41:57] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 02:41:57] [INFO ] Flatten gal took : 43 ms
FORMULA CloudOpsManagement-PT-00010by00005-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00010by00005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 02:41:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 02:41:57] [INFO ] Flatten gal took : 9 ms
[2020-06-05 02:41:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudOpsManagement-PT-00010by00005-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 02:41:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 02:41:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00010by00005 @ 3570 seconds
FORMULA CloudOpsManagement-PT-00010by00005-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudOpsManagement-PT-00010by00005-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00010by00005
{
"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 02:41:59 2020
",
"timelimit": 3570
},
"child":
[
{
"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": "(p12 <= p5)",
"processed_size": 11,
"rewrites": 54
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G ((X ((p5 + 1 <= p12)) AND (p5 + 1 <= p12))) OR (p24 + 1 <= p15))))",
"processed_size": 75,
"rewrites": 52
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 0,
"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": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((X (F ((p5 <= 0))) AND (p3 + 1 <= p26)))))",
"processed_size": 51,
"rewrites": 52
},
"result":
{
"edges": 40,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((X ((p10 <= 1)) AND (F (G ((p10 <= 1))) OR X (G ((p10 <= 1))))) OR F ((p0 + 1 <= p6)))))",
"processed_size": 95,
"rewrites": 52
},
"result":
{
"edges": 5296350,
"markings": 473762,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p3 <= p9)))",
"processed_size": 18,
"rewrites": 52
},
"result":
{
"edges": 414,
"markings": 251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(p22 <= p9)",
"processed_size": 11,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": "(p24 <= p2)",
"processed_size": 11,
"rewrites": 54
},
"result":
{
"edges": 21,
"markings": 21,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p2 + 1 <= p24) AND G ((p2 <= 2))))",
"processed_size": 39,
"rewrites": 52
},
"result":
{
"edges": 10,
"markings": 10,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p21 <= 2)))",
"processed_size": 18,
"rewrites": 52
},
"result":
{
"edges": 454,
"markings": 262,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p14 <= p1)))",
"processed_size": 19,
"rewrites": 52
},
"result":
{
"edges": 36,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G ((F ((3 <= p26)) AND ((2 <= p4) AND (2 <= p8)))) OR (3 <= p26))))",
"processed_size": 74,
"rewrites": 52
},
"result":
{
"edges": 2987,
"markings": 1462,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19988,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : G(F(*)) : F(G((G((F(**) AND (** AND **))) OR **))) : (X(G((G((X(*) AND *)) OR *))) OR F(*)) : X(X(F((X(F(*)) AND **)))) : G(F(((X(*) AND (F(G(*)) OR X(G(*)))) OR F(*)))) : X(G(**)) : ((F(*) AND **) OR X((* AND G(*))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F (G ((p14 <= p1))) : NOT((((F ((p24 <= p15)) U G ((p18 <= p10))) AND (p1 <= p15)) U X (F (G ((3 <= p21)))))) : F (X (G ((G (((F ((3 <= p26)) AND (2 <= p4)) AND (2 <= p8))) OR (3 <= p26))))) : (NOT(X (F ((F ((X ((p12 <= p5)) OR (p12 <= p5))) AND (p15 <= p24))))) OR NOT(G ((p12 <= p5)))) : X (X (F ((NOT(X (G ((1 <= p5)))) AND (p3 + 1 <= p26))))) : NOT(F (G (((G (F (((0 <= 0) U F ((2 <= p10))))) U X ((2 <= p10))) AND G ((p6 <= p0)))))) : X (G ((p3 <= p9))) : ((NOT(G ((p24 <= p2))) AND (p22 <= p9)) OR (NOT(X ((p24 <= p2))) AND NOT(F (X ((3 <= p2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
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:329
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G ((X ((p5 + 1 <= p12)) AND (p5 + 1 <= p12))) OR (p24 + 1 <= p15)))) OR F ((p5 + 1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 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: 54 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((X ((p5 + 1 <= p12)) AND (p5 + 1 <= p12))) OR (p24 + 1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((X ((p5 + 1 <= p12)) AND (p5 + 1 <= p12))) OR (p24 + 1 <= p15))))
lola: processed formula length: 75
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F ((p5 <= 0))) AND (p3 + 1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F ((p5 <= 0))) AND (p3 + 1 <= p26)))))
lola: processed formula length: 51
lola: 52 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: 32 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X ((p10 <= 1)) AND (F (G ((p10 <= 1))) OR X (G ((p10 <= 1))))) OR F ((p0 + 1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((p10 <= 1)) AND (F (G ((p10 <= 1))) OR X (G ((p10 <= 1))))) OR F ((p0 + 1 <= p6)))))
lola: processed formula length: 95
lola: 52 rewrites
lola: closed formula file LTLCardinality.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: 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: 473762 markings, 5296350 edges
lola: subprocess 3 will run for 712 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: X (G ((p3 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p3 <= p9)))
lola: processed formula length: 18
lola: 52 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: 251 markings, 414 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p2 + 1 <= p24)) AND (p22 <= p9)) OR X (((p2 + 1 <= p24) AND G ((p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p22 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p9)
lola: processed formula length: 11
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2 + 1 <= p24))
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: (p24 <= p2)
lola: processed formula length: 11
lola: 54 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2 + 1 <= p24) AND G ((p2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2 + 1 <= p24) AND G ((p2 <= 2))))
lola: processed formula length: 39
lola: 52 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p21 <= 2)))
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 ((p21 <= 2)))
lola: processed formula length: 18
lola: 52 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: 262 markings, 454 edges
lola: ========================================
lola: subprocess 6 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p14 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p14 <= p1)))
lola: processed formula length: 19
lola: 52 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: 30 markings, 36 edges
lola: ========================================
lola: subprocess 7 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((F ((3 <= p26)) AND ((2 <= p4) AND (2 <= p8)))) OR (3 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((F ((3 <= p26)) AND ((2 <= p4) AND (2 <= p8)))) OR (3 <= p26))))
lola: processed formula length: 74
lola: 52 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: 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: 1462 markings, 2987 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: ========================================
lola: memory consumption: 19988 KB
lola: time consumption: 6 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-00010by00005"
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-00010by00005, 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-158987806600377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00010by00005.tgz
mv CloudOpsManagement-PT-00010by00005 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 ;