Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247400462.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 PGCD-PT-D03N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.4K Mar 31 16:48 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 PGCD-PT-D03N050-ReachabilityCardinality-00
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-01
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-02
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-03
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-04
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-05
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-06
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-07
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-08
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-09
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-10
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-11
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-12
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-13
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-14
FORMULA_NAME PGCD-PT-D03N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680818565596

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=PGCD-PT-D03N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:02:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 22:02:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:02:47] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-06 22:02:47] [INFO ] Transformed 12 places.
[2023-04-06 22:02:47] [INFO ] Transformed 12 transitions.
[2023-04-06 22:02:47] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10028 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 16) seen :9
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :2
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-04-06 22:02:47] [INFO ] Computed 5 invariants in 5 ms
[2023-04-06 22:02:47] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:02:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-04-06 22:02:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-04-06 22:02:47] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-06 22:02:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 22:02:47] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-06 22:02:47] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-06 22:02:47] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 10 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 22:02:47] [INFO ] Invariant cache hit.
[2023-04-06 22:02:47] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 12/12 places, 12/12 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 543232 steps, run visited all 1 properties in 648 ms. (steps per millisecond=838 )
Probabilistic random walk after 543232 steps, saw 306134 distinct states, run finished after 649 ms. (steps per millisecond=837 ) properties seen :1
FORMULA PGCD-PT-D03N050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1479 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: PGCD_PT_D03N050
(NrP: 12 NrTr: 12 NrArc: 56)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.768sec


RS generation: 0m10.086sec


-> reachability set: #nodes 34961 (3.5e+04) #states 417,214,571,243 (11)



starting MCC model checker
--------------------------

checking: AG [~ [15<=p0_4]]
normalized: ~ [E [true U 15<=p0_4]]

abstracting: (15<=p0_4)
states: 247,156,738,752 (11)
-> the formula is FALSE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.721sec

checking: AG [p2_2<=26]
normalized: ~ [E [true U ~ [p2_2<=26]]]

abstracting: (p2_2<=26)
states: 259,538,648,267 (11)
-> the formula is FALSE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.776sec

checking: EF [21<=p0_1]
normalized: E [true U 21<=p0_1]

abstracting: (21<=p0_1)
states: 198,123,466,112 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.167sec

checking: EF [21<=p0_1]
normalized: E [true U 21<=p0_1]

abstracting: (21<=p0_1)
states: 198,123,466,112 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [12<=p1_3]]
normalized: E [true U ~ [12<=p1_3]]

abstracting: (12<=p1_3)
states: 275,193,004,752 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.422sec

checking: EF [[p2_4<=14 & ~ [29<=p1_4]]]
normalized: E [true U [p2_4<=14 & ~ [29<=p1_4]]]

abstracting: (29<=p1_4)
states: 145,872,790,332 (11)
abstracting: (p2_4<=14)
states: 170,057,832,491 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.850sec

checking: EF [[p1_2<=p0_2 & p0_2<=32]]
normalized: E [true U [p1_2<=p0_2 & p0_2<=32]]

abstracting: (p0_2<=32)
states: 292,691,645,243 (11)
abstracting: (p1_2<=p0_2)
states: 208,607,747,840 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.950sec

checking: EF [~ [[[p2_1<=p0_2 & [~ [[~ [p2_2<=p0_4] & ~ [[4<=p0_1 | 7<=p2_3]]]] & ~ [[[[p0_2<=10 & p0_1<=p0_2] | [24<=p2_4 | 36<=p0_4]] | [~ [p0_2<=49] | p0_2<=p0_1]]]]] | ~ [38<=p0_2]]]]
normalized: E [true U ~ [[~ [38<=p0_2] | [p2_1<=p0_2 & [~ [[[p0_2<=p0_1 | ~ [p0_2<=49]] | [[24<=p2_4 | 36<=p0_4] | [p0_2<=10 & p0_1<=p0_2]]]] & ~ [[~ [[4<=p0_1 | 7<=p2_3]] & ~ [p2_2<=p0_4]]]]]]]]

