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.r393-oct2-167903717000447.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 ltsminxred
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 r393-oct2-167903717000447
=====================================================================

--------------------
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 1679448937786

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:35:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:35:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:35:40] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-22 01:35:40] [INFO ] Transformed 683 places.
[2023-03-22 01:35:40] [INFO ] Transformed 633 transitions.
[2023-03-22 01:35:40] [INFO ] Found NUPN structural information;
[2023-03-22 01:35:40] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 16) seen :8
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 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-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 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 633 rows 683 cols
[2023-03-22 01:35:41] [INFO ] Computed 111 place invariants in 16 ms
[2023-03-22 01:35:42] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 01:35:42] [INFO ] [Nat]Absence check using 111 positive place invariants in 53 ms returned sat
[2023-03-22 01:35:44] [INFO ] After 1770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 01:35:45] [INFO ] Deduced a trap composed of 15 places in 511 ms of which 30 ms to minimize.
[2023-03-22 01:35:45] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 1 ms to minimize.
[2023-03-22 01:35:45] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2023-03-22 01:35:46] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 23 ms to minimize.
[2023-03-22 01:35:46] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 9 ms to minimize.
[2023-03-22 01:35:46] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 10 ms to minimize.
[2023-03-22 01:35:46] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2023-03-22 01:35:47] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2023-03-22 01:35:47] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2023-03-22 01:35:47] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-22 01:35:47] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3598 ms
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 23 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2023-03-22 01:35:48] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:35:49] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2023-03-22 01:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 596 ms
[2023-03-22 01:35:49] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2023-03-22 01:35:49] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-22 01:35:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-03-22 01:35:49] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 1 ms to minimize.
[2023-03-22 01:35:50] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 6 ms to minimize.
[2023-03-22 01:35:50] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 1 ms to minimize.
[2023-03-22 01:35:50] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 0 ms to minimize.
[2023-03-22 01:35:51] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-22 01:35:51] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-03-22 01:35:51] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2023-03-22 01:35:51] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2023-03-22 01:35:51] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-22 01:35:52] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2023-03-22 01:35:52] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2023-03-22 01:35:52] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 0 ms to minimize.
[2023-03-22 01:35:52] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-22 01:35:53] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 14 ms to minimize.
[2023-03-22 01:35:53] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 0 ms to minimize.
[2023-03-22 01:35:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3876 ms
[2023-03-22 01:35:53] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-22 01:35:54] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2023-03-22 01:35:54] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 14 ms to minimize.
[2023-03-22 01:35:54] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2023-03-22 01:35:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 791 ms
[2023-03-22 01:35:54] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 13 ms to minimize.
[2023-03-22 01:35:54] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2023-03-22 01:35:55] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2023-03-22 01:35:55] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2023-03-22 01:35:55] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 1 ms to minimize.
[2023-03-22 01:35:55] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 1 ms to minimize.
[2023-03-22 01:35:56] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-03-22 01:35:56] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2023-03-22 01:35:56] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 0 ms to minimize.
[2023-03-22 01:35:56] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 0 ms to minimize.
[2023-03-22 01:35:57] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 0 ms to minimize.
[2023-03-22 01:35:57] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 26 ms to minimize.
[2023-03-22 01:35:57] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2023-03-22 01:35:58] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2023-03-22 01:35:58] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2023-03-22 01:35:58] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-03-22 01:35:58] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 3 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 0 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-03-22 01:35:59] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5442 ms
[2023-03-22 01:36:00] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2023-03-22 01:36:00] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 1 ms to minimize.
[2023-03-22 01:36:00] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2023-03-22 01:36:00] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-22 01:36:01] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 14 ms to minimize.
[2023-03-22 01:36:01] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2023-03-22 01:36:01] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 11 ms to minimize.
[2023-03-22 01:36:01] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 20 ms to minimize.
[2023-03-22 01:36:01] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 14 ms to minimize.
[2023-03-22 01:36:02] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 0 ms to minimize.
[2023-03-22 01:36:02] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2023-03-22 01:36:02] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 0 ms to minimize.
[2023-03-22 01:36:02] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 1 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-22 01:36:03] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2023-03-22 01:36:04] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2023-03-22 01:36:04] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-22 01:36:04] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2023-03-22 01:36:04] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 0 ms to minimize.
[2023-03-22 01:36:05] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2023-03-22 01:36:05] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2023-03-22 01:36:05] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2023-03-22 01:36:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-22 01:36:05] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5589 ms
[2023-03-22 01:36:05] [INFO ] After 22793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1096 ms.
[2023-03-22 01:36:06] [INFO ] After 24462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 142 ms.
Support contains 143 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 3 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 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 488 place count 439 transition count 389
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 537 place count 439 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 538 place count 438 transition count 388
Applied a total of 538 rules in 145 ms. Remains 438 /683 variables (removed 245) and now considering 388/633 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 438/683 places, 388/633 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 :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 :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) 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 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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
Running SMT prover for 3 properties.
// Phase 1: matrix 388 rows 438 cols
[2023-03-22 01:36:07] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:36:07] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2023-03-22 01:36:07] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 01:36:07] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2023-03-22 01:36:08] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 01:36:08] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2023-03-22 01:36:08] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-22 01:36:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1091 ms
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-22 01:36:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 930 ms
[2023-03-22 01:36:10] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-22 01:36:11] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:36:12] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 0 ms to minimize.
[2023-03-22 01:36:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:36:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1374 ms
[2023-03-22 01:36:12] [INFO ] After 4297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-22 01:36:12] [INFO ] After 4742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 ms.
Support contains 40 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 388/388 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 438 transition count 380
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 430 transition count 380
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 16 place count 430 transition count 365
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 46 place count 415 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 411 transition count 361
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 411 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 411 transition count 360
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 410 transition count 360
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 174 place count 351 transition count 301
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 200 place count 351 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 350 transition count 300
Applied a total of 201 rules in 105 ms. Remains 350 /438 variables (removed 88) and now considering 300/388 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 350/438 places, 300/388 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 350 cols
[2023-03-22 01:36:12] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:36:12] [INFO ] [Real]Absence check using 108 positive place invariants in 21 ms returned sat
[2023-03-22 01:36:12] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 01:36:13] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:36:13] [INFO ] [Nat]Absence check using 108 positive place invariants in 43 ms returned sat
[2023-03-22 01:36:13] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 34 ms returned sat
[2023-03-22 01:36:13] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:36:13] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-22 01:36:13] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:36:14] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:36:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1573 ms
[2023-03-22 01:36:15] [INFO ] After 2565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-22 01:36:15] [INFO ] After 2971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 27 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 300/300 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 350 transition count 297
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 347 transition count 297
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 338 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 338 transition count 288
Applied a total of 27 rules in 70 ms. Remains 338 /350 variables (removed 12) and now considering 288/300 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 338/350 places, 288/300 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 448472 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448472 steps, saw 93897 distinct states, run finished after 3003 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 338 cols
[2023-03-22 01:36:19] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:36:19] [INFO ] [Real]Absence check using 106 positive place invariants in 24 ms returned sat
[2023-03-22 01:36:19] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:36:19] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:36:19] [INFO ] [Nat]Absence check using 106 positive place invariants in 37 ms returned sat
[2023-03-22 01:36:19] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-22 01:36:19] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:36:19] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-22 01:36:20] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-22 01:36:21] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-22 01:36:21] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-22 01:36:21] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:36:21] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-22 01:36:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1393 ms
[2023-03-22 01:36:21] [INFO ] After 2069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-22 01:36:21] [INFO ] After 2456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 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 26 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 26 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 9 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-22 01:36:21] [INFO ] Invariant cache hit.
[2023-03-22 01:36:22] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-22 01:36:22] [INFO ] Invariant cache hit.
[2023-03-22 01:36:22] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-22 01:36:22] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 01:36:22] [INFO ] Invariant cache hit.
[2023-03-22 01:36:22] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 19 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 01:36:22] [INFO ] Invariant cache hit.
[2023-03-22 01:36:22] [INFO ] [Real]Absence check using 106 positive place invariants in 25 ms returned sat
[2023-03-22 01:36:22] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:36:22] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:36:23] [INFO ] [Nat]Absence check using 106 positive place invariants in 116 ms returned sat
[2023-03-22 01:36:23] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:36:23] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:36:23] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-22 01:36:23] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2023-03-22 01:36:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-03-22 01:36:24] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:36:24] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-22 01:36:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-22 01:36:24] [INFO ] After 954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-22 01:36:24] [INFO ] After 1436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:36:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 01:36:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 288 transitions and 1243 arcs took 5 ms.
[2023-03-22 01:36:24] [INFO ] Flatten gal took : 70 ms
Total runtime 44314 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/955/inv_0_ --invariant=/tmp/955/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9543208 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16097016 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r393-oct2-167903717000447"
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 ;