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.r394-oct2-167903717700239.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 marciexred
Input is ShieldIIPt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679498661937

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-004B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:24:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:24:25] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-22 15:24:25] [INFO ] Transformed 283 places.
[2023-03-22 15:24:25] [INFO ] Transformed 263 transitions.
[2023-03-22 15:24:25] [INFO ] Found NUPN structural information;
[2023-03-22 15:24:25] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 263 rows 283 cols
[2023-03-22 15:24:26] [INFO ] Computed 37 place invariants in 10 ms
[2023-03-22 15:24:27] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 15:24:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 62 ms returned sat
[2023-03-22 15:24:28] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 15:24:28] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 8 ms to minimize.
[2023-03-22 15:24:28] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2023-03-22 15:24:28] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 14 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1647 ms
[2023-03-22 15:24:29] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-22 15:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:24:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 683 ms
[2023-03-22 15:24:31] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2023-03-22 15:24:31] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-22 15:24:31] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 16 ms to minimize.
[2023-03-22 15:24:31] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-22 15:24:31] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 4 ms to minimize.
[2023-03-22 15:24:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 830 ms
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 9 ms to minimize.
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2023-03-22 15:24:32] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-22 15:24:33] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2023-03-22 15:24:33] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-22 15:24:33] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-22 15:24:33] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2023-03-22 15:24:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1710 ms
[2023-03-22 15:24:33] [INFO ] After 5820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-22 15:24:33] [INFO ] After 6422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 69 ms.
Support contains 88 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 263/263 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 283 transition count 246
Reduce places removed 17 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 28 rules applied. Total rules applied 45 place count 266 transition count 235
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 56 place count 255 transition count 235
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 56 place count 255 transition count 219
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 88 place count 239 transition count 219
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 103 place count 224 transition count 204
Iterating global reduction 3 with 15 rules applied. Total rules applied 118 place count 224 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 224 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 223 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 121 place count 223 transition count 200
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 125 place count 221 transition count 200
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 183 place count 192 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 187 place count 190 transition count 171
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 190 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 187 transition count 168
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 187 transition count 168
Applied a total of 195 rules in 58 ms. Remains 187 /283 variables (removed 96) and now considering 168/263 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 187/283 places, 168/263 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 187 cols
[2023-03-22 15:24:34] [INFO ] Computed 37 place invariants in 14 ms
[2023-03-22 15:24:34] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:24:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2023-03-22 15:24:34] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 15:24:34] [INFO ] After 120ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:34] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-22 15:24:34] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 17 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 730 ms
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 14 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-22 15:24:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 423 ms
[2023-03-22 15:24:36] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-22 15:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-22 15:24:36] [INFO ] After 1583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-22 15:24:36] [INFO ] After 1978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 63 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 168/168 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 187 transition count 163
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 182 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 181 transition count 162
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 12 place count 181 transition count 154
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 28 place count 173 transition count 154
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 162 transition count 143
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 162 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 58 place count 158 transition count 139
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 158 transition count 139
Applied a total of 61 rules in 65 ms. Remains 158 /187 variables (removed 29) and now considering 139/168 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 158/187 places, 139/168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 292132 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292132 steps, saw 153888 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 139 rows 158 cols
[2023-03-22 15:24:39] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-22 15:24:39] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:24:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 15:24:39] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 15:24:39] [INFO ] After 121ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-22 15:24:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 950 ms
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 394 ms
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2023-03-22 15:24:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2023-03-22 15:24:41] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-22 15:24:41] [INFO ] After 2202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 63 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 139/139 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 158/158 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 139/139 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-22 15:24:41] [INFO ] Invariant cache hit.
[2023-03-22 15:24:42] [INFO ] Implicit Places using invariants in 248 ms returned [140]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 157/158 places, 139/139 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 157 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 138
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 156 cols
[2023-03-22 15:24:42] [INFO ] Computed 36 place invariants in 10 ms
[2023-03-22 15:24:42] [INFO ] Implicit Places using invariants in 154 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/158 places, 138/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 137
Applied a total of 2 rules in 6 ms. Remains 154 /155 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 154 cols
[2023-03-22 15:24:42] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-22 15:24:42] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-22 15:24:42] [INFO ] Invariant cache hit.
[2023-03-22 15:24:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:24:42] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 154/158 places, 137/139 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1054 ms. Remains : 154/158 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 306351 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306351 steps, saw 161968 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 15:24:46] [INFO ] Invariant cache hit.
[2023-03-22 15:24:46] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:24:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-22 15:24:46] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:24:46] [INFO ] After 108ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:46] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-22 15:24:46] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:24:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-22 15:24:46] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-22 15:24:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 14 ms to minimize.
[2023-03-22 15:24:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 510 ms
[2023-03-22 15:24:47] [INFO ] After 1498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-22 15:24:48] [INFO ] After 1773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 63 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 154/154 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-22 15:24:48] [INFO ] Invariant cache hit.
[2023-03-22 15:24:48] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-22 15:24:48] [INFO ] Invariant cache hit.
[2023-03-22 15:24:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:24:48] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-22 15:24:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 15:24:48] [INFO ] Invariant cache hit.
[2023-03-22 15:24:48] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 154/154 places, 137/137 transitions.
Graph (complete) has 308 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 153 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 153 transition count 136
Applied a total of 7 rules in 30 ms. Remains 153 /154 variables (removed 1) and now considering 136/137 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 136 rows 153 cols
[2023-03-22 15:24:48] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 15:24:48] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:24:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-22 15:24:49] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 15:24:49] [INFO ] After 102ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 414 ms
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-22 15:24:49] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-22 15:24:50] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-22 15:24:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-22 15:24:50] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2023-03-22 15:24:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 524 ms
[2023-03-22 15:24:50] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-22 15:24:50] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:24:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 15:24:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 137 transitions and 413 arcs took 2 ms.
[2023-03-22 15:24:50] [INFO ] Flatten gal took : 37 ms
Total runtime 25207 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_004B
(NrP: 154 NrTr: 137 NrArc: 413)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 2.975sec


