About the Execution of Marcie+red for Szymanski-PT-a12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7928.968 | 157795.00 | 150678.00 | 7997.50 | TTTTFTFTFFFTFTFF | 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.r490-tall-167912708700446.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 Szymanski-PT-a12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708700446
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a12-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-a12-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679255516341
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=Szymanski-PT-a12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:51:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:51:58] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-19 19:51:58] [INFO ] Transformed 61 places.
[2023-03-19 19:51:58] [INFO ] Transformed 224 transitions.
[2023-03-19 19:51:58] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :9
FORMULA Szymanski-PT-a12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 19:51:58] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:51:58] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 19:51:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:51:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:51:58] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 19:51:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:51:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:51:58] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 19:51:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:51:58] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 19:51:58] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 4 ms to minimize.
[2023-03-19 19:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-19 19:51:59] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 19:51:59] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA Szymanski-PT-a12-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 42 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 42 transition count 192
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 42 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 40 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 40 transition count 168
Applied a total of 35 rules in 38 ms. Remains 40 /49 variables (removed 9) and now considering 168/216 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 40/49 places, 168/216 transitions.
Finished random walk after 823 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=411 )
FORMULA Szymanski-PT-a12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 939 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: Szymanski_PT_a12
(NrP: 61 NrTr: 224 NrArc: 900)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.631sec
RS generation: 0m18.985sec
-> reachability set: #nodes 14409 (1.4e+04) #states 12,685,347,615,351,684 (16)
starting MCC model checker
--------------------------
checking: AG [l21<=6]
normalized: ~ [E [true U ~ [l21<=6]]]
abstracting: (l21<=6)
states: 12,685,347,615,351,684 (16)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AG [l2<=6]
normalized: ~ [E [true U ~ [l2<=6]]]
abstracting: (l2<=6)
states: 12,685,344,528,671,026 (16)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.304sec
checking: AG [~ [3<=l10]]
normalized: ~ [E [true U 3<=l10]]
abstracting: (3<=l10)
states: 703,315,617,609,618 (14)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.749sec
checking: AG [~ [10<=l33]]
normalized: ~ [E [true U 10<=l33]]
abstracting: (10<=l33)
states: 17,166,227,445 (10)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.579sec
checking: AG [p14<=s1]
normalized: ~ [E [true U ~ [p14<=s1]]]
abstracting: (p14<=s1)
states: 12,685,347,615,351,684 (16)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: AG [s3<=s3]
normalized: ~ [E [true U ~ [s3<=s3]]]
abstracting: (s3<=s3)
states: 12,685,347,615,351,684 (16)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[4<=s4 | l38<=11]]
normalized: ~ [E [true U ~ [[4<=s4 | l38<=11]]]]
abstracting: (l38<=11)
states: 12,685,347,541,470,279 (16)
abstracting: (4<=s4)
states: 0
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.353sec
checking: EF [[~ [7<=l24] & 9<=l11]]
normalized: E [true U [9<=l11 & ~ [7<=l24]]]
abstracting: (7<=l24)
states: 3,760,872,578,988 (12)
abstracting: (9<=l11)
states: 189,509,367,575 (11)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.838sec
checking: AG [[[s1<=5 & [[~ [l16<=11] & ~ [[~ [[l3<=8 & 10<=l39]] | ~ [[l42<=8 & 4<=s9]]]]] | l7<=0]] | l25<=7]]
normalized: ~ [E [true U ~ [[l25<=7 | [s1<=5 & [l7<=0 | [~ [l16<=11] & ~ [[~ [[l42<=8 & 4<=s9]] | ~ [[l3<=8 & 10<=l39]]]]]]]]]]]
abstracting: (10<=l39)
states: 17,166,227,445 (10)
abstracting: (l3<=8)
states: 12,685,347,609,924,757 (16)
abstracting: (4<=s9)
states: 0
abstracting: (l42<=8)
states: 12,685,347,615,351,684 (16)
abstracting: (l16<=11)
states: 12,685,347,490,085,635 (16)
abstracting: (l7<=0)
states: 7,561,027,097,281,255 (15)
abstracting: (s1<=5)
states: 12,685,347,615,351,684 (16)
abstracting: (l25<=7)
states: 12,684,578,937,628,022 (16)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.113sec
checking: EF [[l25<=p14 & ~ [[[l40<=s2 | s6<=11] | [~ [[~ [p11<=10] & s6<=l15]] & 8<=l17]]]]]
normalized: E [true U [l25<=p14 & ~ [[[8<=l17 & ~ [[s6<=l15 & ~ [p11<=10]]]] | [l40<=s2 | s6<=11]]]]]
abstracting: (s6<=11)
states: 12,685,347,615,351,684 (16)
abstracting: (l40<=s2)
states: 8,563,295,292,210,178 (15)
abstracting: (p11<=10)
states: 12,685,347,615,351,684 (16)
abstracting: (s6<=l15)
states: 12,355,260,154,556,800 (16)
abstracting: (8<=l17)
states: 1,066,241,685,660 (12)
abstracting: (l25<=p14)
states: 7,743,600,648,864,015 (15)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.136sec
checking: EF [[[~ [[[~ [[~ [[p14<=0 & 10<=l34]] & ~ [[l31<=s8 | 10<=s7]]]] | p15<=9] & l37<=8]] & l20<=l25] | [[l2<=p14 & ~ [l22<=8]] & [~ [[l39<=l37 | 7<=l24]] & ~ [s6<=1]]]]]
normalized: E [true U [[[~ [s6<=1] & ~ [[l39<=l37 | 7<=l24]]] & [l2<=p14 & ~ [l22<=8]]] | [l20<=l25 & ~ [[l37<=8 & [p15<=9 | ~ [[~ [[l31<=s8 | 10<=s7]] & ~ [[p14<=0 & 10<=l34]]]]]]]]]]
abstracting: (10<=l34)
states: 17,166,227,445 (10)
abstracting: (p14<=0)
states: 12,685,347,615,351,684 (16)
abstracting: (10<=s7)
states: 0
abstracting: (l31<=s8)
states: 7,743,600,648,864,015 (15)
abstracting: (p15<=9)
states: 12,685,347,615,351,684 (16)
abstracting: (l37<=8)
states: 12,685,217,353,519,869 (16)
abstracting: (l20<=l25)
states: 9,003,878,132,505,477 (15)
abstracting: (l22<=8)
states: 12,685,347,615,351,684 (16)
abstracting: (l2<=p14)
states: 9,777,677,999,234,041 (15)
abstracting: (7<=l24)
states: 3,760,872,578,988 (12)
abstracting: (l39<=l37)
states: 9,089,727,416,000,164 (15)
abstracting: (s6<=1)
states: 12,685,347,615,351,684 (16)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.498sec
checking: EF [[[[[[[[5<=l19 & 12<=l34] & [5<=l11 | [[l17<=6 | l0<=1] | l43<=8]]] | ~ [[~ [l27<=l43] | l22<=10]]] | ~ [[~ [9<=l42] & ~ [[[l24<=s9 | 5<=l40] | [p15<=l4 & 10<=l42]]]]]] & 9<=l13] & ~ [4<=l8]] & ~ [3<=l7]]]
normalized: E [true U [~ [3<=l7] & [~ [4<=l8] & [9<=l13 & [[[[5<=l11 | [l43<=8 | [l17<=6 | l0<=1]]] & [5<=l19 & 12<=l34]] | ~ [[l22<=10 | ~ [l27<=l43]]]] | ~ [[~ [[[p15<=l4 & 10<=l42] | [l24<=s9 | 5<=l40]]] & ~ [9<=l42]]]]]]]]
abstracting: (9<=l42)
states: 0
abstracting: (5<=l40)
states: 59,506,384,576,338 (13)
abstracting: (l24<=s9)
states: 7,743,600,648,864,015 (15)
abstracting: (10<=l42)
states: 0
abstracting: (p15<=l4)
states: 12,685,347,615,351,684 (16)
abstracting: (l27<=l43)
states: 8,400,907,188,672,427 (15)
abstracting: (l22<=10)
states: 12,685,347,615,351,684 (16)
abstracting: (12<=l34)
states: 73,881,405 (7)
abstracting: (5<=l19)
states: 72,240,167,974,438 (13)
abstracting: (l0<=1)
states: 12,400,824,482,362,615 (16)
abstracting: (l17<=6)
states: 12,680,365,466,782,153 (16)
abstracting: (l43<=8)
states: 12,685,347,615,351,684 (16)
abstracting: (5<=l11)
states: 72,240,167,974,438 (13)
abstracting: (9<=l13)
states: 189,509,367,575 (11)
abstracting: (4<=l8)
states: 235,009,450,468,353 (14)
abstracting: (3<=l7)
states: 703,315,617,609,618 (14)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.799sec
checking: EF [[[~ [l37<=l4] & [~ [[[l22<=1 | ~ [[p10<=1 & p10<=s1]]] | ~ [[[l18<=0 & [l33<=2 & 10<=l31]] | [[s9<=s5 & l32<=l25] | [l35<=l33 | s1<=3]]]]]] | ~ [p13<=l4]]] | ~ [l42<=0]]]
normalized: E [true U [~ [l42<=0] | [[~ [p13<=l4] | ~ [[~ [[[[l35<=l33 | s1<=3] | [s9<=s5 & l32<=l25]] | [l18<=0 & [l33<=2 & 10<=l31]]]] | [l22<=1 | ~ [[p10<=1 & p10<=s1]]]]]] & ~ [l37<=l4]]]]
abstracting: (l37<=l4)
states: 9,459,040,795,260,745 (15)
abstracting: (p10<=s1)
states: 12,685,347,615,351,684 (16)
abstracting: (p10<=1)
states: 12,685,347,615,351,684 (16)
abstracting: (l22<=1)
states: 12,685,347,615,351,684 (16)
abstracting: (10<=l31)
states: 17,166,227,445 (10)
abstracting: (l33<=2)
states: 12,056,840,033,990,427 (16)
abstracting: (l18<=0)
states: 7,561,027,097,281,255 (15)
abstracting: (l32<=l25)
states: 9,089,727,416,000,164 (15)
abstracting: (s9<=s5)
states: 12,685,347,615,351,684 (16)
abstracting: (s1<=3)
states: 12,685,347,615,351,684 (16)
abstracting: (l35<=l33)
states: 9,089,727,416,000,164 (15)
abstracting: (p13<=l4)
states: 12,685,347,615,351,684 (16)
abstracting: (l42<=0)
states: 12,685,347,615,351,684 (16)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.266sec
checking: AG [[[p11<=4 | [[~ [l22<=s9] & [~ [[[[2<=s4 | l14<=l34] & 11<=l40] & l3<=7]] | 7<=l13]] & [2<=l1 & [l30<=l6 | ~ [l0<=7]]]]] | [[[l26<=6 & [11<=l6 & ~ [[[l13<=l39 & [l25<=s8 | 9<=l31]] & ~ [4<=l26]]]]] | s0<=7] & ~ [l23<=l35]]]]
normalized: ~ [E [true U ~ [[[~ [l23<=l35] & [s0<=7 | [l26<=6 & [11<=l6 & ~ [[~ [4<=l26] & [l13<=l39 & [l25<=s8 | 9<=l31]]]]]]]] | [p11<=4 | [[2<=l1 & [l30<=l6 | ~ [l0<=7]]] & [[7<=l13 | ~ [[l3<=7 & [11<=l40 & [2<=s4 | l14<=l34]]]]] & ~ [l22<=s9]]]]]]]]
abstracting: (l22<=s9)
states: 12,685,347,615,351,684 (16)
abstracting: (l14<=l34)
states: 9,003,878,132,505,477 (15)
abstracting: (2<=s4)
states: 0
abstracting: (11<=l40)
states: 1,564,064,515 (9)
abstracting: (l3<=7)
states: 12,685,347,458,308,705 (16)
abstracting: (7<=l13)
states: 4,982,148,569,531 (12)
abstracting: (l0<=7)
states: 12,685,347,527,928,582 (16)
abstracting: (l30<=l6)
states: 9,219,132,296,588,617 (15)
abstracting: (2<=l1)
states: 421,736,725,994,363 (14)
abstracting: (p11<=4)
states: 12,685,347,615,351,684 (16)
abstracting: (9<=l31)
states: 130,261,831,815 (11)
abstracting: (l25<=s8)
states: 7,743,600,648,864,015 (15)
abstracting: (l13<=l39)
states: 9,003,878,132,505,477 (15)
abstracting: (4<=l26)
states: 201,771,349,658,853 (14)
abstracting: (11<=l6)
states: 2,515,802,422 (9)
abstracting: (l26<=6)
states: 12,681,586,742,772,696 (16)
abstracting: (s0<=7)
states: 12,685,347,615,351,684 (16)
abstracting: (l23<=l35)
states: 9,089,727,721,002,276 (15)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.464sec
checking: AG [[~ [[[~ [[[[~ [s7<=l5] & s0<=l27] & ~ [l28<=0]] & ~ [[[6<=l4 & l32<=11] | ~ [l2<=p10]]]]] | [[10<=l37 & [[[s9<=1 | l17<=1] & ~ [l21<=12]] | 7<=s0]] & [[[l7<=12 | ~ [l10<=s9]] | l32<=l20] | [[[7<=s9 & l39<=0] & l0<=0] & l1<=l26]]]] & [p16<=p14 & 9<=l37]]] & l37<=l30]]
normalized: ~ [E [true U ~ [[l37<=l30 & ~ [[[p16<=p14 & 9<=l37] & [[[[l1<=l26 & [l0<=0 & [7<=s9 & l39<=0]]] | [l32<=l20 | [l7<=12 | ~ [l10<=s9]]]] & [10<=l37 & [7<=s0 | [~ [l21<=12] & [s9<=1 | l17<=1]]]]] | ~ [[~ [[~ [l2<=p10] | [6<=l4 & l32<=11]]] & [~ [l28<=0] & [s0<=l27 & ~ [s7<=l5]]]]]]]]]]]]
abstracting: (s7<=l5)
states: 12,591,033,879,167,770 (16)
abstracting: (s0<=l27)
states: 12,061,381,017,707,098 (16)
abstracting: (l28<=0)
states: 7,743,600,648,864,015 (15)
abstracting: (l32<=11)
states: 12,685,347,541,470,279 (16)
abstracting: (6<=l4)
states: 24,507,824,456,733 (13)
abstracting: (l2<=p10)
states: 9,777,677,999,234,041 (15)
abstracting: (l17<=1)
states: 10,726,499,804,746,401 (16)
abstracting: (s9<=1)
states: 12,685,347,615,351,684 (16)
abstracting: (l21<=12)
states: 12,685,347,615,351,684 (16)
abstracting: (7<=s0)
states: 0
abstracting: (10<=l37)
states: 17,166,227,445 (10)
abstracting: (l10<=s9)
states: 7,561,027,097,281,255 (15)
abstracting: (l7<=12)
states: 12,685,347,615,351,684 (16)
abstracting: (l32<=l20)
states: 9,219,132,296,588,617 (15)
abstracting: (l39<=0)
states: 7,743,600,648,864,015 (15)
abstracting: (7<=s9)
states: 0
abstracting: (l0<=0)
states: 10,683,180,338,835,615 (16)
abstracting: (l1<=l26)
states: 10,759,130,073,613,334 (16)
abstracting: (9<=l37)
states: 130,261,831,815 (11)
abstracting: (p16<=p14)
states: 10,009,362,343,607,627 (16)
abstracting: (l37<=l30)
states: 9,089,727,416,000,164 (15)
-> the formula is FALSE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.837sec
checking: EF [[~ [[~ [12<=p14] & l39<=0]] & [[[[[~ [s8<=8] & ~ [1<=l31]] | l37<=3] | [2<=p10 | l8<=l39]] & [[~ [[[l29<=l23 | l31<=l28] | [l35<=6 | l29<=l33]]] | ~ [[[10<=p11 & [p16<=l43 & s6<=3]] | [~ [4<=s8] & ~ [9<=l25]]]]] & [~ [[~ [p10<=s4] & [s9<=l25 & ~ [12<=s2]]]] | ~ [[[l3<=l38 | l2<=0] | [p15<=2 | l36<=s6]]]]]] & l19<=l16]]]
normalized: E [true U [[l19<=l16 & [[[~ [[[p15<=2 | l36<=s6] | [l3<=l38 | l2<=0]]] | ~ [[[s9<=l25 & ~ [12<=s2]] & ~ [p10<=s4]]]] & [~ [[[~ [9<=l25] & ~ [4<=s8]] | [10<=p11 & [p16<=l43 & s6<=3]]]] | ~ [[[l35<=6 | l29<=l33] | [l29<=l23 | l31<=l28]]]]] & [[2<=p10 | l8<=l39] | [l37<=3 | [~ [1<=l31] & ~ [s8<=8]]]]]] & ~ [[l39<=0 & ~ [12<=p14]]]]]
abstracting: (12<=p14)
states: 0
abstracting: (l39<=0)
states: 7,743,600,648,864,015 (15)
abstracting: (s8<=8)
states: 12,685,347,615,351,684 (16)
abstracting: (1<=l31)
states: 4,941,746,966,487,669 (15)
abstracting: (l37<=3)
states: 12,483,576,265,692,831 (16)
abstracting: (l8<=l39)
states: 9,003,878,132,505,477 (15)
abstracting: (2<=p10)
states: 0
abstracting: (l31<=l28)
states: 9,089,727,416,000,164 (15)
abstracting: (l29<=l23)
states: 9,089,727,416,000,164 (15)
abstracting: (l29<=l33)
states: 9,089,727,416,000,164 (15)
abstracting: (l35<=6)
states: 12,681,586,742,772,696 (16)
abstracting: (s6<=3)
states: 12,685,347,615,351,684 (16)
abstracting: (p16<=l43)
states: 12,685,347,615,351,684 (16)
abstracting: (10<=p11)
states: 0
abstracting: (4<=s8)
states: 0
abstracting: (9<=l25)
states: 130,261,831,815 (11)
abstracting: (p10<=s4)
states: 12,685,347,615,351,684 (16)
abstracting: (12<=s2)
states: 0
abstracting: (s9<=l25)
states: 12,685,347,615,351,684 (16)
abstracting: (l2<=0)
states: 9,777,677,999,234,041 (15)
abstracting: (l3<=l38)
states: 10,571,454,777,027,816 (16)
abstracting: (l36<=s6)
states: 7,875,627,176,571,544 (15)
abstracting: (p15<=2)
states: 12,685,347,615,351,684 (16)
abstracting: (l19<=l16)
states: 8,995,372,944,117,007 (15)
-> the formula is TRUE
FORMULA Szymanski-PT-a12-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m36.334sec
totally nodes used: 16418738 (1.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1236101485 281892379 1517993864
used/not used/entry size/cache size: 65548685 1560179 16 1024MB
basic ops cache: hits/miss/sum: 81901751 16986137 98887888
used/not used/entry size/cache size: 13606769 3170447 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: 2262071 495642 2757713
used/not used/entry size/cache size: 482686 7905922 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 53223148
1 12153346
2 1495195
3 163564
4 29497
5 10525
6 6273
7 4397
8 3078
9 2280
>= 10 17561
Total processing time: 2m22.872sec
BK_STOP 1679255674136
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
l41
l42
p14
p15
p11
p13
p12
s8
p10
s9
l21
l22
The net has transition(s) that can never fire:
t28
t53
t215
t136
t161
t190
t82
t107
check for constant places
s8
s9
p10
p11
p12
p13
p14
p15
found 8 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
11174 11410 23044 22003 18498 17659
iterations count:692301 (3090), effective:19373 (86)
initing FirstDep: 0m 0.000sec
iterations count:1107 (4), effective:30 (0)
iterations count:10118 (45), effective:313 (1)
23526 22272 21214 14497
iterations count:417615 (1864), effective:6051 (27)
11440 12151
iterations count:290399 (1296), effective:3160 (14)
iterations count:69762 (311), effective:2241 (10)
18806 14663
iterations count:233160 (1040), effective:3115 (13)
19942 13357
iterations count:237508 (1060), effective:2725 (12)
iterations count:58217 (259), effective:2385 (10)
iterations count:41598 (185), effective:520 (2)
15544 37903 44760 50050 17755
iterations count:578166 (2581), effective:7448 (33)
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="Szymanski-PT-a12"
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 Szymanski-PT-a12, 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 r490-tall-167912708700446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a12.tgz
mv Szymanski-PT-a12 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 ;