Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800350.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 1.3M 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 ShieldRVt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679350914052

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=ShieldRVt-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:21:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:21:57] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-03-20 22:21:57] [INFO ] Transformed 5003 places.
[2023-03-20 22:21:57] [INFO ] Transformed 5003 transitions.
[2023-03-20 22:21:57] [INFO ] Found NUPN structural information;
[2023-03-20 22:21:57] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=12 ) properties (out of 14) seen :6
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5003 rows 5003 cols
[2023-03-20 22:21:58] [INFO ] Computed 401 place invariants in 52 ms
[2023-03-20 22:22:01] [INFO ] After 2305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:22:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 310 ms returned sat
[2023-03-20 22:22:26] [INFO ] After 22213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 22:22:26] [INFO ] After 22242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 22:22:26] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 95 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions removed 1511 transitions
Trivial Post-agglo rules discarded 1511 transitions
Performed 1511 trivial Post agglomeration. Transition count delta: 1511
Iterating post reduction 0 with 1511 rules applied. Total rules applied 1511 place count 5003 transition count 3492
Reduce places removed 1511 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1513 rules applied. Total rules applied 3024 place count 3492 transition count 3490
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 3052 place count 3491 transition count 3463
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 3079 place count 3464 transition count 3463
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 408 Pre rules applied. Total rules applied 3079 place count 3464 transition count 3055
Deduced a syphon composed of 408 places in 29 ms
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 816 rules applied. Total rules applied 3895 place count 3056 transition count 3055
Discarding 665 places :
Symmetric choice reduction at 4 with 665 rule applications. Total rules 4560 place count 2391 transition count 2390
Iterating global reduction 4 with 665 rules applied. Total rules applied 5225 place count 2391 transition count 2390
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 283 Pre rules applied. Total rules applied 5225 place count 2391 transition count 2107
Deduced a syphon composed of 283 places in 7 ms
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 4 with 566 rules applied. Total rules applied 5791 place count 2108 transition count 2107
Performed 878 Post agglomeration using F-continuation condition.Transition count delta: 878
Deduced a syphon composed of 878 places in 8 ms
Reduce places removed 878 places and 0 transitions.
Iterating global reduction 4 with 1756 rules applied. Total rules applied 7547 place count 1230 transition count 1229
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7749 place count 1129 transition count 1322
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7951 place count 1028 transition count 1408
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 8093 place count 957 transition count 1471
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8094 place count 957 transition count 1470
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 8100 place count 957 transition count 1464
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 8106 place count 951 transition count 1464
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 8111 place count 951 transition count 1459
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 8114 place count 951 transition count 1459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8115 place count 950 transition count 1458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8116 place count 949 transition count 1458
Applied a total of 8116 rules in 2004 ms. Remains 949 /5003 variables (removed 4054) and now considering 1458/5003 (removed 3545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2012 ms. Remains : 949/5003 places, 1458/5003 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 72276 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72276 steps, saw 43665 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1458 rows 949 cols
[2023-03-20 22:22:32] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 22:22:33] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:22:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 86 ms returned sat
[2023-03-20 22:22:34] [INFO ] After 1095ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 22:22:34] [INFO ] State equation strengthened by 361 read => feed constraints.
[2023-03-20 22:22:36] [INFO ] After 1684ms SMT Verify possible using 361 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:22:37] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 5 ms to minimize.
[2023-03-20 22:22:37] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-20 22:22:37] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 22:22:37] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-20 22:22:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1008 ms
[2023-03-20 22:22:38] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-20 22:22:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-20 22:22:38] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-20 22:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-20 22:22:39] [INFO ] After 4921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1793 ms.
[2023-03-20 22:22:41] [INFO ] After 8290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 363 ms.
Support contains 95 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 1458/1458 transitions.
Applied a total of 0 rules in 58 ms. Remains 949 /949 variables (removed 0) and now considering 1458/1458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 949/949 places, 1458/1458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 1458/1458 transitions.
Applied a total of 0 rules in 75 ms. Remains 949 /949 variables (removed 0) and now considering 1458/1458 (removed 0) transitions.
[2023-03-20 22:22:41] [INFO ] Invariant cache hit.
[2023-03-20 22:22:43] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2023-03-20 22:22:43] [INFO ] Invariant cache hit.
[2023-03-20 22:22:44] [INFO ] State equation strengthened by 361 read => feed constraints.
[2023-03-20 22:22:48] [INFO ] Implicit Places using invariants and state equation in 4575 ms returned []
Implicit Place search using SMT with State Equation took 6132 ms to find 0 implicit places.
[2023-03-20 22:22:48] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-20 22:22:48] [INFO ] Invariant cache hit.
[2023-03-20 22:22:49] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7299 ms. Remains : 949/949 places, 1458/1458 transitions.
Graph (trivial) has 331 edges and 949 vertex of which 2 / 949 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 330 edges and 947 vertex of which 2 / 947 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 946 transition count 1453
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 944 transition count 1450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 944 transition count 1449
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 942 transition count 1449
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 40 place count 942 transition count 1423
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 76 place count 942 transition count 1423
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 106 place count 942 transition count 1393
Applied a total of 106 rules in 265 ms. Remains 942 /949 variables (removed 7) and now considering 1393/1458 (removed 65) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1393 rows 942 cols
[2023-03-20 22:22:49] [INFO ] Computed 397 place invariants in 4 ms
[2023-03-20 22:22:49] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:22:50] [INFO ] [Nat]Absence check using 397 positive place invariants in 86 ms returned sat
[2023-03-20 22:22:51] [INFO ] After 927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 22:22:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 22:22:51] [INFO ] After 424ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:22:51] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-20 22:22:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 22:22:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2023-03-20 22:22:52] [INFO ] After 1453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 470 ms.
[2023-03-20 22:22:53] [INFO ] After 3311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:22:53] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 22:22:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 949 places, 1458 transitions and 7750 arcs took 16 ms.
[2023-03-20 22:22:53] [INFO ] Flatten gal took : 141 ms
Total runtime 56720 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: ShieldRVt_PT_100B
(NrP: 949 NrTr: 1458 NrArc: 7750)

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

net check time: 0m 0.001sec

init dd package: 0m 3.202sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6321948 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098992 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.017sec

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="ShieldRVt-PT-100B"
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 ShieldRVt-PT-100B, 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 r426-tajo-167905978800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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