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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10585.615 520172.00 566060.00 1536.60 FTTTFTTFTTFTFFTF 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-167873952300855.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-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300855
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 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 131K 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-32-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679685307023

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 19:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:15: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 19:15:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 19:15:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 702 ms
[2023-03-24 19:15:09] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 19:15:09] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 19:15:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Remains 1 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
Incomplete random walk after 100009 steps, including 2280 resets, run finished after 129 ms. (steps per millisecond=775 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 19:15:09] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-24 19:15:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 19:15:09] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 19:15:09] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 19:15:09] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 19:15:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 19:15:09] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 19:15:09] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-24 19:15:09] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-24 19:15:09] [INFO ] Flatten gal took : 17 ms
[2023-03-24 19:15:09] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-24 19:15:09] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 30 ms.
[2023-03-24 19:15:09] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 267 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=5 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 269901 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Probabilistic random walk after 269901 steps, saw 56876 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :9
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 19:15:14] [INFO ] Computed 3301 place invariants in 164 ms
[2023-03-24 19:15:19] [INFO ] [Real]Absence check using 37 positive place invariants in 67 ms returned sat
[2023-03-24 19:15:20] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 959 ms returned sat
[2023-03-24 19:15:20] [INFO ] After 2296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 19:15:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 52 ms returned sat
[2023-03-24 19:15:22] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 754 ms returned sat
[2023-03-24 19:15:45] [INFO ] After 11000ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-24 19:15:45] [INFO ] After 11006ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 19:15:45] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3736 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.22 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 3736/3806 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1395 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 754 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1075418 steps, run timeout after 9001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 1075418 steps, saw 156529 distinct states, run finished after 9004 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 19:15:58] [INFO ] Computed 3232 place invariants in 138 ms
[2023-03-24 19:16:01] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 742 ms returned sat
[2023-03-24 19:16:02] [INFO ] After 1788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 19:16:03] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 745 ms returned sat
[2023-03-24 19:16:27] [INFO ] After 22718ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-24 19:16:27] [INFO ] After 22725ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 19:16:27] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3736 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 29 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 3736/3736 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1431 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 756 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1174481 steps, run timeout after 9001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 1174481 steps, saw 171258 distinct states, run finished after 9005 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-24 19:16:39] [INFO ] Invariant cache hit.
[2023-03-24 19:16:42] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 743 ms returned sat
[2023-03-24 19:16:43] [INFO ] After 1657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 19:16:44] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 747 ms returned sat
[2023-03-24 19:17:08] [INFO ] After 22741ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-24 19:17:08] [INFO ] After 22747ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 19:17:08] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2579 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3736 transition count 505
Applied a total of 1 rules in 123 ms. Remains 3736 /3736 variables (removed 0) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 3736/3736 places, 505/506 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 368164 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 368164 steps, saw 69898 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 505 rows 3736 cols
[2023-03-24 19:17:13] [INFO ] Computed 3233 place invariants in 74 ms
[2023-03-24 19:17:15] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 723 ms returned sat
[2023-03-24 19:17:15] [INFO ] After 1403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 19:17:16] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 733 ms returned sat
[2023-03-24 19:17:33] [INFO ] After 17954ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 144966 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=3806|T|=506|A|=8173
Time for unfolding: 0m 2.023sec

Net: QuasiCertifProtocol_COL_32
(NrP: 3806 NrTr: 506 NrArc: 8173)

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

net check time: 0m 0.001sec

init dd package: 0m 2.658sec


before gc: list nodes free: 1844539

after gc: idd nodes used:45423935, unused:18576065; list nodes free:87121335

RS generation: 5m33.761sec


-> last computed set: #nodes 45420163 (4.5e+07) #states 2,097,153 (6)


CANNOT_COMPUTE


BK_STOP 1679685827195

--------------------
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 ReachabilityFireability -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.002sec

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-32"
export BK_EXAMINATION="ReachabilityFireability"
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-32, examination is ReachabilityFireability"
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-167873952300855"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;