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-167903717500079.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 ShieldIIPs-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 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.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 82K 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 ShieldIIPs-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679488204358

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=ShieldIIPs-PT-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 12:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:30:07] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-22 12:30:07] [INFO ] Transformed 303 places.
[2023-03-22 12:30:07] [INFO ] Transformed 298 transitions.
[2023-03-22 12:30:07] [INFO ] Found NUPN structural information;
[2023-03-22 12:30:07] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 298 rows 303 cols
[2023-03-22 12:30:07] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-22 12:30:08] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 12:30:08] [INFO ] [Nat]Absence check using 46 positive place invariants in 15 ms returned sat
[2023-03-22 12:30:08] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 6 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 12 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 5 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-03-22 12:30:09] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1021 ms
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 10 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2023-03-22 12:30:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 686 ms
[2023-03-22 12:30:10] [INFO ] After 2451ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-22 12:30:11] [INFO ] After 2918ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 108 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 298/298 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 303 transition count 290
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 295 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 294 transition count 289
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 18 place count 294 transition count 271
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 54 place count 276 transition count 271
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 73 place count 257 transition count 252
Iterating global reduction 3 with 19 rules applied. Total rules applied 92 place count 257 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 92 place count 257 transition count 250
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 255 transition count 250
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 160 place count 223 transition count 218
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 172 place count 223 transition count 218
Applied a total of 172 rules in 90 ms. Remains 223 /303 variables (removed 80) and now considering 218/298 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 223/303 places, 218/298 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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
Interrupted probabilistic random walk after 737894 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 737894 steps, saw 144904 distinct states, run finished after 3003 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 223 cols
[2023-03-22 12:30:14] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-22 12:30:14] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 12:30:14] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-22 12:30:14] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 12:30:15] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1464 ms
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-22 12:30:16] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2023-03-22 12:30:17] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 13 ms to minimize.
[2023-03-22 12:30:17] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2023-03-22 12:30:17] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-22 12:30:17] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-22 12:30:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 940 ms
[2023-03-22 12:30:17] [INFO ] After 2901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-22 12:30:17] [INFO ] After 3254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
Support contains 54 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 218/218 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 223 transition count 214
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 219 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 218 transition count 213
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 10 place count 218 transition count 206
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 24 place count 211 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 209 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 209 transition count 204
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 86 place count 180 transition count 175
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 97 place count 180 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 179 transition count 174
Applied a total of 98 rules in 55 ms. Remains 179 /223 variables (removed 44) and now considering 174/218 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 179/223 places, 174/218 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456380 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456380 steps, saw 279110 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 179 cols
[2023-03-22 12:30:20] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-22 12:30:20] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:30:21] [INFO ] [Nat]Absence check using 46 positive place invariants in 30 ms returned sat
[2023-03-22 12:30:21] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:30:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 12:30:21] [INFO ] After 98ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:30:21] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 27 ms to minimize.
[2023-03-22 12:30:21] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-22 12:30:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-22 12:30:21] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-22 12:30:21] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 54 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 174/174 transitions.
Applied a total of 0 rules in 13 ms. Remains 179 /179 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 179/179 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 174/174 transitions.
Applied a total of 0 rules in 11 ms. Remains 179 /179 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-22 12:30:21] [INFO ] Invariant cache hit.
[2023-03-22 12:30:22] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-22 12:30:22] [INFO ] Invariant cache hit.
[2023-03-22 12:30:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 12:30:22] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-22 12:30:22] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 12:30:22] [INFO ] Invariant cache hit.
[2023-03-22 12:30:22] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 179/179 places, 174/174 transitions.
Graph (complete) has 513 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 178 /179 variables (removed 1) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 178 cols
[2023-03-22 12:30:22] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-22 12:30:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:30:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-22 12:30:23] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-22 12:30:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 524 ms
[2023-03-22 12:30:23] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-22 12:30:23] [INFO ] After 832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:30:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-22 12:30:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 174 transitions and 672 arcs took 2 ms.
[2023-03-22 12:30:24] [INFO ] Flatten gal took : 89 ms
Total runtime 17138 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: ShieldIIPs_PT_005B
(NrP: 179 NrTr: 174 NrArc: 672)

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

net check time: 0m 0.000sec

init dd package: 0m 2.868sec


before gc: list nodes free: 432417

after gc: idd nodes used:1194432, unused:62805568; list nodes free:286115640

before gc: list nodes free: 163706

after gc: idd nodes used:1641237, unused:62358763; list nodes free:284084196

before gc: list nodes free: 1446369

after gc: idd nodes used:1833513, unused:62166487; list nodes free:285317291

before gc: list nodes free: 899104

after gc: idd nodes used:2351185, unused:61648815; list nodes free:282947990
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6130188 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098096 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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

235670 650080 1119190 1209469 1375965 1547446 1634878 1691631 2189169

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="ShieldIIPs-PT-005B"
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 ShieldIIPs-PT-005B, 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-167903717500079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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