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-167903715300447.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715300447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679275446719

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:24:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:24:09] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-20 01:24:09] [INFO ] Transformed 683 places.
[2023-03-20 01:24:09] [INFO ] Transformed 633 transitions.
[2023-03-20 01:24:09] [INFO ] Found NUPN structural information;
[2023-03-20 01:24:09] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 16) seen :10
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 633 rows 683 cols
[2023-03-20 01:24:10] [INFO ] Computed 111 place invariants in 13 ms
[2023-03-20 01:24:10] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 01:24:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 126 ms returned sat
[2023-03-20 01:24:12] [INFO ] After 1023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 01:24:13] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 8 ms to minimize.
[2023-03-20 01:24:13] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 1 ms to minimize.
[2023-03-20 01:24:13] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2023-03-20 01:24:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:24:15] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2023-03-20 01:24:15] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:24:15] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 1 ms to minimize.
[2023-03-20 01:24:15] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-20 01:24:15] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 4 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-20 01:24:16] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:24:17] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:24:17] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 14 ms to minimize.
[2023-03-20 01:24:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4688 ms
[2023-03-20 01:24:17] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2023-03-20 01:24:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1040 ms
[2023-03-20 01:24:18] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
[2023-03-20 01:24:19] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 1 ms to minimize.
[2023-03-20 01:24:19] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 1 ms to minimize.
[2023-03-20 01:24:19] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:24:19] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1320 ms
[2023-03-20 01:24:20] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 14 ms to minimize.
[2023-03-20 01:24:20] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 17 ms to minimize.
[2023-03-20 01:24:20] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:24:20] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2023-03-20 01:24:20] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-20 01:24:21] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 0 ms to minimize.
[2023-03-20 01:24:21] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 8 ms to minimize.
[2023-03-20 01:24:21] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:24:21] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-20 01:24:22] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 14 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2023-03-20 01:24:23] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:24:24] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2023-03-20 01:24:24] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:24:24] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 13 ms to minimize.
[2023-03-20 01:24:24] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:24:24] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 2 ms to minimize.
[2023-03-20 01:24:25] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-03-20 01:24:25] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 1 ms to minimize.
[2023-03-20 01:24:25] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2023-03-20 01:24:25] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:24:25] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5652 ms
[2023-03-20 01:24:26] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 2 ms to minimize.
[2023-03-20 01:24:26] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 1 ms to minimize.
[2023-03-20 01:24:27] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 13 ms to minimize.
[2023-03-20 01:24:27] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 0 ms to minimize.
[2023-03-20 01:24:27] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2023-03-20 01:24:27] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 13 ms to minimize.
[2023-03-20 01:24:27] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:24:28] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-20 01:24:28] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:24:28] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-20 01:24:28] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:24:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2023-03-20 01:24:29] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:24:29] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2023-03-20 01:24:29] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:24:29] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:24:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3853 ms
[2023-03-20 01:24:30] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 0 ms to minimize.
[2023-03-20 01:24:30] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:24:30] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:24:30] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:24:31] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:24:31] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:24:31] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:24:31] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:24:31] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2023-03-20 01:24:32] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:24:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2213 ms
[2023-03-20 01:24:32] [INFO ] After 20877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 811 ms.
[2023-03-20 01:24:33] [INFO ] After 22139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 179 ms.
Support contains 139 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 683 transition count 591
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 641 transition count 579
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 629 transition count 579
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 108 place count 629 transition count 539
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 188 place count 589 transition count 539
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 237 place count 540 transition count 490
Iterating global reduction 3 with 49 rules applied. Total rules applied 286 place count 540 transition count 490
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 286 place count 540 transition count 482
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 302 place count 532 transition count 482
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 492 place count 437 transition count 387
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 543 place count 437 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 436 transition count 386
Applied a total of 544 rules in 171 ms. Remains 436 /683 variables (removed 247) and now considering 386/633 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 436/683 places, 386/633 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 386 rows 436 cols
[2023-03-20 01:24:34] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-20 01:24:34] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:24:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2023-03-20 01:24:34] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:24:34] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-20 01:24:35] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1641 ms
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-20 01:24:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 531 ms
[2023-03-20 01:24:37] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-20 01:24:37] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:24:37] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2023-03-20 01:24:37] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:24:37] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-20 01:24:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1614 ms
[2023-03-20 01:24:38] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 01:24:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 900 ms
[2023-03-20 01:24:39] [INFO ] After 5386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-20 01:24:40] [INFO ] After 5879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 66 ms.
Support contains 50 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 386/386 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 436 transition count 379
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 429 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 428 transition count 378
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 16 place count 428 transition count 365
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 42 place count 415 transition count 365
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 411 transition count 361
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 411 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 411 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 410 transition count 360
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 158 place count 357 transition count 307
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 180 place count 357 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 356 transition count 306
Applied a total of 181 rules in 80 ms. Remains 356 /436 variables (removed 80) and now considering 306/386 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 356/436 places, 306/386 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 25 ms. (steps per millisecond=400 ) 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 :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 306 rows 356 cols
[2023-03-20 01:24:40] [INFO ] Computed 111 place invariants in 16 ms
[2023-03-20 01:24:40] [INFO ] [Real]Absence check using 108 positive place invariants in 30 ms returned sat
[2023-03-20 01:24:40] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-20 01:24:40] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:24:40] [INFO ] [Nat]Absence check using 108 positive place invariants in 18 ms returned sat
[2023-03-20 01:24:40] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 01:24:40] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:24:41] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 0 ms to minimize.
[2023-03-20 01:24:41] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-20 01:24:41] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:24:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 727 ms
[2023-03-20 01:24:41] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2023-03-20 01:24:41] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-20 01:24:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1076 ms
[2023-03-20 01:24:42] [INFO ] After 2166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-20 01:24:42] [INFO ] After 2397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 27 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 306/306 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 356 transition count 301
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 351 transition count 301
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 36 place count 338 transition count 288
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 338 transition count 288
Applied a total of 40 rules in 25 ms. Remains 338 /356 variables (removed 18) and now considering 288/306 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 338/356 places, 288/306 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 663904 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663904 steps, saw 119619 distinct states, run finished after 3004 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 338 cols
[2023-03-20 01:24:46] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-20 01:24:46] [INFO ] [Real]Absence check using 106 positive place invariants in 11 ms returned sat
[2023-03-20 01:24:46] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-20 01:24:46] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:24:46] [INFO ] [Nat]Absence check using 106 positive place invariants in 29 ms returned sat
[2023-03-20 01:24:46] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-20 01:24:46] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:24:47] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-20 01:24:47] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2023-03-20 01:24:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-20 01:24:47] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 13 ms to minimize.
[2023-03-20 01:24:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-03-20 01:24:47] [INFO ] After 1303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-20 01:24:48] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 27 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 15 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 338/338 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 12 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-20 01:24:48] [INFO ] Invariant cache hit.
[2023-03-20 01:24:48] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-20 01:24:48] [INFO ] Invariant cache hit.
[2023-03-20 01:24:48] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-20 01:24:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-20 01:24:48] [INFO ] Invariant cache hit.
[2023-03-20 01:24:49] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1111 ms. Remains : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:24:49] [INFO ] Invariant cache hit.
[2023-03-20 01:24:49] [INFO ] [Real]Absence check using 106 positive place invariants in 17 ms returned sat
[2023-03-20 01:24:49] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-20 01:24:49] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:24:49] [INFO ] [Nat]Absence check using 106 positive place invariants in 38 ms returned sat
[2023-03-20 01:24:49] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-20 01:24:49] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:24:49] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 997 ms
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-20 01:24:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-20 01:24:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-20 01:24:51] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 01:24:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
[2023-03-20 01:24:51] [INFO ] After 1763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-20 01:24:51] [INFO ] After 2092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:24:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-20 01:24:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 288 transitions and 1241 arcs took 5 ms.
[2023-03-20 01:24:51] [INFO ] Flatten gal took : 104 ms
Total runtime 42755 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-010B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679275492138

--------------------
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 ReachabilityFireability -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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
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 # 10 (type EXCL) for 0 ShieldPPPs-PT-010B-ReachabilityFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ShieldPPPs-PT-010B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ShieldPPPs-PT-010B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 ShieldPPPs-PT-010B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type SRCH) for ShieldPPPs-PT-010B-ReachabilityFireability-11
lola: result : false
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
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: CANCELED task # 6 (type FNDP) for ShieldPPPs-PT-010B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldPPPs-PT-010B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldPPPs-PT-010B-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 ShieldPPPs-PT-010B-ReachabilityFireability-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 ShieldPPPs-PT-010B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ShieldPPPs-PT-010B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 ShieldPPPs-PT-010B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldPPPs-PT-010B-ReachabilityFireability-13
lola: result : false
lola: markings : 26
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldPPPs-PT-010B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldPPPs-PT-010B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldPPPs-PT-010B-ReachabilityFireability-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-010B-ReachabilityFireability-11: EF false tandem / insertion
ShieldPPPs-PT-010B-ReachabilityFireability-13: EF false tandem / insertion


Time elapsed: 1 secs. Pages in use: 3

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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-010B, examination is ReachabilityFireability"
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-167903715300447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;