About the Execution of Marcie+red for ResAllocation-PT-R003C100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9823.548 | 127479.00 | 142054.00 | 424.40 | FFFTTTTTTFFTFTTT | 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.r330-tall-167889203600727.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 ResAllocation-PT-R003C100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600727
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Feb 25 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 721K 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 ResAllocation-PT-R003C100-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679181449774
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:17:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:17:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:17:31] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-18 23:17:31] [INFO ] Transformed 600 places.
[2023-03-18 23:17:31] [INFO ] Transformed 400 transitions.
[2023-03-18 23:17:31] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 48 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) 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 6) seen :1
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 400 rows 600 cols
[2023-03-18 23:17:32] [INFO ] Computed 300 place invariants in 17 ms
[2023-03-18 23:17:33] [INFO ] [Real]Absence check using 300 positive place invariants in 48 ms returned sat
[2023-03-18 23:17:33] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 23:17:33] [INFO ] [Nat]Absence check using 300 positive place invariants in 43 ms returned sat
[2023-03-18 23:17:34] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 10 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 613 ms
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 862 ms
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 308 ms
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 441 ms
[2023-03-18 23:17:36] [INFO ] After 3662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 764 ms.
[2023-03-18 23:17:37] [INFO ] After 4697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 56 ms.
Support contains 171 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 555 transition count 355
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 91 place count 555 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 93 place count 553 transition count 354
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 553 transition count 353
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 552 transition count 352
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 2 with 41 rules applied. Total rules applied 137 place count 552 transition count 311
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_28_2.t_28_3 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 459 transition count 309
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 161 place count 447 transition count 299
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 447 transition count 294
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 172 place count 447 transition count 288
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 188 place count 433 transition count 286
Applied a total of 188 rules in 163 ms. Remains 433 /600 variables (removed 167) and now considering 286/400 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 433/600 places, 286/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255526 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255526 steps, saw 219606 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 433 cols
[2023-03-18 23:17:41] [INFO ] Computed 238 place invariants in 10 ms
[2023-03-18 23:17:41] [INFO ] [Real]Absence check using 238 positive place invariants in 27 ms returned sat
[2023-03-18 23:17:41] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:17:41] [INFO ] [Nat]Absence check using 238 positive place invariants in 29 ms returned sat
[2023-03-18 23:17:41] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:17:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-18 23:17:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 23:17:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-18 23:17:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-18 23:17:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-18 23:17:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-18 23:17:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:17:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 217 ms
[2023-03-18 23:17:42] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-18 23:17:42] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 171 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 286/286 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 433/433 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 286/286 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2023-03-18 23:17:42] [INFO ] Invariant cache hit.
[2023-03-18 23:17:42] [INFO ] Implicit Places using invariants in 191 ms returned [0, 118, 120, 121, 130, 131, 147, 149, 150, 151, 174, 175, 317, 318, 319, 430, 432]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 200 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 416/433 places, 286/286 transitions.
Applied a total of 0 rules in 11 ms. Remains 416 /416 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 224 ms. Remains : 416/433 places, 286/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 320878 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320878 steps, saw 267508 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 416 cols
[2023-03-18 23:17:46] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-18 23:17:46] [INFO ] [Real]Absence check using 221 positive place invariants in 28 ms returned sat
[2023-03-18 23:17:46] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:17:46] [INFO ] [Nat]Absence check using 221 positive place invariants in 27 ms returned sat
[2023-03-18 23:17:46] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 286 ms
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2023-03-18 23:17:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-18 23:17:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-18 23:17:47] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-18 23:17:47] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
Support contains 83 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 286/286 transitions.
Graph (trivial) has 9 edges and 416 vertex of which 2 / 416 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1351 edges and 415 vertex of which 407 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 57 rules applied. Total rules applied 59 place count 373 transition count 254
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 60 place count 373 transition count 253
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 369 transition count 249
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 369 transition count 247
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 369 transition count 244
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 80 place count 363 transition count 243
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 363 transition count 242
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 362 transition count 241
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 4 with 34 rules applied. Total rules applied 117 place count 362 transition count 207
Reduce places removed 81 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 93 rules applied. Total rules applied 210 place count 281 transition count 195
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 35 rules applied. Total rules applied 245 place count 260 transition count 181
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 250 place count 260 transition count 176
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 260 place count 260 transition count 166
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 287 place count 236 transition count 163
Applied a total of 287 rules in 74 ms. Remains 236 /416 variables (removed 180) and now considering 163/286 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 236/416 places, 163/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 5120 steps, including 1 resets, run visited all 1 properties in 27 ms. (steps per millisecond=189 )
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 16202 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ResAllocation_PT_R003C100
(NrP: 600 NrTr: 400 NrArc: 1794)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.022sec
net check time: 0m 0.000sec
init dd package: 0m 2.766sec
RS generation: 0m 0.209sec
-> reachability set: #nodes 4156 (4.2e+03) #states 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)
starting MCC model checker
--------------------------
checking: EF [IS_FIREABLE [t_94_2]]
normalized: E [true U IS_FIREABLE [t_94_2]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.300sec
checking: EF [IS_FIREABLE [t_36_3]]
normalized: E [true U IS_FIREABLE [t_36_3]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.354sec
checking: EF [IS_FIREABLE [t_7_1]]
normalized: E [true U IS_FIREABLE [t_7_1]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.467sec
checking: EF [IS_FIREABLE [t_68_2]]
normalized: E [true U IS_FIREABLE [t_68_2]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.203sec
checking: EF [IS_FIREABLE [t_18_3]]
normalized: E [true U IS_FIREABLE [t_18_3]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.443sec
checking: AG [~ [[[IS_FIREABLE [t_80_2] & ~ [IS_FIREABLE [t_33_3]]] & [IS_FIREABLE [t_86_0] | [IS_FIREABLE [t_80_0] | [IS_FIREABLE [t_86_1] | [~ [IS_FIREABLE [t_2_1]] | IS_FIREABLE [t_39_3]]]]]]]]
normalized: ~ [E [true U [[~ [IS_FIREABLE [t_33_3]] & IS_FIREABLE [t_80_2]] & [[[[~ [IS_FIREABLE [t_2_1]] | IS_FIREABLE [t_39_3]] | IS_FIREABLE [t_86_1]] | IS_FIREABLE [t_80_0]] | IS_FIREABLE [t_86_0]]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.352sec
checking: EF [[[~ [IS_FIREABLE [t_86_3]] | ~ [IS_FIREABLE [t_25_2]]] & [[~ [[[[~ [[IS_FIREABLE [t_75_2] | IS_FIREABLE [t_64_2]]] | IS_FIREABLE [t_11_3]] | IS_FIREABLE [t_25_0]] & [[[[IS_FIREABLE [t_1_2] | IS_FIREABLE [t_21_3]] & ~ [IS_FIREABLE [t_78_0]]] & ~ [[IS_FIREABLE [t_88_2] | IS_FIREABLE [t_36_2]]]] & IS_FIREABLE [t_13_1]]]] & IS_FIREABLE [t_87_1]] | IS_FIREABLE [t_79_1]]]]
normalized: E [true U [[~ [IS_FIREABLE [t_86_3]] | ~ [IS_FIREABLE [t_25_2]]] & [[~ [[[[~ [[IS_FIREABLE [t_75_2] | IS_FIREABLE [t_64_2]]] | IS_FIREABLE [t_11_3]] | IS_FIREABLE [t_25_0]] & [[[[IS_FIREABLE [t_1_2] | IS_FIREABLE [t_21_3]] & ~ [IS_FIREABLE [t_78_0]]] & ~ [[IS_FIREABLE [t_88_2] | IS_FIREABLE [t_36_2]]]] & IS_FIREABLE [t_13_1]]]] & IS_FIREABLE [t_87_1]] | IS_FIREABLE [t_79_1]]]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.561sec
checking: EF [[[[[~ [IS_FIREABLE [t_36_2]] & IS_FIREABLE [t_43_1]] & [[~ [[[~ [IS_FIREABLE [t_14_2]] | [IS_FIREABLE [t_15_3] & IS_FIREABLE [t_38_3]]] & IS_FIREABLE [t_34_3]]] | IS_FIREABLE [t_70_3]] | ~ [[[~ [IS_FIREABLE [t_28_0]] & IS_FIREABLE [t_65_0]] & [[IS_FIREABLE [t_6_3] & IS_FIREABLE [t_84_2]] & [IS_FIREABLE [t_87_2] & IS_FIREABLE [t_86_2]]]]]]] & IS_FIREABLE [t_94_0]] & IS_FIREABLE [t_4_1]]]
normalized: E [true U [[[[~ [[[[IS_FIREABLE [t_6_3] & IS_FIREABLE [t_84_2]] & [IS_FIREABLE [t_87_2] & IS_FIREABLE [t_86_2]]] & [~ [IS_FIREABLE [t_28_0]] & IS_FIREABLE [t_65_0]]]] | [~ [[[~ [IS_FIREABLE [t_14_2]] | [IS_FIREABLE [t_15_3] & IS_FIREABLE [t_38_3]]] & IS_FIREABLE [t_34_3]]] | IS_FIREABLE [t_70_3]]] & [~ [IS_FIREABLE [t_36_2]] & IS_FIREABLE [t_43_1]]] & IS_FIREABLE [t_94_0]] & IS_FIREABLE [t_4_1]]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.531sec
checking: EF [[[IS_FIREABLE [t_88_3] & [[[IS_FIREABLE [t_68_3] & IS_FIREABLE [t_63_2]] & IS_FIREABLE [t_31_1]] | ~ [IS_FIREABLE [t_33_3]]]] & ~ [[IS_FIREABLE [t_13_3] & [IS_FIREABLE [t_97_1] & ~ [[~ [[IS_FIREABLE [t_36_1] & [IS_FIREABLE [t_69_2] & IS_FIREABLE [t_55_1]]]] | [[[IS_FIREABLE [t_77_1] | IS_FIREABLE [t_11_0]] | [IS_FIREABLE [t_94_2] & IS_FIREABLE [t_97_3]]] & IS_FIREABLE [t_70_3]]]]]]]]]
normalized: E [true U [~ [[[~ [[[[[IS_FIREABLE [t_94_2] & IS_FIREABLE [t_97_3]] | [IS_FIREABLE [t_77_1] | IS_FIREABLE [t_11_0]]] & IS_FIREABLE [t_70_3]] | ~ [[[IS_FIREABLE [t_69_2] & IS_FIREABLE [t_55_1]] & IS_FIREABLE [t_36_1]]]]] & IS_FIREABLE [t_97_1]] & IS_FIREABLE [t_13_3]]] & [[~ [IS_FIREABLE [t_33_3]] | [[IS_FIREABLE [t_68_3] & IS_FIREABLE [t_63_2]] & IS_FIREABLE [t_31_1]]] & IS_FIREABLE [t_88_3]]]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.440sec
checking: AG [~ [[~ [IS_FIREABLE [t_1_2]] & ~ [[[[[[[IS_FIREABLE [t_68_0] & IS_FIREABLE [t_74_3]] | ~ [IS_FIREABLE [t_74_2]]] | ~ [IS_FIREABLE [t_43_2]]] & [[[IS_FIREABLE [t_45_1] | IS_FIREABLE [t_65_3]] & [IS_FIREABLE [t_21_3] & IS_FIREABLE [t_35_0]]] & [[IS_FIREABLE [t_2_2] & IS_FIREABLE [t_43_2]] & [IS_FIREABLE [t_70_3] & IS_FIREABLE [t_44_3]]]]] | ~ [[IS_FIREABLE [t_49_0] | [IS_FIREABLE [t_75_1] | IS_FIREABLE [t_64_3]]]]] | IS_FIREABLE [t_95_0]]]]]]
normalized: ~ [E [true U [~ [[[~ [[[IS_FIREABLE [t_75_1] | IS_FIREABLE [t_64_3]] | IS_FIREABLE [t_49_0]]] | [[[[IS_FIREABLE [t_70_3] & IS_FIREABLE [t_44_3]] & [IS_FIREABLE [t_2_2] & IS_FIREABLE [t_43_2]]] & [[IS_FIREABLE [t_21_3] & IS_FIREABLE [t_35_0]] & [IS_FIREABLE [t_45_1] | IS_FIREABLE [t_65_3]]]] & [~ [IS_FIREABLE [t_43_2]] | [~ [IS_FIREABLE [t_74_2]] | [IS_FIREABLE [t_68_0] & IS_FIREABLE [t_74_3]]]]]] | IS_FIREABLE [t_95_0]]] & ~ [IS_FIREABLE [t_1_2]]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.455sec
checking: EF [[IS_FIREABLE [t_55_1] & [[~ [[~ [IS_FIREABLE [t_3_0]] & ~ [IS_FIREABLE [t_77_1]]]] | [~ [[[[[IS_FIREABLE [t_30_0] & IS_FIREABLE [t_97_2]] & ~ [IS_FIREABLE [t_49_0]]] & IS_FIREABLE [t_82_2]] & [~ [IS_FIREABLE [t_28_2]] & [[IS_FIREABLE [t_52_0] & IS_FIREABLE [t_37_1]] & ~ [IS_FIREABLE [t_61_3]]]]]] & ~ [IS_FIREABLE [t_34_2]]]] & [~ [[~ [[[[IS_FIREABLE [t_33_2] | IS_FIREABLE [t_72_1]] | [IS_FIREABLE [t_46_2] | IS_FIREABLE [t_7_2]]] & [~ [IS_FIREABLE [t_20_1]] & ~ [IS_FIREABLE [t_85_3]]]]] & [~ [[IS_FIREABLE [t_40_0] & IS_FIREABLE [t_72_1]]] & [[[IS_FIREABLE [t_13_0] | IS_FIREABLE [t_14_1]] | IS_FIREABLE [t_85_0]] | ~ [[IS_FIREABLE [t_19_1] | IS_FIREABLE [t_37_3]]]]]]] | IS_FIREABLE [t_43_2]]]]]
normalized: E [true U [[[~ [[[[~ [[IS_FIREABLE [t_19_1] | IS_FIREABLE [t_37_3]]] | [[IS_FIREABLE [t_13_0] | IS_FIREABLE [t_14_1]] | IS_FIREABLE [t_85_0]]] & ~ [[IS_FIREABLE [t_40_0] & IS_FIREABLE [t_72_1]]]] & ~ [[[~ [IS_FIREABLE [t_85_3]] & ~ [IS_FIREABLE [t_20_1]]] & [[IS_FIREABLE [t_46_2] | IS_FIREABLE [t_7_2]] | [IS_FIREABLE [t_33_2] | IS_FIREABLE [t_72_1]]]]]]] | IS_FIREABLE [t_43_2]] & [[~ [IS_FIREABLE [t_34_2]] & ~ [[[[~ [IS_FIREABLE [t_61_3]] & [IS_FIREABLE [t_52_0] & IS_FIREABLE [t_37_1]]] & ~ [IS_FIREABLE [t_28_2]]] & [[~ [IS_FIREABLE [t_49_0]] & [IS_FIREABLE [t_30_0] & IS_FIREABLE [t_97_2]]] & IS_FIREABLE [t_82_2]]]]] | ~ [[~ [IS_FIREABLE [t_77_1]] & ~ [IS_FIREABLE [t_3_0]]]]]] & IS_FIREABLE [t_55_1]]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.072sec
checking: EF [[~ [[IS_FIREABLE [t_66_1] | [[[[[[IS_FIREABLE [t_49_3] | IS_FIREABLE [t_56_2]] | ~ [IS_FIREABLE [t_99_1]]] & [[IS_FIREABLE [t_84_1] | IS_FIREABLE [t_71_2]] & [IS_FIREABLE [t_32_2] | IS_FIREABLE [t_70_2]]]] & [IS_FIREABLE [t_5_3] & [[IS_FIREABLE [t_6_0] | IS_FIREABLE [t_20_3]] & [IS_FIREABLE [t_50_3] | IS_FIREABLE [t_48_3]]]]] & [IS_FIREABLE [t_74_2] | [~ [[IS_FIREABLE [t_53_3] | IS_FIREABLE [t_80_2]]] | ~ [IS_FIREABLE [t_87_3]]]]] & ~ [[[[IS_FIREABLE [t_50_3] | [IS_FIREABLE [t_56_2] | IS_FIREABLE [t_99_3]]] & IS_FIREABLE [t_35_3]] | [[~ [IS_FIREABLE [t_26_3]] | ~ [IS_FIREABLE [t_15_1]]] & ~ [IS_FIREABLE [t_88_3]]]]]]]] & [~ [[[IS_FIREABLE [t_66_2] | IS_FIREABLE [t_80_1]] & IS_FIREABLE [t_31_2]]] & [IS_FIREABLE [t_40_3] | IS_FIREABLE [t_61_0]]]]]
normalized: E [true U [[[IS_FIREABLE [t_40_3] | IS_FIREABLE [t_61_0]] & ~ [[[IS_FIREABLE [t_66_2] | IS_FIREABLE [t_80_1]] & IS_FIREABLE [t_31_2]]]] & ~ [[[~ [[[~ [IS_FIREABLE [t_88_3]] & [~ [IS_FIREABLE [t_15_1]] | ~ [IS_FIREABLE [t_26_3]]]] | [[[IS_FIREABLE [t_56_2] | IS_FIREABLE [t_99_3]] | IS_FIREABLE [t_50_3]] & IS_FIREABLE [t_35_3]]]] & [[[~ [IS_FIREABLE [t_87_3]] | ~ [[IS_FIREABLE [t_53_3] | IS_FIREABLE [t_80_2]]]] | IS_FIREABLE [t_74_2]] & [[[[IS_FIREABLE [t_50_3] | IS_FIREABLE [t_48_3]] & [IS_FIREABLE [t_6_0] | IS_FIREABLE [t_20_3]]] & IS_FIREABLE [t_5_3]] & [[[IS_FIREABLE [t_32_2] | IS_FIREABLE [t_70_2]] & [IS_FIREABLE [t_84_1] | IS_FIREABLE [t_71_2]]] & [~ [IS_FIREABLE [t_99_1]] | [IS_FIREABLE [t_49_3] | IS_FIREABLE [t_56_2]]]]]]] | IS_FIREABLE [t_66_1]]]]]
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.778sec
checking: AG [[[~ [[~ [[[~ [IS_FIREABLE [t_43_2]] & IS_FIREABLE [t_59_2]] | IS_FIREABLE [t_0_2]]] & [[IS_FIREABLE [t_5_1] | IS_FIREABLE [t_17_2]] & [[IS_FIREABLE [t_80_0] & [IS_FIREABLE [t_9_2] & ~ [IS_FIREABLE [t_91_2]]]] | [[[IS_FIREABLE [t_38_0] | IS_FIREABLE [t_30_0]] | IS_FIREABLE [t_38_1]] | [IS_FIREABLE [t_73_3] & ~ [IS_FIREABLE [t_37_3]]]]]]]] | ~ [IS_FIREABLE [t_56_1]]] | [[[[~ [[[IS_FIREABLE [t_44_1] & IS_FIREABLE [t_32_3]] | ~ [IS_FIREABLE [t_64_3]]]] & [[[IS_FIREABLE [t_54_1] | [IS_FIREABLE [t_29_3] | IS_FIREABLE [t_7_0]]] | IS_FIREABLE [t_54_1]] | IS_FIREABLE [t_34_0]]] & ~ [[[[IS_FIREABLE [t_66_1] | IS_FIREABLE [t_25_3]] & [[IS_FIREABLE [t_75_3] | IS_FIREABLE [t_1_1]] | IS_FIREABLE [t_59_0]]] | ~ [[[IS_FIREABLE [t_63_1] & IS_FIREABLE [t_59_0]] & ~ [IS_FIREABLE [t_78_0]]]]]]] | IS_FIREABLE [t_2_0]] & IS_FIREABLE [t_46_1]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [[~ [IS_FIREABLE [t_78_0]] & [IS_FIREABLE [t_63_1] & IS_FIREABLE [t_59_0]]]] | [[[IS_FIREABLE [t_75_3] | IS_FIREABLE [t_1_1]] | IS_FIREABLE [t_59_0]] & [IS_FIREABLE [t_66_1] | IS_FIREABLE [t_25_3]]]]] & [[[[[IS_FIREABLE [t_29_3] | IS_FIREABLE [t_7_0]] | IS_FIREABLE [t_54_1]] | IS_FIREABLE [t_54_1]] | IS_FIREABLE [t_34_0]] & ~ [[~ [IS_FIREABLE [t_64_3]] | [IS_FIREABLE [t_44_1] & IS_FIREABLE [t_32_3]]]]]] | IS_FIREABLE [t_2_0]] & IS_FIREABLE [t_46_1]] | [~ [IS_FIREABLE [t_56_1]] | ~ [[[[[[~ [IS_FIREABLE [t_37_3]] & IS_FIREABLE [t_73_3]] | [[IS_FIREABLE [t_38_0] | IS_FIREABLE [t_30_0]] | IS_FIREABLE [t_38_1]]] | [[~ [IS_FIREABLE [t_91_2]] & IS_FIREABLE [t_9_2]] & IS_FIREABLE [t_80_0]]] & [IS_FIREABLE [t_5_1] | IS_FIREABLE [t_17_2]]] & ~ [[[~ [IS_FIREABLE [t_43_2]] & IS_FIREABLE [t_59_2]] | IS_FIREABLE [t_0_2]]]]]]]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.937sec
checking: AG [~ [[IS_FIREABLE [t_29_3] & [[[IS_FIREABLE [t_16_1] | [IS_FIREABLE [t_42_1] & [[~ [IS_FIREABLE [t_18_3]] & [IS_FIREABLE [t_21_0] | IS_FIREABLE [t_34_2]]] & ~ [IS_FIREABLE [t_24_1]]]]] & [[[[IS_FIREABLE [t_31_1] | [IS_FIREABLE [t_77_1] & IS_FIREABLE [t_38_0]]] | [[IS_FIREABLE [t_25_2] | IS_FIREABLE [t_83_0]] & [IS_FIREABLE [t_98_3] | IS_FIREABLE [t_51_3]]]] & [~ [IS_FIREABLE [t_40_0]] | [[IS_FIREABLE [t_38_2] & IS_FIREABLE [t_86_3]] | [IS_FIREABLE [t_58_3] | IS_FIREABLE [t_74_2]]]]] & [[[[IS_FIREABLE [t_28_2] & IS_FIREABLE [t_64_0]] | IS_FIREABLE [t_5_3]] & ~ [[IS_FIREABLE [t_72_3] & IS_FIREABLE [t_56_3]]]] & [[[IS_FIREABLE [t_25_3] | IS_FIREABLE [t_42_3]] & [IS_FIREABLE [t_62_1] & IS_FIREABLE [t_66_1]]] & IS_FIREABLE [t_47_2]]]]] | [[IS_FIREABLE [t_5_1] & [IS_FIREABLE [t_2_2] & ~ [[~ [IS_FIREABLE [t_94_0]] & [IS_FIREABLE [t_67_3] & IS_FIREABLE [t_57_2]]]]]] & ~ [IS_FIREABLE [t_6_1]]]]]]]
normalized: ~ [E [true U [[[~ [IS_FIREABLE [t_6_1]] & [[~ [[[IS_FIREABLE [t_67_3] & IS_FIREABLE [t_57_2]] & ~ [IS_FIREABLE [t_94_0]]]] & IS_FIREABLE [t_2_2]] & IS_FIREABLE [t_5_1]]] | [[[[[[IS_FIREABLE [t_62_1] & IS_FIREABLE [t_66_1]] & [IS_FIREABLE [t_25_3] | IS_FIREABLE [t_42_3]]] & IS_FIREABLE [t_47_2]] & [~ [[IS_FIREABLE [t_72_3] & IS_FIREABLE [t_56_3]]] & [[IS_FIREABLE [t_28_2] & IS_FIREABLE [t_64_0]] | IS_FIREABLE [t_5_3]]]] & [[[[IS_FIREABLE [t_58_3] | IS_FIREABLE [t_74_2]] | [IS_FIREABLE [t_38_2] & IS_FIREABLE [t_86_3]]] | ~ [IS_FIREABLE [t_40_0]]] & [[[IS_FIREABLE [t_98_3] | IS_FIREABLE [t_51_3]] & [IS_FIREABLE [t_25_2] | IS_FIREABLE [t_83_0]]] | [[IS_FIREABLE [t_77_1] & IS_FIREABLE [t_38_0]] | IS_FIREABLE [t_31_1]]]]] & [[[~ [IS_FIREABLE [t_24_1]] & [[IS_FIREABLE [t_21_0] | IS_FIREABLE [t_34_2]] & ~ [IS_FIREABLE [t_18_3]]]] & IS_FIREABLE [t_42_1]] | IS_FIREABLE [t_16_1]]]] & IS_FIREABLE [t_29_3]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 5.763sec
checking: AG [[[~ [[[[[~ [[IS_FIREABLE [t_50_2] | IS_FIREABLE [t_54_1]]] | ~ [[IS_FIREABLE [t_91_3] & IS_FIREABLE [t_34_2]]]] & [[[IS_FIREABLE [t_6_2] | IS_FIREABLE [t_80_1]] & [IS_FIREABLE [t_41_0] | IS_FIREABLE [t_34_3]]] | IS_FIREABLE [t_47_3]]] & [[[[IS_FIREABLE [t_56_2] & IS_FIREABLE [t_5_1]] & ~ [IS_FIREABLE [t_70_0]]] & ~ [[IS_FIREABLE [t_8_2] & IS_FIREABLE [t_34_2]]]] | IS_FIREABLE [t_61_1]]] & IS_FIREABLE [t_52_2]]] | [~ [IS_FIREABLE [t_2_3]] & IS_FIREABLE [t_5_3]]] | ~ [[[IS_FIREABLE [t_70_2] & [[[[[IS_FIREABLE [t_22_2] & IS_FIREABLE [t_5_2]] | [IS_FIREABLE [t_69_2] & IS_FIREABLE [t_54_1]]] & [[IS_FIREABLE [t_88_3] & IS_FIREABLE [t_71_2]] | ~ [IS_FIREABLE [t_17_0]]]] & [~ [[IS_FIREABLE [t_82_3] & IS_FIREABLE [t_99_1]]] | [IS_FIREABLE [t_90_1] | IS_FIREABLE [t_55_2]]]] & [[[[IS_FIREABLE [t_63_3] | IS_FIREABLE [t_74_0]] | [IS_FIREABLE [t_87_3] & IS_FIREABLE [t_73_1]]] | [[IS_FIREABLE [t_25_0] | IS_FIREABLE [t_14_0]] | [IS_FIREABLE [t_39_0] & IS_FIREABLE [t_75_0]]]] | IS_FIREABLE [t_15_2]]]] & IS_FIREABLE [t_40_3]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[[[[IS_FIREABLE [t_39_0] & IS_FIREABLE [t_75_0]] | [IS_FIREABLE [t_25_0] | IS_FIREABLE [t_14_0]]] | [[IS_FIREABLE [t_87_3] & IS_FIREABLE [t_73_1]] | [IS_FIREABLE [t_63_3] | IS_FIREABLE [t_74_0]]]] | IS_FIREABLE [t_15_2]] & [[[IS_FIREABLE [t_90_1] | IS_FIREABLE [t_55_2]] | ~ [[IS_FIREABLE [t_82_3] & IS_FIREABLE [t_99_1]]]] & [[~ [IS_FIREABLE [t_17_0]] | [IS_FIREABLE [t_88_3] & IS_FIREABLE [t_71_2]]] & [[IS_FIREABLE [t_69_2] & IS_FIREABLE [t_54_1]] | [IS_FIREABLE [t_22_2] & IS_FIREABLE [t_5_2]]]]]] & IS_FIREABLE [t_70_2]] & IS_FIREABLE [t_40_3]]] | [[~ [IS_FIREABLE [t_2_3]] & IS_FIREABLE [t_5_3]] | ~ [[[[[~ [[IS_FIREABLE [t_8_2] & IS_FIREABLE [t_34_2]]] & [~ [IS_FIREABLE [t_70_0]] & [IS_FIREABLE [t_56_2] & IS_FIREABLE [t_5_1]]]] | IS_FIREABLE [t_61_1]] & [[[[IS_FIREABLE [t_41_0] | IS_FIREABLE [t_34_3]] & [IS_FIREABLE [t_6_2] | IS_FIREABLE [t_80_1]]] | IS_FIREABLE [t_47_3]] & [~ [[IS_FIREABLE [t_91_3] & IS_FIREABLE [t_34_2]]] | ~ [[IS_FIREABLE [t_50_2] | IS_FIREABLE [t_54_1]]]]]] & IS_FIREABLE [t_52_2]]]]]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.375sec
checking: AG [[[~ [[~ [[~ [IS_FIREABLE [t_2_1]] & ~ [IS_FIREABLE [t_34_2]]]] & [[IS_FIREABLE [t_79_2] & IS_FIREABLE [t_92_0]] & [[[[IS_FIREABLE [t_38_3] & IS_FIREABLE [t_82_2]] & [IS_FIREABLE [t_88_1] & IS_FIREABLE [t_68_2]]] & ~ [[IS_FIREABLE [t_65_3] & IS_FIREABLE [t_58_2]]]] | [IS_FIREABLE [t_94_2] & [IS_FIREABLE [t_36_3] & [IS_FIREABLE [t_42_0] & IS_FIREABLE [t_35_2]]]]]]]] | [[~ [[IS_FIREABLE [t_19_0] & IS_FIREABLE [t_17_1]]] & ~ [[IS_FIREABLE [t_49_1] | ~ [[IS_FIREABLE [t_61_2] & IS_FIREABLE [t_94_2]]]]]] & ~ [IS_FIREABLE [t_14_2]]]] | [[[~ [[IS_FIREABLE [t_93_0] & [~ [IS_FIREABLE [t_80_0]] & [IS_FIREABLE [t_88_3] | IS_FIREABLE [t_5_2]]]]] & [[[IS_FIREABLE [t_52_3] & IS_FIREABLE [t_35_0]] & ~ [[IS_FIREABLE [t_26_3] & ~ [IS_FIREABLE [t_57_2]]]]] & IS_FIREABLE [t_22_0]]] | [[IS_FIREABLE [t_60_2] & [[[[IS_FIREABLE [t_4_3] & IS_FIREABLE [t_85_2]] | IS_FIREABLE [t_93_2]] & [[IS_FIREABLE [t_10_1] | IS_FIREABLE [t_95_0]] & ~ [IS_FIREABLE [t_65_2]]]] | [IS_FIREABLE [t_18_0] & IS_FIREABLE [t_65_0]]]] | [[[IS_FIREABLE [t_79_1] | ~ [IS_FIREABLE [t_50_3]]] | ~ [[IS_FIREABLE [t_98_2] | IS_FIREABLE [t_30_1]]]] | IS_FIREABLE [t_64_1]]]] | IS_FIREABLE [t_82_1]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [[IS_FIREABLE [t_98_2] | IS_FIREABLE [t_30_1]]] | [~ [IS_FIREABLE [t_50_3]] | IS_FIREABLE [t_79_1]]] | IS_FIREABLE [t_64_1]] | [[[IS_FIREABLE [t_18_0] & IS_FIREABLE [t_65_0]] | [[~ [IS_FIREABLE [t_65_2]] & [IS_FIREABLE [t_10_1] | IS_FIREABLE [t_95_0]]] & [[IS_FIREABLE [t_4_3] & IS_FIREABLE [t_85_2]] | IS_FIREABLE [t_93_2]]]] & IS_FIREABLE [t_60_2]]] | [[[~ [[~ [IS_FIREABLE [t_57_2]] & IS_FIREABLE [t_26_3]]] & [IS_FIREABLE [t_52_3] & IS_FIREABLE [t_35_0]]] & IS_FIREABLE [t_22_0]] & ~ [[[[IS_FIREABLE [t_88_3] | IS_FIREABLE [t_5_2]] & ~ [IS_FIREABLE [t_80_0]]] & IS_FIREABLE [t_93_0]]]]] | IS_FIREABLE [t_82_1]] | [[~ [IS_FIREABLE [t_14_2]] & [~ [[~ [[IS_FIREABLE [t_61_2] & IS_FIREABLE [t_94_2]]] | IS_FIREABLE [t_49_1]]] & ~ [[IS_FIREABLE [t_19_0] & IS_FIREABLE [t_17_1]]]]] | ~ [[[[[[[IS_FIREABLE [t_42_0] & IS_FIREABLE [t_35_2]] & IS_FIREABLE [t_36_3]] & IS_FIREABLE [t_94_2]] | [~ [[IS_FIREABLE [t_65_3] & IS_FIREABLE [t_58_2]]] & [[IS_FIREABLE [t_88_1] & IS_FIREABLE [t_68_2]] & [IS_FIREABLE [t_38_3] & IS_FIREABLE [t_82_2]]]]] & [IS_FIREABLE [t_79_2] & IS_FIREABLE [t_92_0]]] & ~ [[~ [IS_FIREABLE [t_34_2]] & ~ [IS_FIREABLE [t_2_1]]]]]]]]]]]
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.440sec
totally nodes used: 61676581 (6.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34617302 191930011 226547313
used/not used/entry size/cache size: 65392749 1716115 16 1024MB
basic ops cache: hits/miss/sum: 9612429 53056686 62669115
used/not used/entry size/cache size: 16745398 31818 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: 698 4156 4854
used/not used/entry size/cache size: 4155 8384453 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 26985064
1 24352270
2 11236674
3 3511886
4 834029
5 159148
6 25622
7 3705
8 416
9 46
>= 10 4
Total processing time: 1m48.849sec
BK_STOP 1679181577253
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
iterations count:3051 (7), effective:600 (1)
initing FirstDep: 0m 0.003sec
iterations count:500 (1), effective:15 (0)
iterations count:499 (1), effective:15 (0)
iterations count:501 (1), effective:15 (0)
iterations count:500 (1), effective:15 (0)
iterations count:499 (1), effective:15 (0)
iterations count:578 (1), effective:31 (0)
iterations count:711 (1), effective:49 (0)
iterations count:608 (1), effective:31 (0)
iterations count:677 (1), effective:44 (0)
iterations count:713 (1), effective:47 (0)
iterations count:1332 (3), effective:138 (0)
iterations count:732 (1), effective:52 (0)
iterations count:1047 (2), effective:103 (0)
iterations count:2150 (5), effective:263 (0)
iterations count:1526 (3), effective:167 (0)
iterations count:1790 (4), effective:213 (0)
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="ResAllocation-PT-R003C100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ResAllocation-PT-R003C100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203600727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;