About the Execution of LoLa+red for ShieldIIPt-PT-005B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
409.092 | 19894.00 | 41763.00 | 53.00 | TTTFTFTTTTFTTFFT | 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-167903715100254.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 ShieldIIPt-PT-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100254
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Feb 25 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:59 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.7K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 83K 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 ShieldIIPt-PT-005B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679270427205
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=ShieldIIPt-PT-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:00:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:00:29] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-20 00:00:29] [INFO ] Transformed 353 places.
[2023-03-20 00:00:29] [INFO ] Transformed 328 transitions.
[2023-03-20 00:00:29] [INFO ] Found NUPN structural information;
[2023-03-20 00:00:29] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 328 rows 353 cols
[2023-03-20 00:00:30] [INFO ] Computed 46 place invariants in 10 ms
[2023-03-20 00:00:30] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:00:30] [INFO ] [Nat]Absence check using 46 positive place invariants in 25 ms returned sat
[2023-03-20 00:00:31] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:00:31] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 9 ms to minimize.
[2023-03-20 00:00:31] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-20 00:00:32] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2085 ms
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-20 00:00:33] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-20 00:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-20 00:00:33] [INFO ] After 2965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-20 00:00:34] [INFO ] After 3362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 122 ms.
Support contains 35 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 328/328 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 353 transition count 261
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 286 transition count 259
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 146 place count 285 transition count 250
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 155 place count 276 transition count 250
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 155 place count 276 transition count 229
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 197 place count 255 transition count 229
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 221 place count 231 transition count 205
Iterating global reduction 4 with 24 rules applied. Total rules applied 245 place count 231 transition count 205
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 245 place count 231 transition count 199
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 225 transition count 199
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 403 place count 152 transition count 126
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 4 with 14 rules applied. Total rules applied 417 place count 145 transition count 127
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 420 place count 145 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 423 place count 142 transition count 124
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 426 place count 142 transition count 124
Applied a total of 426 rules in 75 ms. Remains 142 /353 variables (removed 211) and now considering 124/328 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 142/353 places, 124/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 142 cols
[2023-03-20 00:00:34] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-20 00:00:34] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:00:34] [INFO ] [Nat]Absence check using 46 positive place invariants in 5 ms returned sat
[2023-03-20 00:00:34] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:34] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-20 00:00:34] [INFO ] After 82ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:35] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-20 00:00:35] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 3 ms to minimize.
[2023-03-20 00:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-03-20 00:00:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-20 00:00:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-20 00:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-20 00:00:35] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-20 00:00:35] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 33 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 124/124 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 140 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 140 transition count 122
Applied a total of 5 rules in 23 ms. Remains 140 /142 variables (removed 2) and now considering 122/124 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 140/142 places, 122/124 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
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
Interrupted probabilistic random walk after 223927 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223927 steps, saw 144118 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 140 cols
[2023-03-20 00:00:38] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-20 00:00:38] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:00:38] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2023-03-20 00:00:39] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-20 00:00:39] [INFO ] After 114ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-20 00:00:39] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-20 00:00:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-20 00:00:39] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-20 00:00:39] [INFO ] After 607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 00:00:39] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 33 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 140/140 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 00:00:39] [INFO ] Invariant cache hit.
[2023-03-20 00:00:39] [INFO ] Implicit Places using invariants in 191 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/140 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 212 ms. Remains : 139/140 places, 122/122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 237605 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237605 steps, saw 151846 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 139 cols
[2023-03-20 00:00:43] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-20 00:00:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:00:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-20 00:00:43] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-20 00:00:43] [INFO ] After 101ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:43] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-20 00:00:43] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-20 00:00:43] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2023-03-20 00:00:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 13 ms to minimize.
[2023-03-20 00:00:43] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2023-03-20 00:00:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2023-03-20 00:00:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-20 00:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 00:00:44] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-20 00:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-20 00:00:44] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-20 00:00:44] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 33 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 139/139 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 00:00:44] [INFO ] Invariant cache hit.
[2023-03-20 00:00:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-20 00:00:44] [INFO ] Invariant cache hit.
[2023-03-20 00:00:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-20 00:00:44] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-20 00:00:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 00:00:44] [INFO ] Invariant cache hit.
[2023-03-20 00:00:45] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 139/139 places, 122/122 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 139 transition count 122
Applied a total of 8 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 139 cols
[2023-03-20 00:00:45] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-20 00:00:45] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:00:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 00:00:45] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:00:45] [INFO ] After 83ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:45] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2023-03-20 00:00:45] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-20 00:00:45] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-20 00:00:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2023-03-20 00:00:46] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-20 00:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-20 00:00:46] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2023-03-20 00:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-20 00:00:46] [INFO ] After 948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 00:00:46] [INFO ] After 1174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:00:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-20 00:00:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 122 transitions and 460 arcs took 2 ms.
[2023-03-20 00:00:46] [INFO ] Flatten gal took : 66 ms
Total runtime 17097 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-005B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
ReachabilityCardinality
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679270447099
--------------------
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/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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 # 14 (type EXCL) for 3 ShieldIIPt-PT-005B-ReachabilityCardinality-10
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 3 ShieldIIPt-PT-005B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 3 ShieldIIPt-PT-005B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type SRCH) for 3 ShieldIIPt-PT-005B-ReachabilityCardinality-10
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: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: 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: FINISHED task # 13 (type SRCH) for ShieldIIPt-PT-005B-ReachabilityCardinality-10
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for ShieldIIPt-PT-005B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 10 (type EQUN) for ShieldIIPt-PT-005B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 14 (type EXCL) for ShieldIIPt-PT-005B-ReachabilityCardinality-10 (obsolete)
lola: LAUNCH task # 21 (type EXCL) for 6 ShieldIIPt-PT-005B-ReachabilityCardinality-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 0 ShieldIIPt-PT-005B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 0 ShieldIIPt-PT-005B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 0 ShieldIIPt-PT-005B-ReachabilityCardinality-01
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: FINISHED task # 25 (type SRCH) for ShieldIIPt-PT-005B-ReachabilityCardinality-01
lola: result : false
lola: markings : 2393
lola: fired transitions : 3629
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for ShieldIIPt-PT-005B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 23 (type EQUN) for ShieldIIPt-PT-005B-ReachabilityCardinality-01 (obsolete)
sara: try reading problem file /home/mcc/execution/380/ReachabilityCardinality-10.sara.
lola: LAUNCH task # 17 (type FNDP) for 6 ShieldIIPt-PT-005B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 18 (type EQUN) for 6 ShieldIIPt-PT-005B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 6 ShieldIIPt-PT-005B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 20 (type SRCH) for ShieldIIPt-PT-005B-ReachabilityCardinality-15
lola: result : true
lola: markings : 17
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 17 (type FNDP) for ShieldIIPt-PT-005B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 18 (type EQUN) for ShieldIIPt-PT-005B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 21 (type EXCL) for ShieldIIPt-PT-005B-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-005B-ReachabilityCardinality-01: AG true tandem / insertion
ShieldIIPt-PT-005B-ReachabilityCardinality-10: EF false tandem / insertion
ShieldIIPt-PT-005B-ReachabilityCardinality-15: EF true tandem / insertion
Time elapsed: 1 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="ShieldIIPt-PT-005B"
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 ShieldIIPt-PT-005B, 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-167903715100254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005B.tgz
mv ShieldIIPt-PT-005B 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 ;