About the Execution of Marcie+red for HirschbergSinclair-PT-15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5770.195 | 33464.00 | 47163.00 | 521.90 | TTFTFTTTTTTTFFFT | 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.r202-smll-167840348700447.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 HirschbergSinclair-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700447
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 173K 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 HirschbergSinclair-PT-15-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678790634545
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=HirschbergSinclair-PT-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 10:43:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:43:57] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-14 10:43:57] [INFO ] Transformed 330 places.
[2023-03-14 10:43:57] [INFO ] Transformed 296 transitions.
[2023-03-14 10:43:57] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 33 resets, run finished after 758 ms. (steps per millisecond=13 ) properties (out of 16) seen :12
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :1
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 296 rows 330 cols
[2023-03-14 10:43:58] [INFO ] Computed 34 place invariants in 16 ms
[2023-03-14 10:43:59] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2023-03-14 10:43:59] [INFO ] [Real]Absence check using 30 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 10:43:59] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-14 10:43:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2023-03-14 10:43:59] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 10:43:59] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-14 10:43:59] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 7 ms to minimize.
[2023-03-14 10:44:00] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2023-03-14 10:44:00] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2023-03-14 10:44:00] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2023-03-14 10:44:00] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 1 ms to minimize.
[2023-03-14 10:44:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 815 ms
[2023-03-14 10:44:00] [INFO ] After 1338ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-14 10:44:00] [INFO ] After 1675ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 31 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 296/296 transitions.
Graph (complete) has 628 edges and 330 vertex of which 312 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 312 transition count 226
Reduce places removed 67 places and 0 transitions.
Graph (complete) has 430 edges and 245 vertex of which 228 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 68 rules applied. Total rules applied 139 place count 228 transition count 226
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 156 place count 228 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 163 place count 221 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 170 place count 221 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 218 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 218 transition count 199
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 185 place count 218 transition count 190
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 194 place count 209 transition count 190
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 202 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 201 transition count 183
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 202 place count 201 transition count 175
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 218 place count 193 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 192 transition count 174
Applied a total of 220 rules in 136 ms. Remains 192 /330 variables (removed 138) and now considering 174/296 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 192/330 places, 174/296 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 580192 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 580192 steps, saw 123240 distinct states, run finished after 3004 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 192 cols
[2023-03-14 10:44:04] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-14 10:44:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 10:44:04] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 30 ms returned sat
[2023-03-14 10:44:04] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:44:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:44:04] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 28 ms returned sat
[2023-03-14 10:44:04] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:44:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:04] [INFO ] After 76ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 10:44:04] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-14 10:44:04] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 31 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 174/174 transitions.
Applied a total of 0 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 192/192 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 174/174 transitions.
Applied a total of 0 rules in 16 ms. Remains 192 /192 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-14 10:44:05] [INFO ] Invariant cache hit.
[2023-03-14 10:44:05] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-14 10:44:05] [INFO ] Invariant cache hit.
[2023-03-14 10:44:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:05] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-14 10:44:05] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 10:44:05] [INFO ] Invariant cache hit.
[2023-03-14 10:44:05] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 968 ms. Remains : 192/192 places, 174/174 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 191 transition count 161
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 178 transition count 161
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 27 place count 178 transition count 136
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 77 place count 153 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 152 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 152 transition count 135
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 80 place count 151 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 149 transition count 133
Applied a total of 84 rules in 41 ms. Remains 149 /192 variables (removed 43) and now considering 133/174 (removed 41) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 133 rows 149 cols
[2023-03-14 10:44:06] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-14 10:44:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:44:06] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 20 ms returned sat
[2023-03-14 10:44:06] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:44:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:44:06] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 18 ms returned sat
[2023-03-14 10:44:06] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:44:06] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-14 10:44:06] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 10:44:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-14 10:44:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 174 transitions and 565 arcs took 3 ms.
[2023-03-14 10:44:06] [INFO ] Flatten gal took : 61 ms
Total runtime 9540 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: leader
(NrP: 192 NrTr: 174 NrArc: 565)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.000sec
init dd package: 0m 3.370sec
RS generation: 0m 4.328sec
-> reachability set: #nodes 197340 (2.0e+05) #states 142,090,035,528 (11)
starting MCC model checker
--------------------------
checking: AG [[[[[[1<=p172 & 1<=p8] & [1<=p39 & 1<=p10]] | [[1<=p39 & 1<=p10] & 1<=p80]] | [[[[1<=p31 & 1<=p52] | [1<=p74 & 1<=p20]] & 1<=p16] | p151<=0]] | [[p38<=0 | p46<=0] | [p14<=0 | 1<=p60]]]]
normalized: ~ [E [true U ~ [[[[[[1<=p39 & 1<=p10] & 1<=p80] | [[1<=p172 & 1<=p8] & [1<=p39 & 1<=p10]]] | [[[[1<=p74 & 1<=p20] | [1<=p31 & 1<=p52]] & 1<=p16] | p151<=0]] | [[p38<=0 | p46<=0] | [p14<=0 | 1<=p60]]]]]]
abstracting: (1<=p60)
states: 661,744,160 (8)
abstracting: (p14<=0)
states: 79,869,942,448 (10)
abstracting: (p46<=0)
states: 81,721,202,062 (10)
abstracting: (p38<=0)
states: 120,608,225,228 (11)
abstracting: (p151<=0)
states: 140,812,646,016 (11)
abstracting: (1<=p16)
states: 9,207,267,608 (9)
abstracting: (1<=p52)
states: 31,110,046,540 (10)
abstracting: (1<=p31)
states: 22,311,905,748 (10)
abstracting: (1<=p20)
states: 75,792,609,510 (10)
abstracting: (1<=p74)
states: 2,541,699,160 (9)
abstracting: (1<=p10)
states: 69,897,010,670 (10)
abstracting: (1<=p39)
states: 36,707,340,800 (10)
abstracting: (1<=p8)
states: 70,318,969,930 (10)
abstracting: (1<=p172)
states: 2,910,780,252 (9)
abstracting: (1<=p80)
states: 1,270,849,580 (9)
abstracting: (1<=p10)
states: 69,897,010,670 (10)
abstracting: (1<=p39)
states: 36,707,340,800 (10)
-> the formula is FALSE
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.939sec
checking: AG [[[[[[p102<=0 | p12<=0] | [p20<=0 | p56<=0]] & [[p41<=0 | 1<=p177] | [p174<=0 | p10<=0]]] | [[[[[1<=p125 & 1<=p5] & 1<=p118] | [[[1<=p166 & 1<=p2] | [1<=p42 & 1<=p10]] & 1<=p7]] | 1<=p149] & p26<=0]] | 1<=p163]]
normalized: ~ [E [true U ~ [[1<=p163 | [[p26<=0 & [1<=p149 | [[1<=p7 & [[1<=p166 & 1<=p2] | [1<=p42 & 1<=p10]]] | [1<=p118 & [1<=p125 & 1<=p5]]]]] | [[[p174<=0 | p10<=0] | [p41<=0 | 1<=p177]] & [[p20<=0 | p56<=0] | [p102<=0 | p12<=0]]]]]]]]
abstracting: (p12<=0)
states: 77,129,184,708 (10)
abstracting: (p102<=0)
states: 139,408,659,088 (11)
abstracting: (p56<=0)
states: 98,959,449,019 (10)
abstracting: (p20<=0)
states: 66,297,426,018 (10)
abstracting: (1<=p177)
states: 1,344,809,592 (9)
abstracting: (p41<=0)
states: 109,727,525,508 (11)
abstracting: (p10<=0)
states: 72,193,024,858 (10)
abstracting: (p174<=0)
states: 139,179,255,276 (11)
abstracting: (1<=p5)
states: 66,935,717,244 (10)
abstracting: (1<=p125)
states: 3,281,180,490 (9)
abstracting: (1<=p118)
states: 1,583,022,600 (9)
abstracting: (1<=p10)
states: 69,897,010,670 (10)
abstracting: (1<=p42)
states: 34,794,086,300 (10)
abstracting: (1<=p2)
states: 63,579,575,160 (10)
abstracting: (1<=p166)
states: 2,910,780,252 (9)
abstracting: (1<=p7)
states: 476,795,600 (8)
abstracting: (1<=p149)
states: 1,227,686,472 (9)
abstracting: (p26<=0)
states: 110,300,247,948 (11)
abstracting: (1<=p163)
states: 2,770,232,292 (9)
-> the formula is FALSE
FORMULA HirschbergSinclair-PT-15-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.859sec
totally nodes used: 4391206 (4.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4254539 21380495 25635034
used/not used/entry size/cache size: 19932201 47176663 16 1024MB
basic ops cache: hits/miss/sum: 1312368 6811877 8124245
used/not used/entry size/cache size: 8408143 8369073 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: 175036 881390 1056426
used/not used/entry size/cache size: 838388 7550220 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 63603414
1 2806526
2 544778
3 126283
4 23617
5 3712
6 493
7 39
8 2
9 0
>= 10 0
Total processing time: 0m20.095sec
BK_STOP 1678790668009
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.003sec
iterations count:5176 (29), effective:295 (1)
initing FirstDep: 0m 0.001sec
iterations count:2037 (11), effective:140 (0)
iterations count:2574 (14), effective:184 (1)
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="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r202-smll-167840348700447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 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 ;