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.r523-tall-167987247900358.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 smartxred
Input is Murphy-PT-D3N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247900358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 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 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K 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 Murphy-PT-D3N050-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680837834277

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 03:23:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:23:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:23:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-04-07 03:23:56] [INFO ] Transformed 24 places.
[2023-04-07 03:23:56] [INFO ] Transformed 28 transitions.
[2023-04-07 03:23:56] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10012 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=65 ) properties (out of 16) seen :8
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 03:23:56] [INFO ] Computed 5 invariants in 8 ms
[2023-04-07 03:23:57] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:23:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 03:23:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:23:57] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:23:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 03:23:57] [INFO ] After 92ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:23:57] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-04-07 03:23:57] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 48 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 03:23:57] [INFO ] Invariant cache hit.
[2023-04-07 03:23:57] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 272697 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272697 steps, saw 184591 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 03:24:00] [INFO ] Invariant cache hit.
[2023-04-07 03:24:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:24:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 03:24:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:24:01] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:24:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 03:24:01] [INFO ] After 43ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:24:01] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 03:24:01] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 92 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 03:24:01] [INFO ] Invariant cache hit.
[2023-04-07 03:24:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:24:01] [INFO ] Invariant cache hit.
[2023-04-07 03:24:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 03:24:01] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 03:24:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:24:01] [INFO ] Invariant cache hit.
[2023-04-07 03:24:01] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 03:24:01] [INFO ] Invariant cache hit.
[2023-04-07 03:24:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:24:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 03:24:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:24:01] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:24:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 03:24:01] [INFO ] After 49ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:24:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
[2023-04-07 03:24:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 03:24:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2023-04-07 03:24:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 81 ms
[2023-04-07 03:24:01] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 03:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 03:24:01] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 03:24:01] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:24:01] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-04-07 03:24:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
[2023-04-07 03:24:01] [INFO ] Flatten gal took : 24 ms
Total runtime 5903 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Murphy (PT), instance D3N050
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 24 places, 28 transitions, 108 arcs.
Final Score: 89.116
Took : 0 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-00 (reachable & potential(( ( ( ( 34 ) <= (tk(P6)) ) & (! ( (tk(P3)) <= (tk(P15)) )) ) & ( ( (tk(P17)) <= (tk(P24)) ) & (! ( (tk(P22)) <= ( 47 ) )) ) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-04 (reachable &!potential( ( ( (tk(P3)) <= (tk(P5)) ) | ( ( ( ( ( 33 ) <= (tk(P5)) ) | ( ( ( ( (tk(P1)) <= (tk(P19)) ) | ( (! ( ( 43 ) <= (tk(P11)) )) & (! ( ( 7 ) <= (tk(P24)) )) ) ) & ( (! ( (tk(P2)) <= (tk(P10)) )) | ( (! ( (tk(P6)) <= ( 29 ) )) & (! ( ( 12 ) <= (tk(P20)) )) ) ) ) | ( ( ( (! ( ( 6 ) <= (tk(P19)) )) | ( ( (tk(P20)) <= (tk(P21)) ) | ( (tk(P5)) <= (tk(P24)) ) ) ) | ( ( ( ( 21 ) <= (tk(P19)) ) | ( ( 49 ) <= (tk(P3)) ) ) | ( ( ( (tk(P10)) <= (tk(P21)) ) & ( ( 23 ) <= (tk(P10)) ) ) | ( ( (tk(P17)) <= ( 32 ) ) & ( (! ( (tk(P15)) <= ( 17 ) )) | (! ( (tk(P14)) <= (tk(P13)) )) ) ) ) ) ) & ( ( (! ( ( 43 ) <= (tk(P3)) )) | (! ( ( 35 ) <= (tk(P22)) )) ) | ( (! ( (tk(P4)) <= (tk(P16)) )) | ( ( ( (tk(P13)) <= ( 45 ) ) & ( (tk(P19)) <= (tk(P9)) ) ) & ( ( ( 41 ) <= (tk(P17)) ) & ( ( (tk(P10)) <= ( 45 ) ) & ( (! ( ( 15 ) <= (tk(P21)) )) | ( ( ( 11 ) <= (tk(P10)) ) | ( (tk(P23)) <= (tk(P1)) ) ) ) ) ) ) ) ) ) ) ) & ( ( ( ( 18 ) <= (tk(P1)) ) | ( (tk(P23)) <= ( 10 ) ) ) | ( (! ( ( 21 ) <= (tk(P2)) )) | ( (! ( (tk(P2)) <= ( 3 ) )) | ( (! ( (tk(P6)) <= (tk(P19)) )) & ( ( ( 21 ) <= (tk(P13)) ) | ( ( (tk(P7)) <= (tk(P10)) ) & ( ( (tk(P4)) <= (tk(P20)) ) & ( ( (tk(P9)) <= ( 42 ) ) | ( (tk(P5)) <= (tk(P9)) ) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P4)) <= (tk(P6)) ) | ( (tk(P8)) <= (tk(P12)) ) ) & ( ( (tk(P14)) <= (tk(P16)) ) | ( (tk(P10)) <= ( 36 ) ) ) ) & ( ( ( (! ( ( 37 ) <= (tk(P8)) )) | (! ( ( 26 ) <= (tk(P13)) )) ) | ( (! ( ( 32 ) <= (tk(P4)) )) | ( (! ( (tk(P18)) <= ( 13 ) )) & (! ( (tk(P19)) <= ( 47 ) )) ) ) ) & ( ( ( (tk(P8)) <= ( 22 ) ) & ( ( ( (! ( (tk(P10)) <= ( 7 ) )) | (! ( (tk(P1)) <= ( 32 ) )) ) | ( ( (tk(P5)) <= ( 14 ) ) | ( ( (tk(P21)) <= (tk(P23)) ) | ( (! ( (tk(P10)) <= (tk(P18)) )) & (! ( (tk(P18)) <= ( 3 ) )) ) ) ) ) & ( (! ( (tk(P22)) <= (tk(P24)) )) | ( (! ( (tk(P7)) <= ( 27 ) )) | (! ( (tk(P6)) <= ( 0 ) )) ) ) ) ) | ( ( ( (tk(P3)) <= (tk(P1)) ) & (! ( ( 18 ) <= (tk(P1)) )) ) & ( (! ( ( 37 ) <= (tk(P13)) )) & ( ( (tk(P19)) <= (tk(P24)) ) & ( ( 30 ) <= (tk(P8)) ) ) ) ) ) ) ) ) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-06 (reachable & potential(( ( ( (! ( ( 34 ) <= (tk(P14)) )) & ( ( 28 ) <= (tk(P9)) ) ) & ( ( ( 43 ) <= (tk(P10)) ) & (! ( ( 20 ) <= (tk(P3)) )) ) ) & ( ( ( (tk(P19)) <= (tk(P1)) ) & ( ( 12 ) <= (tk(P23)) ) ) & ( ( ( (tk(P8)) <= ( 47 ) ) | ( ( (! ( (tk(P8)) <= (tk(P22)) )) & (! ( (tk(P18)) <= ( 41 ) )) ) & ( ( (! ( ( 43 ) <= (tk(P24)) )) | ( ( (! ( ( 12 ) <= (tk(P13)) )) | (! ( ( 36 ) <= (tk(P14)) )) ) & ( (! ( (tk(P2)) <= ( 4 ) )) | (! ( (tk(P11)) <= ( 27 ) )) ) ) ) & ( ( (! ( ( 13 ) <= (tk(P9)) )) | ( (! ( ( 28 ) <= (tk(P15)) )) | (! ( ( 37 ) <= (tk(P8)) )) ) ) & ( ( (tk(P21)) <= ( 33 ) ) | ( ( (! ( ( 37 ) <= (tk(P21)) )) & (! ( ( 33 ) <= (tk(P13)) )) ) | ( ( (tk(P21)) <= (tk(P18)) ) & ( (tk(P10)) <= (tk(P21)) ) ) ) ) ) ) ) ) & ( ( ( (tk(P19)) <= ( 12 ) ) | ( ( (tk(P19)) <= (tk(P2)) ) | ( (tk(P10)) <= (tk(P15)) ) ) ) & ( ( ( ( ( 27 ) <= (tk(P13)) ) & ( (! ( (tk(P21)) <= (tk(P1)) )) & (! ( ( 32 ) <= (tk(P2)) )) ) ) & ( ( ( 8 ) <= (tk(P19)) ) & ( ( ( (tk(P18)) <= (tk(P10)) ) | ( (tk(P19)) <= (tk(P22)) ) ) & ( ( ( 16 ) <= (tk(P12)) ) | ( (tk(P5)) <= (tk(P6)) ) ) ) ) ) | ( ( (tk(P10)) <= (tk(P17)) ) & ( (tk(P22)) <= ( 7 ) ) ) ) ) ) ) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P22)) <= ( 49 ) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-10 (reachable & potential(( ( 14 ) <= (tk(P19)) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-11 (reachable &!potential( ( ( (tk(P6)) <= ( 49 ) ) | ( ( (tk(P8)) <= ( 10 ) ) | ( ( (! ( (tk(P11)) <= (tk(P9)) )) | ( (tk(P13)) <= ( 37 ) ) ) & ( ( (! ( (tk(P2)) <= (tk(P12)) )) | ( (! ( ( 32 ) <= (tk(P20)) )) | ( (tk(P10)) <= (tk(P8)) ) ) ) | ( (! ( ( 5 ) <= (tk(P9)) )) | ( ( (! ( (tk(P16)) <= ( 21 ) )) & (! ( ( 47 ) <= (tk(P3)) )) ) | ( ( (tk(P12)) <= ( 11 ) ) & ( ( (tk(P7)) <= ( 18 ) ) & ( ( 27 ) <= (tk(P20)) ) ) ) ) ) ) ) ) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-12 (reachable & potential(( ( 28 ) <= (tk(P13)) )))
PROPERTY: Murphy-PT-D3N050-ReachabilityCardinality-13 (reachable &!potential( ( (! ( ( 37 ) <= (tk(P20)) )) | ( (tk(P17)) <= ( 49 ) ) )))
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1680837983339

--------------------
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

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="Murphy-PT-D3N050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Murphy-PT-D3N050, 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 r523-tall-167987247900358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 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 ;