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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10277.052 742617.00 762264.00 2243.90 FTTFFTTFTF?TFFTF 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-167873952300830.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-COL-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 3.8K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679683387029

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-COL-18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 18:43:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 18:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 18:43:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 18:43:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 18:43:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2023-03-24 18:43:09] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 18:43:09] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 18:43:09] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
[2023-03-24 18:43:09] [INFO ] Flatten gal took : 18 ms
[2023-03-24 18:43:09] [INFO ] Flatten gal took : 5 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2023-03-24 18:43:09] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 28 ms.
[2023-03-24 18:43:09] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 911 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) 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 49 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) 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 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) 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 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 265245 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{8=1, 12=1, 13=1, 15=1}
Probabilistic random walk after 265245 steps, saw 44573 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :4
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 296 rows 1398 cols
[2023-03-24 18:43:13] [INFO ] Computed 1103 place invariants in 73 ms
[2023-03-24 18:43:15] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-24 18:43:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-24 18:43:15] [INFO ] [Nat]Absence check using 4 positive and 1099 generalized place invariants in 211 ms returned sat
[2023-03-24 18:43:33] [INFO ] After 18700ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 459 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 1357 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.12 ms
Discarding 41 places :
Also discarding 0 output transitions
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 1319 transition count 200
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 135 place count 1319 transition count 162
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 1 with 94 rules applied. Total rules applied 229 place count 1263 transition count 162
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 230 place count 1262 transition count 162
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 1262 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 1262 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 1261 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 1261 transition count 159
Applied a total of 235 rules in 363 ms. Remains 1261 /1398 variables (removed 137) and now considering 159/296 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 1261/1398 places, 159/296 transitions.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 563656 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563656 steps, saw 70509 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 159 rows 1261 cols
[2023-03-24 18:43:37] [INFO ] Computed 1102 place invariants in 18 ms
[2023-03-24 18:43:37] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:43:37] [INFO ] [Nat]Absence check using 362 positive place invariants in 51 ms returned sat
[2023-03-24 18:43:37] [INFO ] [Nat]Absence check using 362 positive and 740 generalized place invariants in 115 ms returned sat
[2023-03-24 18:43:47] [INFO ] After 9993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 459 out of 1261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 159/159 transitions.
Applied a total of 0 rules in 32 ms. Remains 1261 /1261 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1261/1261 places, 159/159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 159/159 transitions.
Applied a total of 0 rules in 24 ms. Remains 1261 /1261 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2023-03-24 18:43:47] [INFO ] Invariant cache hit.
[2023-03-24 18:43:48] [INFO ] Implicit Places using invariants in 1042 ms returned [1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1242/1261 places, 159/159 transitions.
Applied a total of 0 rules in 25 ms. Remains 1242 /1242 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1096 ms. Remains : 1242/1261 places, 159/159 transitions.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 585700 steps, run timeout after 3003 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 585700 steps, saw 72830 distinct states, run finished after 3004 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 159 rows 1242 cols
[2023-03-24 18:43:51] [INFO ] Computed 1083 place invariants in 14 ms
[2023-03-24 18:43:51] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:43:52] [INFO ] [Nat]Absence check using 362 positive place invariants in 67 ms returned sat
[2023-03-24 18:43:52] [INFO ] [Nat]Absence check using 362 positive and 721 generalized place invariants in 112 ms returned sat
[2023-03-24 18:44:01] [INFO ] After 9852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 459 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 159/159 transitions.
Applied a total of 0 rules in 32 ms. Remains 1242 /1242 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1242/1242 places, 159/159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 159/159 transitions.
Applied a total of 0 rules in 23 ms. Remains 1242 /1242 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2023-03-24 18:44:01] [INFO ] Invariant cache hit.
[2023-03-24 18:44:02] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2023-03-24 18:44:02] [INFO ] Invariant cache hit.
[2023-03-24 18:44:04] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2023-03-24 18:44:04] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-24 18:44:04] [INFO ] Invariant cache hit.
[2023-03-24 18:44:04] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2694 ms. Remains : 1242/1242 places, 159/159 transitions.
Applied a total of 0 rules in 23 ms. Remains 1242 /1242 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-24 18:44:04] [INFO ] Invariant cache hit.
[2023-03-24 18:44:04] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 18:44:04] [INFO ] [Nat]Absence check using 362 positive place invariants in 55 ms returned sat
[2023-03-24 18:44:04] [INFO ] [Nat]Absence check using 362 positive and 721 generalized place invariants in 116 ms returned sat
[2023-03-24 18:44:14] [INFO ] After 9765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-24 18:44:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 18:44:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1242 places, 159 transitions and 2503 arcs took 5 ms.
[2023-03-24 18:44:14] [INFO ] Flatten gal took : 71 ms
Total runtime 66031 ms.
There are residual formulas that ITS could not solve within timeout
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: Document_unf
(NrP: 1242 NrTr: 159 NrArc: 2503)

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

net check time: 0m 0.000sec

init dd package: 0m 2.680sec


before gc: list nodes free: 1474417

after gc: idd nodes used:54723884, unused:9276116; list nodes free:44804059

RS generation: 10m36.042sec


-> last computed set: #nodes 54722662 (5.5e+07) #states 2,228,227 (6)


CANNOT_COMPUTE


BK_STOP 1679684129646

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
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

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-COL-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-COL-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-167873952300830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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