RS generation: 0m13.569sec


-> reachability set: #nodes 436315 (4.4e+05) #states 57,787,817,188,951,654 (16)



starting MCC model checker
--------------------------

checking: EF [[[1<=p79 & p79<=1] & [[[p125<=1 & 1<=p125] | [[p97<=1 & 1<=p97] | [[[p101<=0 & 0<=p101] & [p143<=0 & 0<=p143]] & [[p31<=0 & 0<=p31] & [[p70<=1 & 1<=p70] & [[[p114<=0 & 0<=p114] & [[p83<=0 & 0<=p83] | [p100<=0 & 0<=p100]]] | [[p65<=1 & 1<=p65] & [[p29<=1 & 1<=p29] | [p38<=1 & 1<=p38]]]]]]]]] & [[p126<=1 & 1<=p126] | [[[p115<=0 & 0<=p115] & [p77<=1 & 1<=p77]] & [[p34<=1 & 1<=p34] & [[p122<=1 & 1<=p122] | [p26<=1 & 1<=p26]]]]]]]]
normalized: E [true U [[[[[[p34<=1 & 1<=p34] & [[p122<=1 & 1<=p122] | [p26<=1 & 1<=p26]]] & [[p115<=0 & 0<=p115] & [p77<=1 & 1<=p77]]] | [p126<=1 & 1<=p126]] & [[[[[p31<=0 & 0<=p31] & [[[[p65<=1 & 1<=p65] & [[p38<=1 & 1<=p38] | [p29<=1 & 1<=p29]]] | [[p114<=0 & 0<=p114] & [[p83<=0 & 0<=p83] | [p100<=0 & 0<=p100]]]] & [p70<=1 & 1<=p70]]] & [[p143<=0 & 0<=p143] & [p101<=0 & 0<=p101]]] | [p97<=1 & 1<=p97]] | [p125<=1 & 1<=p125]]] & [1<=p79 & p79<=1]]]