abstracting: (p2_2<=p0_4)
states: 212,117,713,603 (11)
abstracting: (7<=p2_3)
states: 328,454,751,240 (11)
abstracting: (4<=p0_1)
states: 364,171,579,200 (11)
abstracting: (p0_1<=p0_2)
states: 212,117,713,603 (11)
abstracting: (p0_2<=10)
states: 131,882,040,683 (11)
abstracting: (36<=p0_4)
states: 110,244,297,152 (11)
abstracting: (24<=p2_4)
states: 176,801,355,120 (11)
abstracting: (p0_2<=49)
states: 356,386,462,187 (11)
abstracting: (p0_2<=p0_1)
states: 212,117,713,603 (11)
abstracting: (p2_1<=p0_2)
states: 212,117,713,603 (11)
abstracting: (38<=p0_2)
states: 101,573,397,376 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.047sec

checking: EF [[11<=p2_2 & [[[~ [[[7<=p2_2 & p2_2<=29] & [[[p2_1<=p1_1 & 21<=p2_1] | ~ [p0_2<=p0_4]] | 39<=p0_2]]] | [[p2_3<=p0_2 & [[p1_2<=17 & [8<=p1_4 | p1_1<=p1_3]] & 35<=p1_3]] | [15<=p2_1 | ~ [[31<=p2_2 | p2_4<=p0_1]]]]] & ~ [p0_3<=p2_3]] & 39<=p1_2]]]
normalized: E [true U [11<=p2_2 & [39<=p1_2 & [~ [p0_3<=p2_3] & [[[p2_3<=p0_2 & [35<=p1_3 & [p1_2<=17 & [8<=p1_4 | p1_1<=p1_3]]]] | [15<=p2_1 | ~ [[31<=p2_2 | p2_4<=p0_1]]]] | ~ [[[39<=p0_2 | [~ [p0_2<=p0_4] | [p2_1<=p1_1 & 21<=p2_1]]] & [7<=p2_2 & p2_2<=29]]]]]]]]

abstracting: (p2_2<=29)
states: 277,045,705,835 (11)
abstracting: (7<=p2_2)
states: 328,454,751,240 (11)
abstracting: (21<=p2_1)
states: 198,123,466,112 (11)
abstracting: (p2_1<=p1_1)
states: 208,606,823,403 (11)
abstracting: (p0_2<=p0_4)
states: 212,117,713,603 (11)
abstracting: (39<=p0_2)
states: 97,533,546,344 (10)
abstracting: (p2_4<=p0_1)
states: 212,117,713,603 (11)
abstracting: (31<=p2_2)
states: 134,836,354,224 (11)
abstracting: (15<=p2_1)
states: 247,156,738,752 (11)
abstracting: (p1_1<=p1_3)
states: 212,117,995,275 (11)
abstracting: (8<=p1_4)
states: 317,015,172,154 (11)
abstracting: (p1_2<=17)
states: 195,864,696,022 (11)
abstracting: (35<=p1_3)
states: 114,892,590,882 (11)
abstracting: (p2_3<=p0_2)
states: 212,117,713,603 (11)
abstracting: (p0_3<=p2_3)
states: 417,214,571,243 (11)
abstracting: (39<=p1_2)
states: 97,533,021,800 (10)
abstracting: (11<=p2_2)
states: 285,332,530,560 (11)
-> the formula is FALSE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.479sec

