About the Execution of LoLa+red for ShieldPPPt-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1231.115 | 42441.00 | 68926.00 | 27.30 | FTFTTTFTFFTTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715500638.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679279350112
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:29:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:29:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:29:12] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-20 02:29:12] [INFO ] Transformed 1563 places.
[2023-03-20 02:29:12] [INFO ] Transformed 1423 transitions.
[2023-03-20 02:29:12] [INFO ] Found NUPN structural information;
[2023-03-20 02:29:12] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 12) seen :7
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-20 02:29:12] [INFO ] Computed 221 place invariants in 15 ms
[2023-03-20 02:29:13] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:29:13] [INFO ] [Nat]Absence check using 221 positive place invariants in 86 ms returned sat
[2023-03-20 02:29:15] [INFO ] After 1835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:29:16] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 7 ms to minimize.
[2023-03-20 02:29:16] [INFO ] Deduced a trap composed of 39 places in 308 ms of which 1 ms to minimize.
[2023-03-20 02:29:17] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 0 ms to minimize.
[2023-03-20 02:29:17] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 1 ms to minimize.
[2023-03-20 02:29:18] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:29:18] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 0 ms to minimize.
[2023-03-20 02:29:18] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 1 ms to minimize.
[2023-03-20 02:29:19] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2023-03-20 02:29:19] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2023-03-20 02:29:19] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5588 ms
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 1 ms to minimize.
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 1 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 0 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-03-20 02:29:27] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 4 ms to minimize.
[2023-03-20 02:29:27] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 1 ms to minimize.
[2023-03-20 02:29:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5673 ms
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 0 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 35 places in 341 ms of which 2 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 0 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 0 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 0 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 0 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8741 ms
[2023-03-20 02:29:36] [INFO ] After 22520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 769 ms.
[2023-03-20 02:29:37] [INFO ] After 23937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 160 ms.
Support contains 54 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1563 transition count 1084
Reduce places removed 339 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 353 rules applied. Total rules applied 692 place count 1224 transition count 1070
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 706 place count 1210 transition count 1070
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 706 place count 1210 transition count 986
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 874 place count 1126 transition count 986
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 1004 place count 996 transition count 856
Iterating global reduction 3 with 130 rules applied. Total rules applied 1134 place count 996 transition count 856
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1134 place count 996 transition count 803
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1240 place count 943 transition count 803
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 1 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1884 place count 621 transition count 481
Renaming transitions due to excessive name length > 1024 char.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1984 place count 571 transition count 481
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1988 place count 571 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1992 place count 567 transition count 477
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 2039 place count 567 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2040 place count 566 transition count 476
Applied a total of 2040 rules in 472 ms. Remains 566 /1563 variables (removed 997) and now considering 476/1423 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 566/1563 places, 476/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 476 rows 566 cols
[2023-03-20 02:29:38] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-20 02:29:38] [INFO ] [Real]Absence check using 221 positive place invariants in 41 ms returned sat
[2023-03-20 02:29:38] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:29:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 26 ms returned sat
[2023-03-20 02:29:38] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 02:29:38] [INFO ] After 93ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:38] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 22 ms to minimize.
[2023-03-20 02:29:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2023-03-20 02:29:39] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-20 02:29:39] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2023-03-20 02:29:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 454 ms
[2023-03-20 02:29:39] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-20 02:29:39] [INFO ] After 1087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 14 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 476/476 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 566 transition count 465
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 555 transition count 465
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 555 transition count 456
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 546 transition count 456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 545 transition count 455
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 545 transition count 455
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 69 place count 531 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 531 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 531 transition count 438
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 529 transition count 438
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 522 transition count 437
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 522 transition count 437
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 514 transition count 429
Applied a total of 104 rules in 121 ms. Remains 514 /566 variables (removed 52) and now considering 429/476 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 514/566 places, 429/476 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 240195 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240195 steps, saw 202633 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 514 cols
[2023-03-20 02:29:42] [INFO ] Computed 220 place invariants in 6 ms
[2023-03-20 02:29:42] [INFO ] [Real]Absence check using 220 positive place invariants in 26 ms returned sat
[2023-03-20 02:29:42] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:29:43] [INFO ] [Nat]Absence check using 220 positive place invariants in 24 ms returned sat
[2023-03-20 02:29:43] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-20 02:29:43] [INFO ] After 71ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 406 ms
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-20 02:29:43] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 02:29:44] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 14 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 429/429 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 514/514 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 429/429 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2023-03-20 02:29:44] [INFO ] Invariant cache hit.
[2023-03-20 02:29:44] [INFO ] Implicit Places using invariants in 335 ms returned [497, 501]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 512/514 places, 429/429 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 510 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 427
Applied a total of 4 rules in 16 ms. Remains 510 /512 variables (removed 2) and now considering 427/429 (removed 2) transitions.
// Phase 1: matrix 427 rows 510 cols
[2023-03-20 02:29:44] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:29:44] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-20 02:29:44] [INFO ] Invariant cache hit.
[2023-03-20 02:29:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:29:45] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 510/514 places, 427/429 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1209 ms. Remains : 510/514 places, 427/429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 257865 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257865 steps, saw 219738 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 02:29:48] [INFO ] Invariant cache hit.
[2023-03-20 02:29:48] [INFO ] [Real]Absence check using 218 positive place invariants in 23 ms returned sat
[2023-03-20 02:29:48] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:29:48] [INFO ] [Nat]Absence check using 218 positive place invariants in 24 ms returned sat
[2023-03-20 02:29:48] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:29:49] [INFO ] After 58ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-20 02:29:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-20 02:29:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-03-20 02:29:49] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-20 02:29:49] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 14 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 510/510 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-20 02:29:49] [INFO ] Invariant cache hit.
[2023-03-20 02:29:49] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-20 02:29:49] [INFO ] Invariant cache hit.
[2023-03-20 02:29:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:29:50] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2023-03-20 02:29:50] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 02:29:50] [INFO ] Invariant cache hit.
[2023-03-20 02:29:50] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1082 ms. Remains : 510/510 places, 427/427 transitions.
Partial Free-agglomeration rule applied 106 times.
Drop transitions removed 106 transitions
Iterating global reduction 0 with 106 rules applied. Total rules applied 106 place count 510 transition count 427
Applied a total of 106 rules in 20 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 427 rows 510 cols
[2023-03-20 02:29:50] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:29:50] [INFO ] [Real]Absence check using 218 positive place invariants in 97 ms returned sat
[2023-03-20 02:29:50] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:29:51] [INFO ] [Nat]Absence check using 218 positive place invariants in 46 ms returned sat
[2023-03-20 02:29:51] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:51] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-20 02:29:51] [INFO ] After 82ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 381 ms
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-20 02:29:51] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-20 02:29:51] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 02:29:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-20 02:29:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 510 places, 427 transitions and 1825 arcs took 3 ms.
[2023-03-20 02:29:52] [INFO ] Flatten gal took : 66 ms
Total runtime 40228 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-020B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityCardinality
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679279392553
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 0 ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 0 ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: result : true
lola: markings : 34
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 10 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 13 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 27 (type EXCL) for 6 ShieldPPPt-PT-020B-ReachabilityCardinality-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 3 ShieldPPPt-PT-020B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 ShieldPPPt-PT-020B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 3 ShieldPPPt-PT-020B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityCardinality-07
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 19 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityCardinality-12
lola: result : true
lola: markings : 37
lola: fired transitions : 36
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 23 (type FNDP) for 6 ShieldPPPt-PT-020B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 6 ShieldPPPt-PT-020B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 26 (type SRCH) for 6 ShieldPPPt-PT-020B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 35
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 23 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 41
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 24 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 26 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 27 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-ReachabilityCardinality-07: EF true tandem / insertion
ShieldPPPt-PT-020B-ReachabilityCardinality-12: AG false tandem / insertion
ShieldPPPt-PT-020B-ReachabilityCardinality-14: AG false findpath
Time elapsed: 0 secs. Pages in use: 2
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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715500638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;