About the Execution of Marcie+red for JoinFreeModules-PT-0005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5550.403 | 8524.00 | 10097.00 | 276.50 | TTTFTTFFFTFTTFTF | 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.r234-tall-167856419900158.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 JoinFreeModules-PT-0005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 JoinFreeModules-PT-0005-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679452088155
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=JoinFreeModules-PT-0005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:28:09] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-22 02:28:09] [INFO ] Transformed 26 places.
[2023-03-22 02:28:09] [INFO ] Transformed 41 transitions.
[2023-03-22 02:28:09] [INFO ] Parsed PT model containing 26 places and 41 transitions and 117 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :7
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 25 cols
[2023-03-22 02:28:10] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 02:28:10] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:28:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-22 02:28:10] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:28:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 02:28:10] [INFO ] After 31ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 02:28:10] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 02:28:10] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 41/41 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 40
Applied a total of 1 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 25 cols
[2023-03-22 02:28:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 02:28:10] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 25/25 places, 40/41 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 3954 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=790 )
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 836 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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: JoinFreeModules_PT_0005
(NrP: 26 NrTr: 41 NrArc: 117)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.720sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 301 (3.0e+02) #states 11,592,740,743 (10)
starting MCC model checker
--------------------------
checking: EF [p3<=2]
normalized: E [true U p3<=2]
abstracting: (p3<=2)
states: 9,454,274,004 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [p15<=0]
normalized: ~ [E [true U ~ [p15<=0]]]
abstracting: (p15<=0)
states: 5,740,094,931 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [4<=p1]
normalized: ~ [E [true U ~ [4<=p1]]]
abstracting: (4<=p1)
states: 2,588,670,263 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [p24<=p3]
normalized: E [true U p24<=p3]
abstracting: (p24<=p3)
states: 6,215,431,176 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: AG [[p12<=0 & p17<=5]]
normalized: ~ [E [true U ~ [[p12<=0 & p17<=5]]]]
abstracting: (p17<=5)
states: 11,480,189,862 (10)
abstracting: (p12<=0)
states: 3,826,729,954 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [~ [p7<=p9]]
normalized: E [true U ~ [p7<=p9]]
abstracting: (p7<=p9)
states: 7,540,909,027 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AG [~ [[p15<=3 | ~ [[~ [p7<=5] & ~ [3<=p5]]]]]]
normalized: ~ [E [true U [~ [[~ [3<=p5] & ~ [p7<=5]]] | p15<=3]]]
abstracting: (p15<=3)
states: 9,454,274,004 (9)
abstracting: (p7<=5)
states: 11,480,189,862 (10)
abstracting: (3<=p5)
states: 2,138,466,739 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[p20<=p16 & p24<=p22]]
normalized: E [true U [p20<=p16 & p24<=p22]]
abstracting: (p24<=p22)
states: 6,190,298,455 (9)
abstracting: (p20<=p16)
states: 8,553,866,956 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[~ [[4<=p19 | [2<=p | 1<=p11]]] | p2<=0] | 3<=p10]]
normalized: E [true U [[~ [[[2<=p | 1<=p11] | 4<=p19]] | p2<=0] | 3<=p10]]
abstracting: (3<=p10)
states: 2,138,466,739 (9)
abstracting: (p2<=0)
states: 3,826,729,954 (9)
abstracting: (4<=p19)
states: 2,138,466,739 (9)
abstracting: (1<=p11)
states: 8,666,417,837 (9)
abstracting: (2<=p)
states: 0
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AG [~ [[[p3<=p & [~ [p23<=p20] & p11<=p22]] | ~ [5<=p23]]]]
normalized: ~ [E [true U [~ [5<=p23] | [p3<=p & [p11<=p22 & ~ [p23<=p20]]]]]]
abstracting: (p23<=p20)
states: 6,721,363,777 (9)
abstracting: (p11<=p22)
states: 5,623,173,142 (9)
abstracting: (p3<=p)
states: 7,428,358,146 (9)
abstracting: (5<=p23)
states: 337,652,643 (8)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[[[~ [p2<=4] & [~ [p11<=p2] | ~ [[p8<=4 | p3<=5]]]] & ~ [p2<=3]] & p16<=2]]
normalized: ~ [E [true U ~ [[p16<=2 & [~ [p2<=3] & [[~ [[p8<=4 | p3<=5]] | ~ [p11<=p2]] & ~ [p2<=4]]]]]]]
abstracting: (p2<=4)
states: 11,142,537,219 (10)
abstracting: (p11<=p2)
states: 5,623,173,142 (9)
abstracting: (p3<=5)
states: 11,592,740,743 (10)
abstracting: (p8<=4)
states: 11,255,088,100 (10)
abstracting: (p2<=3)
states: 10,467,231,933 (10)
abstracting: (p16<=2)
states: 7,090,705,503 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [~ [[5<=p14 | ~ [[p13<=2 & ~ [[p23<=p22 & [p20<=p19 & p22<=p19]]]]]]]]
normalized: E [true U ~ [[5<=p14 | ~ [[p13<=2 & ~ [[p23<=p22 & [p20<=p19 & p22<=p19]]]]]]]]
abstracting: (p22<=p19)
states: 7,629,419,914 (9)
abstracting: (p20<=p19)
states: 9,454,274,004 (9)
abstracting: (p23<=p22)
states: 7,090,705,503 (9)
abstracting: (p13<=2)
states: 9,454,274,004 (9)
abstracting: (5<=p14)
states: 1,012,957,929 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[[p1<=p8 & ~ [[~ [p18<=p7] | 1<=p20]]] & ~ [[p1<=3 | [[~ [[~ [[p18<=1 | p25<=2]] & ~ [1<=p24]]] & p16<=p13] & p11<=p]]]]]
normalized: E [true U [~ [[p1<=3 | [p11<=p & [p16<=p13 & ~ [[~ [1<=p24] & ~ [[p18<=1 | p25<=2]]]]]]]] & [p1<=p8 & ~ [[1<=p20 | ~ [p18<=p7]]]]]]
abstracting: (p18<=p7)
states: 7,457,861,775 (9)
abstracting: (1<=p20)
states: 5,852,645,812 (9)
abstracting: (p1<=p8)
states: 5,429,760,463 (9)
abstracting: (p25<=2)
states: 9,454,274,004 (9)
abstracting: (p18<=1)
states: 7,428,358,146 (9)
abstracting: (1<=p24)
states: 7,540,909,027 (9)
abstracting: (p16<=p13)
states: 5,429,760,463 (9)
abstracting: (p11<=p)
states: 4,839,687,883 (9)
abstracting: (p1<=3)
states: 9,004,070,480 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: EF [[~ [[~ [[4<=p4 | 4<=p7]] & [[~ [1<=p8] & ~ [[[[3<=p1 | p3<=1] & 5<=p18] & [[p11<=1 | p<=p18] & [p21<=0 | p14<=3]]]]] | [~ [3<=p17] | [[~ [2<=p19] & [p15<=p5 & [p18<=p25 & p18<=5]]] | ~ [[4<=p10 | ~ [p10<=p]]]]]]]] & [p18<=p23 & [2<=p24 | ~ [p5<=3]]]]]
normalized: E [true U [[p18<=p23 & [2<=p24 | ~ [p5<=3]]] & ~ [[[[[~ [[4<=p10 | ~ [p10<=p]]] | [[p15<=p5 & [p18<=p25 & p18<=5]] & ~ [2<=p19]]] | ~ [3<=p17]] | [~ [[[[p21<=0 | p14<=3] & [p11<=1 | p<=p18]] & [5<=p18 & [3<=p1 | p3<=1]]]] & ~ [1<=p8]]] & ~ [[4<=p4 | 4<=p7]]]]]]
abstracting: (4<=p7)
states: 1,125,508,810 (9)
abstracting: (4<=p4)
states: 2,138,466,739 (9)
abstracting: (1<=p8)
states: 7,428,358,146 (9)
abstracting: (p3<=1)
states: 7,428,358,146 (9)
abstracting: (3<=p1)
states: 4,502,035,240 (9)
abstracting: (5<=p18)
states: 337,652,643 (8)
abstracting: (p<=p18)
states: 7,428,358,146 (9)
abstracting: (p11<=1)
states: 4,839,687,883 (9)
abstracting: (p14<=3)
states: 9,454,274,004 (9)
abstracting: (p21<=0)
states: 2,926,322,906 (9)
abstracting: (3<=p17)
states: 2,363,568,501 (9)
abstracting: (2<=p19)
states: 5,627,544,050 (9)
abstracting: (p18<=5)
states: 11,592,740,743 (10)
abstracting: (p18<=p25)
states: 6,721,363,777 (9)
abstracting: (p15<=p5)
states: 7,678,592,629 (9)
abstracting: (p10<=p)
states: 8,553,866,956 (9)
abstracting: (4<=p10)
states: 2,138,466,739 (9)
abstracting: (p5<=3)
states: 9,454,274,004 (9)
abstracting: (2<=p24)
states: 5,627,544,050 (9)
abstracting: (p18<=p23)
states: 7,265,541,823 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.102sec
checking: AG [[~ [[[~ [4<=p21] | [4<=p25 | [1<=p15 | [p7<=0 | [p17<=p21 & p9<=p17]]]]] & [~ [[~ [4<=p11] | [~ [p18<=5] | ~ [p1<=1]]]] | p1<=p22]]] | [p2<=p15 | [[[[5<=p6 | ~ [5<=p13]] & ~ [1<=p22]] & [~ [[p19<=p17 & [[1<=p20 & p23<=3] | [p10<=p8 | p2<=p3]]]] & p4<=p7]] & [~ [[p20<=p16 & [2<=p18 | p15<=5]]] & ~ [p7<=0]]]]]]
normalized: ~ [E [true U ~ [[~ [[[p1<=p22 | ~ [[[~ [p1<=1] | ~ [p18<=5]] | ~ [4<=p11]]]] & [[4<=p25 | [1<=p15 | [p7<=0 | [p17<=p21 & p9<=p17]]]] | ~ [4<=p21]]]] | [p2<=p15 | [[[p4<=p7 & ~ [[p19<=p17 & [[p10<=p8 | p2<=p3] | [1<=p20 & p23<=3]]]]] & [~ [1<=p22] & [5<=p6 | ~ [5<=p13]]]] & [~ [p7<=0] & ~ [[p20<=p16 & [2<=p18 | p15<=5]]]]]]]]]]
abstracting: (p15<=5)
states: 11,255,088,100 (10)
abstracting: (2<=p18)
states: 4,164,382,597 (9)
abstracting: (p20<=p16)
states: 8,553,866,956 (9)
abstracting: (p7<=0)
states: 3,826,729,954 (9)
abstracting: (5<=p13)
states: 337,652,643 (8)
abstracting: (5<=p6)
states: 1,350,610,572 (9)
abstracting: (1<=p22)
states: 7,766,010,789 (9)
abstracting: (p23<=3)
states: 10,692,333,695 (10)
abstracting: (1<=p20)
states: 5,852,645,812 (9)
abstracting: (p2<=p3)
states: 6,753,052,860 (9)
abstracting: (p10<=p8)
states: 7,428,358,146 (9)
abstracting: (p19<=p17)
states: 6,190,298,455 (9)
abstracting: (p4<=p7)
states: 6,380,432,953 (9)
abstracting: (p2<=p15)
states: 6,437,254,757 (9)
abstracting: (4<=p21)
states: 2,588,670,263 (9)
abstracting: (p9<=p17)
states: 6,380,432,953 (9)
abstracting: (p17<=p21)
states: 8,189,988,865 (9)
abstracting: (p7<=0)
states: 3,826,729,954 (9)
abstracting: (1<=p15)
states: 5,852,645,812 (9)
abstracting: (4<=p25)
states: 2,138,466,739 (9)
abstracting: (4<=p11)
states: 2,588,670,263 (9)
abstracting: (p18<=5)
states: 11,592,740,743 (10)
abstracting: (p1<=1)
states: 4,839,687,883 (9)
abstracting: (p1<=p22)
states: 5,623,173,142 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.264sec
checking: EF [[[p3<=3 & [[~ [[3<=p24 & p1<=0]] & p24<=p6] & [~ [[[~ [[p2<=p11 | p15<=3]] & [~ [2<=p25] & [p14<=5 | p1<=0]]] & 1<=p23]] & [p21<=p14 | [5<=p14 | ~ [p20<=p14]]]]]] | [p9<=p11 & [[p23<=p12 | ~ [p2<=0]] & [[[[~ [[1<=p & p5<=4]] | [[p9<=5 | p5<=p11] & 2<=p7]] | p3<=0] | [[[~ [4<=p7] | p7<=2] | ~ [[p17<=p20 | p13<=p10]]] | [[[2<=p1 | p8<=p2] & [p6<=p9 & p16<=3]] & [[p12<=3 & 2<=p23] & [p13<=2 | p9<=4]]]]] | [[[~ [[3<=p12 | p5<=5]] & ~ [[p23<=1 & p10<=1]]] & ~ [[[p17<=p1 & 3<=p1] | [p2<=2 | 2<=p1]]]] & [4<=p9 & ~ [p1<=p23]]]]]]]]
normalized: E [true U [[p9<=p11 & [[[[~ [[[p2<=2 | 2<=p1] | [p17<=p1 & 3<=p1]]] & [~ [[p23<=1 & p10<=1]] & ~ [[3<=p12 | p5<=5]]]] & [4<=p9 & ~ [p1<=p23]]] | [[[[[p13<=2 | p9<=4] & [p12<=3 & 2<=p23]] & [[p6<=p9 & p16<=3] & [2<=p1 | p8<=p2]]] | [~ [[p17<=p20 | p13<=p10]] | [p7<=2 | ~ [4<=p7]]]] | [p3<=0 | [[2<=p7 & [p9<=5 | p5<=p11]] | ~ [[1<=p & p5<=4]]]]]] & [p23<=p12 | ~ [p2<=0]]]] | [p3<=3 & [[[p21<=p14 | [5<=p14 | ~ [p20<=p14]]] & ~ [[1<=p23 & [[[p14<=5 | p1<=0] & ~ [2<=p25]] & ~ [[p2<=p11 | p15<=3]]]]]] & [p24<=p6 & ~ [[3<=p24 & p1<=0]]]]]]]
abstracting: (p1<=0)
states: 2,926,322,906 (9)
abstracting: (3<=p24)
states: 4,502,035,240 (9)
abstracting: (p24<=p6)
states: 7,381,370,885 (9)
abstracting: (p15<=3)
states: 9,454,274,004 (9)
abstracting: (p2<=p11)
states: 8,189,988,865 (9)
abstracting: (2<=p25)
states: 3,038,873,787 (9)
abstracting: (p1<=0)
states: 2,926,322,906 (9)
abstracting: (p14<=5)
states: 10,917,435,457 (10)
abstracting: (1<=p23)
states: 7,428,358,146 (9)
abstracting: (p20<=p14)
states: 8,239,161,580 (9)
abstracting: (5<=p14)
states: 1,012,957,929 (9)
abstracting: (p21<=p14)
states: 6,322,518,422 (9)
abstracting: (p3<=3)
states: 10,692,333,695 (10)
abstracting: (p2<=0)
states: 3,826,729,954 (9)
abstracting: (p23<=p12)
states: 7,457,861,775 (9)
abstracting: (p5<=4)
states: 10,017,028,409 (10)
abstracting: (1<=p)
states: 11,592,740,743 (10)
abstracting: (p5<=p11)
states: 8,657,676,021 (9)
abstracting: (p9<=5)
states: 10,917,435,457 (10)
abstracting: (2<=p7)
states: 4,502,035,240 (9)
abstracting: (p3<=0)
states: 4,164,382,597 (9)
abstracting: (4<=p7)
states: 1,125,508,810 (9)
abstracting: (p7<=2)
states: 9,229,172,242 (9)
abstracting: (p13<=p10)
states: 6,721,363,777 (9)
abstracting: (p17<=p20)
states: 6,190,298,455 (9)
abstracting: (p8<=p2)
states: 7,457,861,775 (9)
abstracting: (2<=p1)
states: 6,753,052,860 (9)
abstracting: (p16<=3)
states: 9,004,070,480 (9)
abstracting: (p6<=p9)
states: 5,852,645,812 (9)
abstracting: (2<=p23)
states: 4,164,382,597 (9)
abstracting: (p12<=3)
states: 10,467,231,933 (10)
abstracting: (p9<=4)
states: 10,579,782,814 (10)
abstracting: (p13<=2)
states: 9,454,274,004 (9)
abstracting: (p1<=p23)
states: 5,429,760,463 (9)
abstracting: (4<=p9)
states: 2,138,466,739 (9)
abstracting: (p5<=5)
states: 11,255,088,100 (10)
abstracting: (3<=p12)
states: 2,363,568,501 (9)
abstracting: (p10<=1)
states: 8,553,866,956 (9)
abstracting: (p23<=1)
states: 7,428,358,146 (9)
abstracting: (3<=p1)
states: 4,502,035,240 (9)
abstracting: (p17<=p1)
states: 8,189,988,865 (9)
abstracting: (2<=p1)
states: 6,753,052,860 (9)
abstracting: (p2<=2)
states: 9,229,172,242 (9)
abstracting: (p9<=p11)
states: 7,381,370,885 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.308sec
totally nodes used: 1012095 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1751234 1084249 2835483
used/not used/entry size/cache size: 1847211 65261653 16 1024MB
basic ops cache: hits/miss/sum: 1423046 865820 2288866
used/not used/entry size/cache size: 1815654 14961562 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: 43723 24045 67768
used/not used/entry size/cache size: 24020 8364588 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 66166333
1 905090
2 28597
3 4020
4 1883
5 763
6 569
7 291
8 231
9 121
>= 10 966
Total processing time: 0m 5.245sec
BK_STOP 1679452096679
--------------------
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
p
found 1 constant places
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:436 (10), effective:100 (2)
initing FirstDep: 0m 0.000sec
iterations count:44 (1), effective:3 (0)
iterations count:60 (1), effective:6 (0)
iterations count:58 (1), effective:7 (0)
iterations count:257 (6), effective:52 (1)
iterations count:67 (1), effective:7 (0)
iterations count:79 (1), effective:13 (0)
iterations count:69 (1), effective:14 (0)
iterations count:130 (3), effective:15 (0)
iterations count:101 (2), effective:24 (0)
iterations count:107 (2), effective:23 (0)
iterations count:44 (1), effective:2 (0)
iterations count:92 (2), effective:20 (0)
iterations count:305 (7), effective:94 (2)
iterations count:374 (9), effective:114 (2)
iterations count:390 (9), effective:122 (2)
iterations count:259 (6), effective:71 (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="JoinFreeModules-PT-0005"
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 JoinFreeModules-PT-0005, 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 r234-tall-167856419900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 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 ;