checking: EF [[[p2_1<=35 | [[~ [[[[p0_3<=p1_3 & 6<=p0_1] & [26<=p2_2 | 5<=p1_3]] | p0_4<=p0_4]] & ~ [[~ [[39<=p2_2 | p0_4<=p1_1]] | [[[12<=p2_3 | p0_2<=p2_2] | ~ [7<=p2_4]] & [[17<=p0_1 & p0_4<=p0_1] & ~ [p2_2<=6]]]]]] & p1_3<=47]] & [~ [[p0_1<=p1_1 | [[[15<=p0_2 | [p2_4<=47 & p0_3<=p1_4]] & [~ [p2_3<=19] | 47<=p2_1]] | [[[2<=p1_2 & p1_4<=p0_4] & [p2_2<=49 | p1_1<=p2_1]] & [[p1_3<=28 | p0_2<=23] | ~ [p2_4<=18]]]]]] & p1_4<=p1_4]]]
normalized: E [true U [[p1_4<=p1_4 & ~ [[p0_1<=p1_1 | [[[~ [p2_4<=18] | [p1_3<=28 | p0_2<=23]] & [[p2_2<=49 | p1_1<=p2_1] & [2<=p1_2 & p1_4<=p0_4]]] | [[47<=p2_1 | ~ [p2_3<=19]] & [15<=p0_2 | [p2_4<=47 & p0_3<=p1_4]]]]]]] & [p2_1<=35 | [p1_3<=47 & [~ [[[[~ [p2_2<=6] & [17<=p0_1 & p0_4<=p0_1]] & [~ [7<=p2_4] | [12<=p2_3 | p0_2<=p2_2]]] | ~ [[39<=p2_2 | p0_4<=p1_1]]]] & ~ [[p0_4<=p0_4 | [[26<=p2_2 | 5<=p1_3] & [p0_3<=p1_3 & 6<=p0_1]]]]]]]]]

abstracting: (6<=p0_1)
states: 339,893,473,920 (11)
abstracting: (p0_3<=p1_3)
states: 208,606,823,403 (11)
abstracting: (5<=p1_3)
states: 352,031,623,426 (11)
abstracting: (26<=p2_2)
states: 163,773,886,848 (11)
abstracting: (p0_4<=p0_4)
states: 417,214,571,243 (11)
abstracting: (p0_4<=p1_1)
states: 212,117,511,009 (11)
abstracting: (39<=p2_2)
states: 97,533,546,344 (10)
abstracting: (p0_2<=p2_2)
states: 417,214,571,243 (11)
abstracting: (12<=p2_3)
states: 275,193,811,200 (11)
abstracting: (7<=p2_4)
states: 328,454,751,240 (11)
abstracting: (p0_4<=p0_1)
states: 212,117,713,603 (11)
abstracting: (17<=p0_1)
states: 229,771,557,568 (11)
abstracting: (p2_2<=6)
states: 88,759,820,003 (10)
abstracting: (p1_3<=47)
states: 350,784,314,321 (11)
abstracting: (p2_1<=35)
states: 306,970,274,091 (11)
abstracting: (p0_3<=p1_4)
states: 212,117,511,009 (11)
abstracting: (p2_4<=47)
states: 350,783,873,195 (11)
abstracting: (15<=p0_2)
states: 247,156,738,752 (11)
abstracting: (p2_3<=19)
states: 211,674,718,699 (11)
abstracting: (47<=p2_1)
states: 69,450,275,232 (10)
abstracting: (p1_4<=p0_4)
states: 208,607,747,840 (11)
abstracting: (2<=p1_2)
states: 389,920,149,657 (11)
abstracting: (p1_1<=p2_1)
states: 208,607,747,840 (11)
abstracting: (p2_2<=49)
states: 356,386,462,187 (11)
abstracting: (p0_2<=23)
states: 240,413,216,123 (11)
abstracting: (p1_3<=28)
states: 271,341,780,911 (11)
abstracting: (p2_4<=18)
states: 203,769,339,755 (11)
abstracting: (p0_1<=p1_1)
states: 208,606,823,403 (11)
abstracting: (p1_4<=p1_4)
states: 417,214,571,243 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D03N050-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1680818885927

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:11549 (962), effective:3858 (321)

initing FirstDep: 0m 0.000sec


iterations count:471 (39), effective:130 (10)

iterations count:1486 (123), effective:418 (34)

iterations count:521 (43), effective:158 (13)

iterations count:521 (43), effective:158 (13)

iterations count:604 (50), effective:194 (16)

iterations count:770 (64), effective:278 (23)

iterations count:3445 (287), effective:862 (71)

iterations count:2470 (205), effective:767 (63)

iterations count:3896 (324), effective:1226 (102)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 456 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="PGCD-PT-D03N050"
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 PGCD-PT-D03N050, 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 r522-tall-167987247400462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D03N050.tgz
mv PGCD-PT-D03N050 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;