abstracting: (p79<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p79)
states: 28,746,366,207,276 (13)
abstracting: (1<=p125)
states: 90,483 (4)
abstracting: (p125<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p97)
states: 10,926,936,966,703,104 (16)
abstracting: (p97<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p101)
states: 57,787,817,188,951,654 (16)
abstracting: (p101<=0)
states: 46,378,983,078,407,590 (16)
abstracting: (0<=p143)
states: 57,787,817,188,951,654 (16)
abstracting: (p143<=0)
states: 57,787,817,188,559,561 (16)
abstracting: (1<=p70)
states: 19,262,375,381,536,128 (16)
abstracting: (p70<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p100)
states: 57,787,817,188,951,654 (16)
abstracting: (p100<=0)
states: 46,378,983,078,407,590 (16)
abstracting: (0<=p83)
states: 57,787,817,188,951,654 (16)
abstracting: (p83<=0)
states: 46,378,686,556,201,870 (16)
abstracting: (0<=p114)
states: 57,787,817,188,951,654 (16)
abstracting: (p114<=0)
states: 51,030,880,812,415,078 (16)
abstracting: (1<=p29)
states: 14,437,038,810,378,240 (16)
abstracting: (p29<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p38)
states: 17,002,283,339,952 (13)
abstracting: (p38<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p65)
states: 10,746,758,034,249,984 (16)
abstracting: (p65<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p31)
states: 57,787,817,188,951,654 (16)
abstracting: (p31<=0)
states: 43,350,803,098,705,510 (16)
abstracting: (1<=p126)
states: 271,449 (5)
abstracting: (p126<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p77)
states: 871,740 (5)
abstracting: (p77<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p115)
states: 57,787,817,188,951,654 (16)
abstracting: (p115<=0)
states: 50,457,934,232,363,230 (16)
abstracting: (1<=p26)
states: 18,759,958,641,229,824 (16)
abstracting: (p26<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p122)
states: 30,161 (4)
abstracting: (p122<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p34)
states: 14,437,064,963,561,472 (16)
abstracting: (p34<=1)
states: 57,787,817,188,951,654 (16)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.874sec

