fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873952300886
Last Updated
May 14, 2023

About the Execution of Marcie+red for QuasiCertifProtocol-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10215.819 1589559.00 1612776.00 3801.00 FTTFFTTFTTFFTFTF 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.r298-tall-167873952300886.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 QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300886
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K 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 QuasiCertifProtocol-PT-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679689518972

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=QuasiCertifProtocol-PT-18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:25:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 20:25:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:25:20] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-24 20:25:20] [INFO ] Transformed 1398 places.
[2023-03-24 20:25:20] [INFO ] Transformed 296 transitions.
[2023-03-24 20:25:20] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 443 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 549851 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549851 steps, saw 80163 distinct states, run finished after 3006 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 296 rows 1398 cols
[2023-03-24 20:25:24] [INFO ] Computed 1103 place invariants in 56 ms
[2023-03-24 20:25:25] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 20:25:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-24 20:25:26] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 171 ms returned sat
[2023-03-24 20:25:38] [INFO ] After 11916ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :3
[2023-03-24 20:25:40] [INFO ] After 13632ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :3
Attempting to minimize the solution found.
Minimization took 1638 ms.
[2023-03-24 20:25:42] [INFO ] After 16420ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :3
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 4 different solutions.
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 27 ms.
Support contains 418 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1355 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.8 ms
Discarding 43 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 157 rules applied. Total rules applied 158 place count 1317 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 159 place count 1316 transition count 175
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 159 place count 1316 transition count 117
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 331 place count 1202 transition count 117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 331 place count 1202 transition count 115
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 336 place count 1199 transition count 115
Applied a total of 336 rules in 241 ms. Remains 1199 /1398 variables (removed 199) and now considering 115/296 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 1199/1398 places, 115/296 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1130333 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1130333 steps, saw 150604 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 1199 cols
[2023-03-24 20:25:45] [INFO ] Computed 1084 place invariants in 16 ms
[2023-03-24 20:25:45] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 20:25:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-24 20:25:46] [INFO ] [Nat]Absence check using 19 positive and 1065 generalized place invariants in 173 ms returned sat
[2023-03-24 20:25:55] [INFO ] After 10052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 418 out of 1199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1199/1199 places, 115/115 transitions.
Applied a total of 0 rules in 71 ms. Remains 1199 /1199 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1199/1199 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1199/1199 places, 115/115 transitions.
Applied a total of 0 rules in 62 ms. Remains 1199 /1199 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-24 20:25:56] [INFO ] Invariant cache hit.
[2023-03-24 20:25:57] [INFO ] Implicit Places using invariants in 1082 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1161/1199 places, 115/115 transitions.
Applied a total of 0 rules in 26 ms. Remains 1161 /1161 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1174 ms. Remains : 1161/1199 places, 115/115 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1191707 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :{}
Probabilistic random walk after 1191707 steps, saw 159651 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 1161 cols
[2023-03-24 20:26:00] [INFO ] Computed 1046 place invariants in 13 ms
[2023-03-24 20:26:00] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 20:26:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-24 20:26:00] [INFO ] [Nat]Absence check using 19 positive and 1027 generalized place invariants in 149 ms returned sat
[2023-03-24 20:26:10] [INFO ] After 9618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 418 out of 1161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1161/1161 places, 115/115 transitions.
Applied a total of 0 rules in 28 ms. Remains 1161 /1161 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1161/1161 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1161/1161 places, 115/115 transitions.
Applied a total of 0 rules in 22 ms. Remains 1161 /1161 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-24 20:26:10] [INFO ] Invariant cache hit.
[2023-03-24 20:26:11] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-24 20:26:11] [INFO ] Invariant cache hit.
[2023-03-24 20:26:12] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned [694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 807, 808, 809, 810, 811, 812, 813, 814, 815]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2175 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1142/1161 places, 115/115 transitions.
Applied a total of 0 rules in 24 ms. Remains 1142 /1142 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2223 ms. Remains : 1142/1161 places, 115/115 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1367542 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1367542 steps, saw 186056 distinct states, run finished after 3003 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 1142 cols
[2023-03-24 20:26:15] [INFO ] Computed 1027 place invariants in 14 ms
[2023-03-24 20:26:15] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 20:26:15] [INFO ] [Nat]Absence check using 0 positive and 1027 generalized place invariants in 156 ms returned sat
[2023-03-24 20:26:18] [INFO ] After 3388ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 58590 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: QuasiCertifProtocol_PT_18
(NrP: 1398 NrTr: 296 NrArc: 3119)

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

net check time: 0m 0.002sec

init dd package: 0m 2.726sec


before gc: list nodes free: 140619

after gc: idd nodes used:61010102, unused:2989898; list nodes free:13840647

before gc: list nodes free: 402702

after gc: idd nodes used:63821346, unused:178654; list nodes free:1226360

RS generation: 24m38.697sec


-> last computed set: #nodes 63819968 (6.4e+07) #states 308,223,557 (8)


CANNOT_COMPUTE


BK_STOP 1679691108531

--------------------
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
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.001sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-PT-18"
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 QuasiCertifProtocol-PT-18, 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 r298-tall-167873952300886"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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