About the Execution of Marcie+red for DES-PT-00b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5515.323 | 19586.00 | 25340.00 | 412.00 | FFFTFTFTFFTTFFTF | normal |
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.r106-tall-167814482600358.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-00b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482600358
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 66K Mar 5 18:22 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 DES-PT-00b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678377165999
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=DES-PT-00b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 15:52:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 15:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:52:47] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-09 15:52:47] [INFO ] Transformed 271 places.
[2023-03-09 15:52:47] [INFO ] Transformed 230 transitions.
[2023-03-09 15:52:47] [INFO ] Found NUPN structural information;
[2023-03-09 15:52:47] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-00b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 88 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 13) seen :11
FORMULA DES-PT-00b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
FORMULA DES-PT-00b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 230 rows 271 cols
[2023-03-09 15:52:48] [INFO ] Computed 59 place invariants in 20 ms
[2023-03-09 15:52:48] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:52:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2023-03-09 15:52:48] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 7 ms returned sat
[2023-03-09 15:52:48] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:48] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
[2023-03-09 15:52:48] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-09 15:52:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-09 15:52:48] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:52:48] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 230/230 transitions.
Graph (complete) has 489 edges and 271 vertex of which 265 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 265 transition count 201
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 242 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 240 transition count 199
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 53 place count 240 transition count 190
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 231 transition count 190
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 89 place count 213 transition count 172
Iterating global reduction 3 with 18 rules applied. Total rules applied 107 place count 213 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 107 place count 213 transition count 171
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 212 transition count 171
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 123 place count 198 transition count 157
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 198 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 15 rules applied. Total rules applied 152 place count 198 transition count 142
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 196 transition count 141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 196 transition count 138
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 193 transition count 138
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 301 place count 123 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 122 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 304 place count 122 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 305 place count 121 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 120 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 307 place count 119 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 118 transition count 65
Applied a total of 309 rules in 89 ms. Remains 118 /271 variables (removed 153) and now considering 65/230 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 118/271 places, 65/230 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2191316 steps, run timeout after 3001 ms. (steps per millisecond=730 ) properties seen :{}
Probabilistic random walk after 2191316 steps, saw 311633 distinct states, run finished after 3005 ms. (steps per millisecond=729 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 118 cols
[2023-03-09 15:52:51] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-09 15:52:51] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:52:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 15:52:51] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-09 15:52:51] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 15:52:51] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-09 15:52:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-09 15:52:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2023-03-09 15:52:52] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 15:52:52] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-09 15:52:52] [INFO ] Invariant cache hit.
[2023-03-09 15:52:52] [INFO ] Implicit Places using invariants in 76 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 117/118 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85 ms. Remains : 117/118 places, 65/65 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2322130 steps, run timeout after 3001 ms. (steps per millisecond=773 ) properties seen :{}
Probabilistic random walk after 2322130 steps, saw 331117 distinct states, run finished after 3001 ms. (steps per millisecond=773 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 117 cols
[2023-03-09 15:52:55] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-09 15:52:55] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:52:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:52:55] [INFO ] [Nat]Absence check using 35 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-09 15:52:55] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 15:52:55] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:55] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2023-03-09 15:52:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-09 15:52:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-09 15:52:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 104 ms
[2023-03-09 15:52:55] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 15:52:55] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 117/117 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-09 15:52:55] [INFO ] Invariant cache hit.
[2023-03-09 15:52:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 15:52:55] [INFO ] Invariant cache hit.
[2023-03-09 15:52:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 15:52:55] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-09 15:52:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:52:55] [INFO ] Invariant cache hit.
[2023-03-09 15:52:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 117/117 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 15:52:55] [INFO ] Invariant cache hit.
[2023-03-09 15:52:55] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:52:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:52:55] [INFO ] [Nat]Absence check using 35 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-09 15:52:55] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-09 15:52:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-09 15:52:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-09 15:52:55] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 15:52:55] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:52:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2023-03-09 15:52:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 65 transitions and 312 arcs took 1 ms.
[2023-03-09 15:52:56] [INFO ] Flatten gal took : 27 ms
Total runtime 8696 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: DES_PT_00b
(NrP: 117 NrTr: 65 NrArc: 312)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.673sec
RS generation: 0m 3.940sec
-> reachability set: #nodes 9102 (9.1e+03) #states 11,730,459,314 (10)
starting MCC model checker
--------------------------
checking: AG [[[[1<=p108 & p108<=1] | [p75<=0 & 0<=p75]] | [[0<=p1 & p1<=0] | [p4<=1 & 1<=p4]]]]
normalized: ~ [E [true U ~ [[[[p75<=0 & 0<=p75] | [1<=p108 & p108<=1]] | [[0<=p1 & p1<=0] | [p4<=1 & 1<=p4]]]]]]
abstracting: (1<=p4)
states: 3,909,870,404 (9)
abstracting: (p4<=1)
states: 11,730,459,314 (10)
abstracting: (p1<=0)
states: 11,730,459,313 (10)
abstracting: (0<=p1)
states: 11,730,459,314 (10)
abstracting: (p108<=1)
states: 11,730,459,314 (10)
abstracting: (1<=p108)
states: 1,045,309,776 (9)
abstracting: (0<=p75)
states: 11,730,459,314 (10)
abstracting: (p75<=0)
states: 4,742,546,162 (9)
-> the formula is TRUE
FORMULA DES-PT-00b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
totally nodes used: 1267504 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4250529 16669953 20920482
used/not used/entry size/cache size: 15699794 51409070 16 1024MB
basic ops cache: hits/miss/sum: 28298 133563 161861
used/not used/entry size/cache size: 241842 16535374 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4626 25087 29713
used/not used/entry size/cache size: 25076 8363532 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65920665
1 1117428
2 62991
3 7078
4 651
5 50
6 1
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.422sec
BK_STOP 1678377185585
--------------------
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.000sec
iterations count:33265 (511), effective:3349 (51)
initing FirstDep: 0m 0.000sec
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="DES-PT-00b"
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 DES-PT-00b, 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 r106-tall-167814482600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00b.tgz
mv DES-PT-00b 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 '
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 ;