checking: EF [[[[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]] & [[[[p79<=1 & 1<=p79] | [p139<=1 & 1<=p139]] | [[p119<=1 & 1<=p119] | [[[p111<=0 & 0<=p111] & [p59<=0 & 0<=p59]] & [[[[p93<=0 & 0<=p93] | [p110<=0 & 0<=p110]] | [[p121<=0 & 0<=p121] | [[p129<=0 & 0<=p129] | [p152<=0 & 0<=p152]]]] & [[[p12<=0 & 0<=p12] | [p57<=0 & 0<=p57]] | [[p88<=0 & 0<=p88] | [p142<=0 & 0<=p142]]]]]]] & [[p29<=1 & 1<=p29] | [[p51<=1 & 1<=p51] & [p107<=1 & 1<=p107]]]]]]
normalized: E [true U [[[[[p107<=1 & 1<=p107] & [p51<=1 & 1<=p51]] | [p29<=1 & 1<=p29]] & [[[[[[[p142<=0 & 0<=p142] | [p88<=0 & 0<=p88]] | [[p57<=0 & 0<=p57] | [p12<=0 & 0<=p12]]] & [[[[p152<=0 & 0<=p152] | [p129<=0 & 0<=p129]] | [p121<=0 & 0<=p121]] | [[p110<=0 & 0<=p110] | [p93<=0 & 0<=p93]]]] & [[p59<=0 & 0<=p59] & [p111<=0 & 0<=p111]]] | [p119<=1 & 1<=p119]] | [[p139<=1 & 1<=p139] | [p79<=1 & 1<=p79]]]] & [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]

abstracting: (1<=p4)
states: 18,524,085,174,669,312 (16)
abstracting: (p4<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p10)
states: 1,332,255,614,006,304 (15)
abstracting: (p10<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p79)
states: 28,746,366,207,276 (13)
abstracting: (p79<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p139)
states: 11,184,738,810,554,682 (16)
abstracting: (p139<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p119)
states: 7,329,882,956,588,424 (15)
abstracting: (p119<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p111)
states: 57,787,817,188,951,654 (16)
abstracting: (p111<=0)
states: 57,787,817,182,551,934 (16)
abstracting: (0<=p59)
states: 57,787,817,188,951,654 (16)
abstracting: (p59<=0)
states: 48,627,471,629,054,950 (16)
abstracting: (0<=p93)
states: 57,787,817,188,951,654 (16)
abstracting: (p93<=0)
states: 38,525,211,457,074,070 (16)
abstracting: (0<=p110)
states: 57,787,817,188,951,654 (16)
abstracting: (p110<=0)
states: 48,156,326,530,684,294 (16)
abstracting: (0<=p121)
states: 57,787,817,188,951,654 (16)
abstracting: (p121<=0)
states: 50,457,934,225,319,710 (16)
abstracting: (0<=p129)
states: 57,787,817,188,951,654 (16)
abstracting: (p129<=0)
states: 39,146,585,837,846,218 (16)
abstracting: (0<=p152)
states: 57,787,817,188,951,654 (16)
abstracting: (p152<=0)
states: 38,525,211,459,663,035 (16)
abstracting: (0<=p12)
states: 57,787,817,188,951,654 (16)
abstracting: (p12<=0)
states: 39,027,841,351,108,198 (16)
abstracting: (0<=p57)
states: 57,787,817,188,951,654 (16)
abstracting: (p57<=0)
states: 48,627,471,629,054,950 (16)
abstracting: (0<=p88)
states: 57,787,817,188,951,654 (16)
abstracting: (p88<=0)
states: 36,651,961,774,052,962 (16)
abstracting: (0<=p142)
states: 57,787,817,188,951,654 (16)
abstracting: (p142<=0)
states: 52,195,447,783,372,703 (16)
abstracting: (1<=p29)
states: 14,437,038,810,378,240 (16)
abstracting: (p29<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p51)
states: 19,262,978,316,206,784 (16)
abstracting: (p51<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p107)
states: 9,631,208,964,020,328 (15)
abstracting: (p107<=1)
states: 57,787,817,188,951,654 (16)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.007sec

checking: EF [[[[p91<=1 & 1<=p91] & [p146<=1 & 1<=p146]] & [[[[p1<=1 & 1<=p1] | [p118<=1 & 1<=p118]] | [[p23<=1 & 1<=p23] | [[[p8<=0 & 0<=p8] & [[p68<=1 & 1<=p68] | [p112<=1 & 1<=p112]]] | [[p127<=0 & 0<=p127] & [[p1<=1 & 1<=p1] | [p109<=1 & 1<=p109]]]]]] & [[[[p145<=0 & 0<=p145] | [p56<=0 & 0<=p56]] | [[[[p113<=0 & 0<=p113] | [[p74<=0 & 0<=p74] & [p63<=0 & 0<=p63]]] & [[[p36<=1 & 1<=p36] | [p56<=0 & 0<=p56]] & [[[p59<=1 & 1<=p59] & [p124<=1 & 1<=p124]] | [[[p150<=0 & 0<=p150] & [p61<=0 & 0<=p61]] & [[p40<=0 & 0<=p40] & [p31<=0 & 0<=p31]]]]]] | [[p137<=0 & 0<=p137] & [p99<=1 & 1<=p99]]]] & [[p150<=1 & 1<=p150] | [[[p125<=1 & 1<=p125] | [[p92<=1 & 1<=p92] | [[p95<=1 & 1<=p95] & [p6<=1 & 1<=p6]]]] & [[p94<=1 & 1<=p94] | [p148<=0 & 0<=p148]]]]]]]]
normalized: E [true U [[[[[[[p99<=1 & 1<=p99] & [p137<=0 & 0<=p137]] | [[[[[[p31<=0 & 0<=p31] & [p40<=0 & 0<=p40]] & [[p61<=0 & 0<=p61] & [p150<=0 & 0<=p150]]] | [[p124<=1 & 1<=p124] & [p59<=1 & 1<=p59]]] & [[p56<=0 & 0<=p56] | [p36<=1 & 1<=p36]]] & [[[p63<=0 & 0<=p63] & [p74<=0 & 0<=p74]] | [p113<=0 & 0<=p113]]]] | [[p56<=0 & 0<=p56] | [p145<=0 & 0<=p145]]] & [[[[p148<=0 & 0<=p148] | [p94<=1 & 1<=p94]] & [[[[p6<=1 & 1<=p6] & [p95<=1 & 1<=p95]] | [p92<=1 & 1<=p92]] | [p125<=1 & 1<=p125]]] | [p150<=1 & 1<=p150]]] & [[[[[[p109<=1 & 1<=p109] | [p1<=1 & 1<=p1]] & [p127<=0 & 0<=p127]] | [[[p112<=1 & 1<=p112] | [p68<=1 & 1<=p68]] & [p8<=0 & 0<=p8]]] | [p23<=1 & 1<=p23]] | [[p118<=1 & 1<=p118] | [p1<=1 & 1<=p1]]]] & [[p146<=1 & 1<=p146] & [p91<=1 & 1<=p91]]]]

abstracting: (1<=p91)
states: 19,262,605,730,903,184 (16)
abstracting: (p91<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p146)
states: 9,631,302,865,075,845 (15)
abstracting: (p146<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p1)
states: 501
abstracting: (p1<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p118)
states: 7,329,882,956,588,424 (15)
abstracting: (p118<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p23)
states: 5,166,712,250,861,760 (15)
abstracting: (p23<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p8)
states: 57,787,817,188,951,654 (16)
abstracting: (p8<=0)
states: 57,781,015,527,962,950 (16)
abstracting: (1<=p68)
states: 2,026,937,476,055,664 (15)
abstracting: (p68<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p112)
states: 6,399,720 (6)
abstracting: (p112<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p127)
states: 57,787,817,188,951,654 (16)
abstracting: (p127<=0)
states: 57,787,817,188,680,205 (16)
abstracting: (1<=p1)
states: 501
abstracting: (p1<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p109)
states: 9,631,208,964,020,328 (15)
abstracting: (p109<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p150)
states: 392,093 (5)
abstracting: (p150<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p125)
states: 90,483 (4)
abstracting: (p125<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p92)
states: 19,262,605,721,521,104 (16)
abstracting: (p92<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p95)
states: 11,795,057,681,925,744 (16)
abstracting: (p95<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p6)
states: 1,133,610,164,784 (12)
abstracting: (p6<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p94)
states: 11,440,922,978,711,664 (16)
abstracting: (p94<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p148)
states: 57,787,817,188,951,654 (16)
abstracting: (p148<=0)
states: 48,156,514,323,875,809 (16)
abstracting: (0<=p145)
states: 57,787,817,188,951,654 (16)
abstracting: (p145<=0)
states: 48,156,514,326,465,022 (16)
abstracting: (0<=p56)
states: 57,787,817,188,951,654 (16)
abstracting: (p56<=0)
states: 48,631,731,647,932,006 (16)
abstracting: (0<=p113)
states: 57,787,817,188,951,654 (16)
abstracting: (p113<=0)
states: 57,787,817,180,128,114 (16)
abstracting: (0<=p74)
states: 57,787,817,188,951,654 (16)
abstracting: (p74<=0)
states: 43,340,914,470,412,870 (16)
abstracting: (0<=p63)
states: 57,787,817,188,951,654 (16)
abstracting: (p63<=0)
states: 47,041,059,154,701,670 (16)
abstracting: (1<=p36)
states: 14,436,945,662,054,400 (16)
abstracting: (p36<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p56)
states: 57,787,817,188,951,654 (16)
abstracting: (p56<=0)
states: 48,631,731,647,932,006 (16)
abstracting: (1<=p59)
states: 9,160,345,559,896,704 (15)
abstracting: (p59<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (1<=p124)
states: 30,161 (4)
abstracting: (p124<=1)
states: 57,787,817,188,951,654 (16)
abstracting: (0<=p150)
states: 57,787,817,188,951,654 (16)
abstracting: (p150<=0)
states: 57,787,817,188,559,561 (16)
abstracting: (0<=p61)
states: 57,787,817,188,951,654 (16)
abstracting: (p61<=0)
states: 56,406,004,340,920,054 (16)
abstracting: (0<=p40)
states: 57,787,817,188,951,654 (16)
abstracting: (p40<=0)
states: 57,787,816,368,664,150 (16)
abstracting: (0<=p31)
states: 57,787,817,188,951,654 (16)
abstracting: (p31<=0)
states: 43,350,803,098,705,510 (16)
abstracting: (0<=p137)
states: 57,787,817,188,951,654 (16)
abstracting: (p137<=0)
states: 52,195,447,783,372,703 (16)
abstracting: (1<=p99)
states: 11,381,821,068,775,104 (16)
abstracting: (p99<=1)
states: 57,787,817,188,951,654 (16)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.245sec

totally nodes used: 21014367 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35096255 108730674 143826929
used/not used/entry size/cache size: 56463396 10645468 16 1024MB
basic ops cache: hits/miss/sum: 10140435 39768281 49908716
used/not used/entry size/cache size: 16301697 475519 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 586348 3550647 4136995
used/not used/entry size/cache size: 2906168 5482440 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 50489665
1 13098404
2 2802440
3 586644
4 110806
5 17920
6 2614
7 328
8 40
9 3
>= 10 0

Total processing time: 1m 6.383sec


BK_STOP 1679498757340

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

199550
iterations count:124661 (909), effective:15274 (111)

initing FirstDep: 0m 0.000sec


iterations count:4775 (34), effective:357 (2)

iterations count:6268 (45), effective:425 (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="ShieldIIPt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPt-PT-004B, 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 r394-oct2-167903717700239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-004B.tgz
mv ShieldIIPt-PT-004B 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 ;