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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 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.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 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 253K 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-030A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679491551371

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:25:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:25:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:25:53] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-22 13:25:53] [INFO ] Transformed 753 places.
[2023-03-22 13:25:53] [INFO ] Transformed 723 transitions.
[2023-03-22 13:25:53] [INFO ] Found NUPN structural information;
[2023-03-22 13:25:53] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 10) seen :8
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-22 13:25:54] [INFO ] Computed 271 place invariants in 12 ms
[2023-03-22 13:25:54] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:25:54] [INFO ] [Nat]Absence check using 271 positive place invariants in 38 ms returned sat
[2023-03-22 13:25:55] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 23 ms to minimize.
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-22 13:25:56] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2023-03-22 13:25:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1089 ms
[2023-03-22 13:25:57] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:25:57] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2023-03-22 13:25:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:25:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2023-03-22 13:25:57] [INFO ] After 2735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 525 ms.
[2023-03-22 13:25:58] [INFO ] After 3503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 104 ms.
Support contains 39 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 0 with 189 rules applied. Total rules applied 193 place count 751 transition count 721
Applied a total of 193 rules in 151 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 751/753 places, 721/723 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 215907 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{0=1}
Probabilistic random walk after 215907 steps, saw 137231 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-22 13:26:01] [INFO ] Computed 271 place invariants in 21 ms
[2023-03-22 13:26:02] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:26:02] [INFO ] [Nat]Absence check using 264 positive place invariants in 103 ms returned sat
[2023-03-22 13:26:02] [INFO ] [Nat]Absence check using 264 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-22 13:26:02] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:26:03] [INFO ] After 95ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 2 ms to minimize.
[2023-03-22 13:26:03] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:26:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-22 13:26:05] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 13:26:05] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-22 13:26:05] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2181 ms
[2023-03-22 13:26:05] [INFO ] After 2364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-22 13:26:05] [INFO ] After 3549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 751 transition count 721
Applied a total of 9 rules in 81 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 751/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242339 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242339 steps, saw 170390 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-22 13:26:08] [INFO ] Computed 271 place invariants in 32 ms
[2023-03-22 13:26:09] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:26:09] [INFO ] [Nat]Absence check using 267 positive place invariants in 83 ms returned sat
[2023-03-22 13:26:09] [INFO ] [Nat]Absence check using 267 positive and 4 generalized place invariants in 0 ms returned sat
[2023-03-22 13:26:09] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:26:09] [INFO ] After 93ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:09] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-22 13:26:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 907 ms
[2023-03-22 13:26:10] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-22 13:26:10] [INFO ] After 1897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 20 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 19 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-22 13:26:11] [INFO ] Invariant cache hit.
[2023-03-22 13:26:11] [INFO ] Implicit Places using invariants in 731 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 735 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 771 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239329 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239329 steps, saw 167099 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-22 13:26:14] [INFO ] Computed 270 place invariants in 13 ms
[2023-03-22 13:26:15] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:26:15] [INFO ] [Nat]Absence check using 266 positive place invariants in 42 ms returned sat
[2023-03-22 13:26:15] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-22 13:26:15] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 23 ms to minimize.
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-22 13:26:16] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:26:17] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2023-03-22 13:26:17] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:26:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1146 ms
[2023-03-22 13:26:17] [INFO ] After 1851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-22 13:26:17] [INFO ] After 2196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 27 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 27 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 30 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-22 13:26:17] [INFO ] Invariant cache hit.
[2023-03-22 13:26:18] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-22 13:26:18] [INFO ] Invariant cache hit.
[2023-03-22 13:26:19] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2023-03-22 13:26:19] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 13:26:19] [INFO ] Invariant cache hit.
[2023-03-22 13:26:20] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 40 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 13:26:20] [INFO ] Invariant cache hit.
[2023-03-22 13:26:20] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:26:20] [INFO ] [Nat]Absence check using 266 positive place invariants in 33 ms returned sat
[2023-03-22 13:26:20] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 13:26:20] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:21] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-22 13:26:21] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-22 13:26:21] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:26:21] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:26:21] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-22 13:26:22] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2023-03-22 13:26:22] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-22 13:26:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-22 13:26:22] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:26:22] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-22 13:26:23] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-22 13:26:23] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 13:26:23] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-22 13:26:23] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-22 13:26:23] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 13:26:24] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:26:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:26:24] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:26:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3533 ms
[2023-03-22 13:26:24] [INFO ] After 4130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-22 13:26:24] [INFO ] After 4456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:26:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-22 13:26:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3657 arcs took 11 ms.
[2023-03-22 13:26:25] [INFO ] Flatten gal took : 138 ms
Total runtime 31606 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_030A
(NrP: 750 NrTr: 721 NrArc: 3657)

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

net check time: 0m 0.000sec

init dd package: 0m 2.953sec


before gc: list nodes free: 72688

after gc: idd nodes used:203782, unused:63796218; list nodes free:284276709

before gc: list nodes free: 14381

after gc: idd nodes used:192510, unused:63807490; list nodes free:286430251

before gc: list nodes free: 1061113

after gc: idd nodes used:190709, unused:63809291; list nodes free:286440076

before gc: list nodes free: 427762

after gc: idd nodes used:867681, unused:63132319; list nodes free:291697791

before gc: list nodes free: 6541973

after gc: idd nodes used:1576885, unused:62423115; list nodes free:288413981

before gc: list nodes free: 6937905

after gc: idd nodes used:1010404, unused:62989596; list nodes free:291031128

before gc: list nodes free: 833865

after gc: idd nodes used:1711524, unused:62288476; list nodes free:287780877
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6093252 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096288 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 ReachabilityCardinality -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.003sec

81106 125634 147127 175182 197769 208864 216340 229176 213328 162027 191032 164989 128361 159242 142339 186170 205839 188193 180320 186852 184491 162794 203230 201532 196547 203199 199055 945778 905897 1117210 1148847 1347709 1538636 1522747 1525717 1451833 1285966 1361120 1128365 1089803 1054350 1041110 1031528 916491 775835 1624068 1717019 1455459

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-030A"
export BK_EXAMINATION="ReachabilityCardinality"
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-030A, examination is ReachabilityCardinality"
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-167903717500118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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