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-167903717500135.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679492727640

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-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:45:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:45:30] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-22 13:45:30] [INFO ] Transformed 1003 places.
[2023-03-22 13:45:30] [INFO ] Transformed 963 transitions.
[2023-03-22 13:45:30] [INFO ] Found NUPN structural information;
[2023-03-22 13:45:30] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-22 13:45:31] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-22 13:45:32] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:45:32] [INFO ] [Nat]Absence check using 361 positive place invariants in 80 ms returned sat
[2023-03-22 13:45:35] [INFO ] After 2640ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-22 13:45:36] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 11 ms to minimize.
[2023-03-22 13:45:37] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 26 ms to minimize.
[2023-03-22 13:45:37] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-22 13:45:37] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-22 13:45:38] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 14 ms to minimize.
[2023-03-22 13:45:38] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 24 ms to minimize.
[2023-03-22 13:45:38] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-22 13:45:38] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-03-22 13:45:39] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-22 13:45:39] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2023-03-22 13:45:39] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:45:39] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2023-03-22 13:45:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3688 ms
[2023-03-22 13:45:41] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
[2023-03-22 13:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-22 13:45:41] [INFO ] After 9035ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2764 ms.
[2023-03-22 13:45:44] [INFO ] After 12445ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 542 ms.
Support contains 191 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 192 times.
Drop transitions removed 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 194 place count 1002 transition count 962
Applied a total of 194 rules in 215 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92536 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92536 steps, saw 85256 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-22 13:45:49] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-22 13:45:49] [INFO ] [Real]Absence check using 357 positive place invariants in 78 ms returned sat
[2023-03-22 13:45:49] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 13:45:49] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:45:50] [INFO ] [Nat]Absence check using 357 positive place invariants in 93 ms returned sat
[2023-03-22 13:45:50] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 13:45:52] [INFO ] After 2451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:45:53] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-22 13:45:53] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-22 13:45:53] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:45:53] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:45:53] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 17 ms to minimize.
[2023-03-22 13:45:54] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-22 13:45:54] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:45:54] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 13 ms to minimize.
[2023-03-22 13:45:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-22 13:45:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1855 ms
[2023-03-22 13:45:55] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-22 13:45:55] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-22 13:45:56] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 13:45:56] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2023-03-22 13:45:56] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-22 13:45:57] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-22 13:45:57] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-22 13:45:57] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2023-03-22 13:45:58] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:45:58] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-22 13:45:58] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 19 ms to minimize.
[2023-03-22 13:45:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3275 ms
[2023-03-22 13:45:59] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-22 13:45:59] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-22 13:45:59] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-22 13:45:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 746 ms
[2023-03-22 13:46:00] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 13:46:01] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2023-03-22 13:46:01] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2023-03-22 13:46:01] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-22 13:46:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1022 ms
[2023-03-22 13:46:01] [INFO ] After 11621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2993 ms.
[2023-03-22 13:46:04] [INFO ] After 15028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 353 ms.
Support contains 191 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 27 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1002/1002 places, 962/962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 37 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-22 13:46:05] [INFO ] Invariant cache hit.
[2023-03-22 13:46:05] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-22 13:46:05] [INFO ] Invariant cache hit.
[2023-03-22 13:46:07] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2023-03-22 13:46:07] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-22 13:46:07] [INFO ] Invariant cache hit.
[2023-03-22 13:46:08] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3080 ms. Remains : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 32 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 13:46:08] [INFO ] Invariant cache hit.
[2023-03-22 13:46:08] [INFO ] [Real]Absence check using 357 positive place invariants in 124 ms returned sat
[2023-03-22 13:46:08] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 13:46:08] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:46:09] [INFO ] [Nat]Absence check using 357 positive place invariants in 97 ms returned sat
[2023-03-22 13:46:09] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 13:46:11] [INFO ] After 2311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:46:11] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-22 13:46:12] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-22 13:46:12] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 14 ms to minimize.
[2023-03-22 13:46:12] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2023-03-22 13:46:12] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-22 13:46:12] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 14 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:46:13] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:46:14] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:46:14] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 13 ms to minimize.
[2023-03-22 13:46:14] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 13:46:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2783 ms
[2023-03-22 13:46:15] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:46:15] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-22 13:46:15] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:46:15] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-22 13:46:16] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-22 13:46:16] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-22 13:46:16] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2023-03-22 13:46:16] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-22 13:46:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1883 ms
[2023-03-22 13:46:17] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-22 13:46:17] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-22 13:46:17] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 27 ms to minimize.
[2023-03-22 13:46:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 664 ms
[2023-03-22 13:46:18] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:46:19] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 13 ms to minimize.
[2023-03-22 13:46:19] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-22 13:46:19] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-22 13:46:19] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:46:19] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-22 13:46:20] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-22 13:46:20] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:46:20] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-22 13:46:20] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-22 13:46:20] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-22 13:46:21] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:46:21] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-22 13:46:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2793 ms
[2023-03-22 13:46:21] [INFO ] After 12324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2325 ms.
[2023-03-22 13:46:23] [INFO ] After 15120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-22 13:46:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 28 ms.
[2023-03-22 13:46:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1002 places, 962 transitions and 4741 arcs took 13 ms.
[2023-03-22 13:46:24] [INFO ] Flatten gal took : 158 ms
Total runtime 54413 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_040A
(NrP: 1002 NrTr: 962 NrArc: 4741)

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

net check time: 0m 0.000sec

init dd package: 0m 2.826sec


before gc: list nodes free: 495981

after gc: idd nodes used:538074, unused:63461926; list nodes free:284814689

before gc: list nodes free: 662458

after gc: idd nodes used:907029, unused:63092971; list nodes free:287291195

before gc: list nodes free: 1803775

after gc: idd nodes used:1177007, unused:62822993; list nodes free:286038611

before gc: list nodes free: 3079883

after gc: idd nodes used:1370470, unused:62629530; list nodes free:285103219

before gc: list nodes free: 1684867

after gc: idd nodes used:1673791, unused:62326209; list nodes free:285785779

before gc: list nodes free: 4811716

after gc: idd nodes used:1629140, unused:62370860; list nodes free:286040037

before gc: list nodes free: 4318022

after gc: idd nodes used:1736627, unused:62263373; list nodes free:285510538

before gc: list nodes free: 2510027

after gc: idd nodes used:1710436, unused:62289564; list nodes free:285639510

before gc: list nodes free: 1295756

after gc: idd nodes used:3866806, unused:60133194; list nodes free:279512355
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6030788 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100564 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.005sec

515488 600162 1101821 1174027 1188089 1450419 1666290 1604015 1627974 1565800 4223324

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-040A"
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-040A, 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-167903717500135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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