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

About the Execution of Marcie+red for DLCround-PT-13b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7877.500 3600000.00 3677272.00 8057.00 TTTTTTTFFTFTFTFF 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.r106-tall-167814483200790.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 DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483200790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.3K Feb 25 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 5 18:22 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 DLCround-PT-13b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678477613118

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=DLCround-PT-13b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 19:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:46:55] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2023-03-10 19:46:55] [INFO ] Transformed 5343 places.
[2023-03-10 19:46:55] [INFO ] Transformed 8727 transitions.
[2023-03-10 19:46:55] [INFO ] Found NUPN structural information;
[2023-03-10 19:46:55] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 13) seen :3
FORMULA DLCround-PT-13b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 8727 rows 5343 cols
[2023-03-10 19:46:56] [INFO ] Computed 312 place invariants in 69 ms
[2023-03-10 19:46:58] [INFO ] After 1646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-10 19:47:00] [INFO ] [Nat]Absence check using 312 positive place invariants in 351 ms returned sat
[2023-03-10 19:47:07] [INFO ] After 6908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-10 19:47:09] [INFO ] Deduced a trap composed of 333 places in 1665 ms of which 15 ms to minimize.
[2023-03-10 19:47:11] [INFO ] Deduced a trap composed of 366 places in 1340 ms of which 7 ms to minimize.
[2023-03-10 19:47:12] [INFO ] Deduced a trap composed of 271 places in 1226 ms of which 2 ms to minimize.
[2023-03-10 19:47:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5377 ms
[2023-03-10 19:47:15] [INFO ] Deduced a trap composed of 301 places in 1124 ms of which 3 ms to minimize.
[2023-03-10 19:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1805 ms
[2023-03-10 19:47:17] [INFO ] Deduced a trap composed of 199 places in 1093 ms of which 2 ms to minimize.
[2023-03-10 19:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1766 ms
[2023-03-10 19:47:19] [INFO ] Deduced a trap composed of 155 places in 1219 ms of which 2 ms to minimize.
[2023-03-10 19:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1900 ms
[2023-03-10 19:47:23] [INFO ] After 22412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-10 19:47:23] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 9 different solutions.
FORMULA DLCround-PT-13b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 637 ms.
Support contains 93 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4708 edges and 5343 vertex of which 743 / 5343 are part of one of the 60 SCC in 19 ms
Free SCC test removed 683 places
Drop transitions removed 766 transitions
Reduce isomorphic transitions removed 766 transitions.
Drop transitions removed 1839 transitions
Trivial Post-agglo rules discarded 1839 transitions
Performed 1839 trivial Post agglomeration. Transition count delta: 1839
Iterating post reduction 0 with 1839 rules applied. Total rules applied 1840 place count 4660 transition count 6122
Reduce places removed 1839 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 1927 rules applied. Total rules applied 3767 place count 2821 transition count 6034
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 44 rules applied. Total rules applied 3811 place count 2784 transition count 6027
Reduce places removed 3 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 3 with 44 rules applied. Total rules applied 3855 place count 2781 transition count 5986
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 43 rules applied. Total rules applied 3898 place count 2740 transition count 5984
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3899 place count 2739 transition count 5984
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 3899 place count 2739 transition count 5943
Deduced a syphon composed of 41 places in 101 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 3981 place count 2698 transition count 5943
Discarding 688 places :
Symmetric choice reduction at 6 with 688 rule applications. Total rules 4669 place count 2010 transition count 5255
Iterating global reduction 6 with 688 rules applied. Total rules applied 5357 place count 2010 transition count 5255
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 287 Pre rules applied. Total rules applied 5357 place count 2010 transition count 4968
Deduced a syphon composed of 287 places in 39 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 6 with 574 rules applied. Total rules applied 5931 place count 1723 transition count 4968
Discarding 83 places :
Symmetric choice reduction at 6 with 83 rule applications. Total rules 6014 place count 1640 transition count 3572
Iterating global reduction 6 with 83 rules applied. Total rules applied 6097 place count 1640 transition count 3572
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 6119 place count 1640 transition count 3550
Performed 424 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 424 places in 2 ms
Reduce places removed 424 places and 0 transitions.
Iterating global reduction 7 with 848 rules applied. Total rules applied 6967 place count 1216 transition count 3116
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 6979 place count 1216 transition count 3104
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 6983 place count 1212 transition count 3036
Iterating global reduction 8 with 4 rules applied. Total rules applied 6987 place count 1212 transition count 3036
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -645
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 7145 place count 1133 transition count 3681
Drop transitions removed 86 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 8 with 88 rules applied. Total rules applied 7233 place count 1133 transition count 3593
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 7235 place count 1131 transition count 3529
Iterating global reduction 9 with 2 rules applied. Total rules applied 7237 place count 1131 transition count 3529
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 7239 place count 1131 transition count 3527
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 10 with 82 rules applied. Total rules applied 7321 place count 1131 transition count 3445
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 7338 place count 1114 transition count 3428
Iterating global reduction 10 with 17 rules applied. Total rules applied 7355 place count 1114 transition count 3428
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 7372 place count 1097 transition count 3076
Iterating global reduction 10 with 17 rules applied. Total rules applied 7389 place count 1097 transition count 3076
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 7406 place count 1097 transition count 3059
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 7436 place count 1082 transition count 3044
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 7449 place count 1069 transition count 2777
Iterating global reduction 11 with 13 rules applied. Total rules applied 7462 place count 1069 transition count 2777
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 7474 place count 1069 transition count 2765
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 7475 place count 1069 transition count 2764
Free-agglomeration rule applied 493 times with reduction of 187 identical transitions.
Iterating global reduction 12 with 493 rules applied. Total rules applied 7968 place count 1069 transition count 2084
Reduce places removed 493 places and 0 transitions.
Drop transitions removed 635 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 646 transitions.
Graph (complete) has 1757 edges and 576 vertex of which 541 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1140 rules applied. Total rules applied 9108 place count 541 transition count 1438
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 13 with 26 rules applied. Total rules applied 9134 place count 541 transition count 1412
Discarding 85 places :
Symmetric choice reduction at 14 with 85 rule applications. Total rules 9219 place count 456 transition count 1243
Iterating global reduction 14 with 85 rules applied. Total rules applied 9304 place count 456 transition count 1243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 9308 place count 454 transition count 1266
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 9325 place count 454 transition count 1249
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 15 with 162 rules applied. Total rules applied 9487 place count 454 transition count 1087
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 1368 edges and 450 vertex of which 436 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 5 rules applied. Total rules applied 9492 place count 436 transition count 1087
Drop transitions removed 14 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 16 with 35 rules applied. Total rules applied 9527 place count 436 transition count 1052
Discarding 20 places :
Symmetric choice reduction at 17 with 20 rule applications. Total rules 9547 place count 416 transition count 1015
Iterating global reduction 17 with 20 rules applied. Total rules applied 9567 place count 416 transition count 1015
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 9570 place count 416 transition count 1012
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 9573 place count 413 transition count 1012
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 9574 place count 413 transition count 1020
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 9583 place count 412 transition count 1012
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 9587 place count 412 transition count 1012
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 9589 place count 412 transition count 1010
Applied a total of 9589 rules in 1993 ms. Remains 412 /5343 variables (removed 4931) and now considering 1010/8727 (removed 7717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1994 ms. Remains : 412/5343 places, 1010/8727 transitions.
Finished random walk after 9615 steps, including 2 resets, run visited all 6 properties in 81 ms. (steps per millisecond=118 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31605 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: DLCround_PT_13b
(NrP: 5343 NrTr: 8727 NrArc: 24849)

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

net check time: 0m 0.004sec

init dd package: 0m 2.804sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8270396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099856 kB

BK_TIME_CONFINEMENT_REACHED

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

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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r106-tall-167814483200790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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