About the Execution of ITS-LoLa for Dekker-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15789.420 | 3600000.00 | 615645.00 | 9486.80 | TTFFFFFFTFFFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200331.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200331
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-CTLCardinality-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-11
FORMULA_NAME Dekker-PT-050-CTLCardinality-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591216990996
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:43:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:43:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:43:13] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2020-06-03 20:43:13] [INFO ] Transformed 250 places.
[2020-06-03 20:43:13] [INFO ] Transformed 2600 transitions.
[2020-06-03 20:43:13] [INFO ] Found NUPN structural information;
[2020-06-03 20:43:13] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 48 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 798 ms. (steps per millisecond=125 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0]
[2020-06-03 20:43:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:43:14] [INFO ] Computed 150 place invariants in 14 ms
[2020-06-03 20:43:14] [INFO ] [Real]Absence check using 100 positive place invariants in 134 ms returned sat
[2020-06-03 20:43:14] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 23 ms returned sat
[2020-06-03 20:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:14] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2020-06-03 20:43:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:14] [INFO ] [Nat]Absence check using 100 positive place invariants in 88 ms returned sat
[2020-06-03 20:43:14] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 24 ms returned sat
[2020-06-03 20:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:15] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-06-03 20:43:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:43:15] [INFO ] [Nat]Added 50 Read/Feed constraints in 43 ms returned sat
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-06-03 20:43:15] [INFO ] Deduced a trap composed of 6 places in 49 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:43:16] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 20:43:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 911 ms
[2020-06-03 20:43:16] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 43 ms.
[2020-06-03 20:43:16] [INFO ] Added : 51 causal constraints over 11 iterations in 350 ms. Result :sat
[2020-06-03 20:43:16] [INFO ] [Real]Absence check using 100 positive place invariants in 76 ms returned sat
[2020-06-03 20:43:16] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 74 ms returned sat
[2020-06-03 20:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:16] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 20:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:17] [INFO ] [Nat]Absence check using 100 positive place invariants in 35 ms returned sat
[2020-06-03 20:43:17] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2020-06-03 20:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:17] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-03 20:43:17] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 35 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 12 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:43:17] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:43:18] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:43:18] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1055 ms
[2020-06-03 20:43:18] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 45 ms.
[2020-06-03 20:43:18] [INFO ] Added : 51 causal constraints over 11 iterations in 302 ms. Result :sat
[2020-06-03 20:43:18] [INFO ] [Real]Absence check using 100 positive place invariants in 45 ms returned sat
[2020-06-03 20:43:18] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2020-06-03 20:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:19] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-03 20:43:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-06-03 20:43:19] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 19 ms returned sat
[2020-06-03 20:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:19] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-03 20:43:19] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 5 places in 35 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:43:19] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:43:19] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 476 ms
[2020-06-03 20:43:19] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 57 ms.
[2020-06-03 20:43:20] [INFO ] Added : 51 causal constraints over 11 iterations in 563 ms. Result :sat
[2020-06-03 20:43:20] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2020-06-03 20:43:20] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-06-03 20:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:20] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 20:43:20] [INFO ] [Real]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 5 places in 32 ms
[2020-06-03 20:43:20] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:43:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 301 ms
[2020-06-03 20:43:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2020-06-03 20:43:21] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-06-03 20:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:21] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-03 20:43:21] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2020-06-03 20:43:21] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:43:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 676 ms
[2020-06-03 20:43:21] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 40 ms.
[2020-06-03 20:43:22] [INFO ] Added : 51 causal constraints over 11 iterations in 504 ms. Result :sat
[2020-06-03 20:43:22] [INFO ] [Real]Absence check using 100 positive place invariants in 49 ms returned sat
[2020-06-03 20:43:22] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 24 ms returned sat
[2020-06-03 20:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:22] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2020-06-03 20:43:22] [INFO ] [Real]Added 50 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:43:22] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:43:22] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 20:43:22] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 362 ms
[2020-06-03 20:43:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 38 ms returned sat
[2020-06-03 20:43:23] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2020-06-03 20:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:23] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-06-03 20:43:23] [INFO ] [Nat]Added 50 Read/Feed constraints in 16 ms returned sat
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:43:23] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-06-03 20:43:24] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:43:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 486 ms
[2020-06-03 20:43:24] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 42 ms.
[2020-06-03 20:43:24] [INFO ] Added : 51 causal constraints over 11 iterations in 279 ms. Result :sat
[2020-06-03 20:43:24] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2020-06-03 20:43:25] [INFO ] Flatten gal took : 390 ms
[2020-06-03 20:43:25] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2020-06-03 20:43:25] [INFO ] Flatten gal took : 128 ms
FORMULA Dekker-PT-050-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:43:25] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 14 ms.
[2020-06-03 20:43:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 53 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Dekker-PT-050 @ 3570 seconds
FORMULA Dekker-PT-050-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3026
rslt: Output for CTLCardinality @ Dekker-PT-050
{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:43:25 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3300
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p129 <= 0)) OR ((1 <= p79))) AND (((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155))))",
"processed_size": 108,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p129 <= 0)) OR ((1 <= p79))) AND (((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155))))",
"processed_size": 108,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0))))))",
"processed_size": 113,
"rewrites": 5
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4684,
"runtime": 544.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) OR (A(F(**)) AND (** AND (** AND **)))) : A(F(A(G(**))))"
},
"net":
{
"arcs": 20100,
"conflict_clusters": 1,
"places": 250,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 2600
},
"result":
{
"preliminary_value": "no unknown ",
"value": "no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2850/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 2600 transitions, 100 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: (A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0)))))) OR (((A (F ((((p164 <= 0)) OR ((1 <= p86))))) AND (((p129 <= 0)) OR ((1 <= p79)))) AND (((p243 <= 0)) OR ((1 <= p98)))) AND (((p96 <= 0)) OR ((1 <= p155))))) : A (F (A (G ((((p246 <= 0)) OR ((1 <= p232)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p246 <= 0)) OR ((1 <= p232)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p246)) AND ((p232 <= 0)))
lola: processed formula length: 33
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p246 <= 0)) OR ((1 <= p232)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p246)) AND ((p232 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: state equation: write sara problem file to CTLCardinality-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 534702 markings, 3458043 edges, 106940 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1081822 markings, 7142260 edges, 109424 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1626970 markings, 10793266 edges, 109030 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2213103 markings, 14386439 edges, 117227 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2733582 markings, 18031233 edges, 104096 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3200442 markings, 21469408 edges, 93372 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3702478 markings, 25097846 edges, 100407 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4251227 markings, 28695384 edges, 109750 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4740542 markings, 32381806 edges, 97863 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5218578 markings, 36118465 edges, 95607 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5693463 markings, 39825715 edges, 94977 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6204506 markings, 43479866 edges, 102209 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6727558 markings, 47095552 edges, 104610 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7238414 markings, 50745165 edges, 102171 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7732376 markings, 54385538 edges, 98792 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8260834 markings, 57954557 edges, 105692 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8775097 markings, 61617069 edges, 102853 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9230006 markings, 64999622 edges, 90982 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9658672 markings, 68430122 edges, 85733 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 10120195 markings, 71899905 edges, 92305 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 10629970 markings, 75534032 edges, 101955 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 11088423 markings, 79218186 edges, 91691 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 11529650 markings, 82934781 edges, 88245 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 11975426 markings, 86633597 edges, 89155 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 12446498 markings, 90274919 edges, 94214 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 12945502 markings, 93929360 edges, 99801 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 13437370 markings, 97616600 edges, 98374 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 13901646 markings, 101309022 edges, 92855 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 14381358 markings, 104926118 edges, 95942 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 14908206 markings, 108505494 edges, 105370 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 15419638 markings, 112080972 edges, 102286 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 15905813 markings, 115693965 edges, 97235 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 16407520 markings, 119239813 edges, 100341 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 16943078 markings, 122815239 edges, 107112 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 17437870 markings, 126523435 edges, 98958 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 17912171 markings, 130265975 edges, 94860 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 18388941 markings, 133951533 edges, 95354 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 18908365 markings, 137607040 edges, 103885 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 19362030 markings, 141285915 edges, 90733 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 19819457 markings, 145003771 edges, 91485 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 20261730 markings, 148680357 edges, 88455 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 20621886 markings, 151544952 edges, 72031 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 21006846 markings, 154411359 edges, 76992 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 21401866 markings, 157802328 edges, 79004 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 21793126 markings, 161077099 edges, 78252 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 22111054 markings, 163951596 edges, 63586 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 22422974 markings, 166738426 edges, 62384 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 22785514 markings, 169771033 edges, 72508 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 23193742 markings, 172915105 edges, 81646 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 23564978 markings, 175957048 edges, 74247 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 23921063 markings, 178772885 edges, 71217 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 24305507 markings, 182037260 edges, 76889 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 24663475 markings, 184968120 edges, 71594 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 3300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0)))))) OR (A (F ((((p164 <= 0)) OR ((1 <= p86))))) AND ((((p129 <= 0)) OR ((1 <= p79))) AND ((((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 3299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p129 <= 0)) OR ((1 <= p79))) AND ((((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((((p129 <= 0)) OR ((1 <= p79))) AND (((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155))))
lola: processed formula length: 108
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p246 <= 0)) OR ((1 <= p232)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p246)) AND ((p232 <= 0)))
lola: processed formula length: 33
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p246)) AND ((p232 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p246 <= 0)) OR ((1 <= p232)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-1.sara.
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 500064 markings, 3258325 edges, 100013 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1042918 markings, 6907251 edges, 108571 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1581638 markings, 10527761 edges, 107744 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2175264 markings, 14122565 edges, 118725 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2699161 markings, 17790321 edges, 104779 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3207054 markings, 21515765 edges, 101579 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3718407 markings, 25200628 edges, 102271 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4272562 markings, 28841867 edges, 110831 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4765214 markings, 32554044 edges, 98530 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5245900 markings, 36325817 edges, 96137 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5723758 markings, 40052752 edges, 95572 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6240529 markings, 43721863 edges, 103354 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6761025 markings, 47338399 edges, 104099 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7271634 markings, 51010921 edges, 102122 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7774446 markings, 54680343 edges, 100562 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8312370 markings, 58277524 edges, 107585 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8777966 markings, 61638853 edges, 93119 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9232430 markings, 65019985 edges, 90893 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9663882 markings, 68474726 edges, 86290 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 10134490 markings, 72009166 edges, 94122 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 10649347 markings, 75692666 edges, 102971 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 11112234 markings, 79411268 edges, 92577 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 11559370 markings, 83154952 edges, 89427 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 11960814 markings, 86510009 edges, 80289 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 12392034 markings, 89844896 edges, 86244 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 12887303 markings, 93447254 edges, 99054 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 13382637 markings, 97157187 edges, 99067 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 13847710 markings, 100895108 edges, 93015 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 14333070 markings, 104553166 edges, 97072 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 14858843 markings, 108152286 edges, 105155 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 15373960 markings, 111749833 edges, 103023 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 15863858 markings, 115373814 edges, 97980 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 16363842 markings, 118949447 edges, 99997 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 16900297 markings, 122503298 edges, 107291 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 17395482 markings, 126224949 edges, 99037 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 17877696 markings, 130007539 edges, 96443 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 18358059 markings, 133747057 edges, 96073 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 18857965 markings, 137274959 edges, 99981 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 19273813 markings, 140559753 edges, 83170 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 19705226 markings, 143971793 edges, 86283 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 20111738 markings, 147436865 edges, 81302 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 20494946 markings, 150555024 edges, 76642 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 20787689 markings, 152818718 edges, 58549 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 21122931 markings, 155361897 edges, 67048 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 21433578 markings, 158087289 edges, 62129 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 21769406 markings, 160859306 edges, 67166 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 22068282 markings, 163582111 edges, 59775 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 22379218 markings, 166349713 edges, 62187 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 22757039 markings, 169529937 edges, 75564 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 23148076 markings, 172555002 edges, 78207 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 23513030 markings, 175539260 edges, 72991 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 23895778 markings, 178542208 edges, 76550 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 24209314 markings, 181220431 edges, 62707 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 24530506 markings, 183922650 edges, 64238 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0)))))) OR (A (F ((((p164 <= 0)) OR ((1 <= p86))))) AND ((((p129 <= 0)) OR ((1 <= p79))) AND ((((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((((p129 <= 0)) OR ((1 <= p79))) AND ((((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((((p129 <= 0)) OR ((1 <= p79))) AND (((p243 <= 0)) OR ((1 <= p98))) AND (((p96 <= 0)) OR ((1 <= p155))))
lola: processed formula length: 108
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p215 <= 0)) OR ((1 <= p51)) OR ((p132 <= 0)) OR ((1 <= p138)) OR (((1 <= p65)) AND ((p135 <= 0))))))
lola: processed formula length: 113
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p215)) AND ((p51 <= 0)) AND ((1 <= p132)) AND ((p138 <= 0)) AND (((p65 <= 0)) OR ((1 <= p135))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown
lola:
preliminary result: no unknown
lola: memory consumption: 4684 KB
lola: time consumption: 544 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Dekker-PT-050"
export BK_EXAMINATION="CTLCardinality"
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 Dekker-PT-050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;