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-167814483200758.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-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483200758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:18 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.9K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:19 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 1.7M 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-11b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678469465963

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-11b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 17:31:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 17:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:31:07] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-10 17:31:07] [INFO ] Transformed 4375 places.
[2023-03-10 17:31:07] [INFO ] Transformed 6991 transitions.
[2023-03-10 17:31:07] [INFO ] Found NUPN structural information;
[2023-03-10 17:31:07] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-11b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 14) seen :9
FORMULA DLCround-PT-11b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6991 rows 4375 cols
[2023-03-10 17:31:08] [INFO ] Computed 244 place invariants in 58 ms
[2023-03-10 17:31:10] [INFO ] [Real]Absence check using 244 positive place invariants in 267 ms returned sat
[2023-03-10 17:31:10] [INFO ] After 1603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 17:31:11] [INFO ] [Nat]Absence check using 244 positive place invariants in 234 ms returned sat
[2023-03-10 17:31:15] [INFO ] After 4105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 17:31:17] [INFO ] Deduced a trap composed of 240 places in 1130 ms of which 7 ms to minimize.
[2023-03-10 17:31:18] [INFO ] Deduced a trap composed of 192 places in 984 ms of which 6 ms to minimize.
[2023-03-10 17:31:19] [INFO ] Deduced a trap composed of 355 places in 814 ms of which 2 ms to minimize.
[2023-03-10 17:31:20] [INFO ] Deduced a trap composed of 299 places in 822 ms of which 4 ms to minimize.
[2023-03-10 17:31:21] [INFO ] Deduced a trap composed of 271 places in 766 ms of which 2 ms to minimize.
[2023-03-10 17:31:22] [INFO ] Deduced a trap composed of 319 places in 717 ms of which 2 ms to minimize.
[2023-03-10 17:31:23] [INFO ] Deduced a trap composed of 312 places in 696 ms of which 1 ms to minimize.
[2023-03-10 17:31:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7499 ms
[2023-03-10 17:31:25] [INFO ] Deduced a trap composed of 232 places in 1227 ms of which 2 ms to minimize.
[2023-03-10 17:31:26] [INFO ] Deduced a trap composed of 197 places in 1143 ms of which 2 ms to minimize.
[2023-03-10 17:31:28] [INFO ] Deduced a trap composed of 331 places in 1034 ms of which 2 ms to minimize.
[2023-03-10 17:31:29] [INFO ] Deduced a trap composed of 257 places in 1092 ms of which 2 ms to minimize.
[2023-03-10 17:31:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5600 ms
[2023-03-10 17:31:31] [INFO ] Deduced a trap composed of 294 places in 859 ms of which 2 ms to minimize.
[2023-03-10 17:31:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1350 ms
[2023-03-10 17:31:31] [INFO ] After 20116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2023-03-10 17:31:33] [INFO ] After 22761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA DLCround-PT-11b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 341 ms.
Support contains 70 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3898 edges and 4375 vertex of which 649 / 4375 are part of one of the 54 SCC in 14 ms
Free SCC test removed 595 places
Drop transitions removed 669 transitions
Reduce isomorphic transitions removed 669 transitions.
Drop transitions removed 1533 transitions
Trivial Post-agglo rules discarded 1533 transitions
Performed 1533 trivial Post agglomeration. Transition count delta: 1533
Iterating post reduction 0 with 1533 rules applied. Total rules applied 1534 place count 3780 transition count 4789
Reduce places removed 1533 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 1611 rules applied. Total rules applied 3145 place count 2247 transition count 4711
Reduce places removed 34 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 41 rules applied. Total rules applied 3186 place count 2213 transition count 4704
Reduce places removed 3 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 3 with 31 rules applied. Total rules applied 3217 place count 2210 transition count 4676
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 3245 place count 2182 transition count 4676
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 3245 place count 2182 transition count 4646
Deduced a syphon composed of 30 places in 77 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 3305 place count 2152 transition count 4646
Discarding 559 places :
Symmetric choice reduction at 5 with 559 rule applications. Total rules 3864 place count 1593 transition count 4087
Iterating global reduction 5 with 559 rules applied. Total rules applied 4423 place count 1593 transition count 4087
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4425 place count 1593 transition count 4085
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 234 Pre rules applied. Total rules applied 4425 place count 1593 transition count 3851
Deduced a syphon composed of 234 places in 23 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 6 with 468 rules applied. Total rules applied 4893 place count 1359 transition count 3851
Discarding 74 places :
Symmetric choice reduction at 6 with 74 rule applications. Total rules 4967 place count 1285 transition count 2776
Iterating global reduction 6 with 74 rules applied. Total rules applied 5041 place count 1285 transition count 2776
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 5061 place count 1285 transition count 2756
Performed 333 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 333 places in 2 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 7 with 666 rules applied. Total rules applied 5727 place count 952 transition count 2413
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 5734 place count 952 transition count 2406
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 5738 place count 948 transition count 2346
Iterating global reduction 8 with 4 rules applied. Total rules applied 5742 place count 948 transition count 2346
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -942
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 8 with 172 rules applied. Total rules applied 5914 place count 862 transition count 3288
Drop transitions removed 149 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 8 with 152 rules applied. Total rules applied 6066 place count 862 transition count 3136
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 6086 place count 842 transition count 2499
Iterating global reduction 9 with 20 rules applied. Total rules applied 6106 place count 842 transition count 2499
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 6121 place count 842 transition count 2484
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 6131 place count 837 transition count 2543
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 6134 place count 837 transition count 2540
Drop transitions removed 246 transitions
Redundant transition composition rules discarded 246 transitions
Iterating global reduction 11 with 246 rules applied. Total rules applied 6380 place count 837 transition count 2294
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 6390 place count 827 transition count 2116
Iterating global reduction 11 with 10 rules applied. Total rules applied 6400 place count 827 transition count 2116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 6407 place count 827 transition count 2109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 6411 place count 827 transition count 2105
Free-agglomeration rule applied 395 times with reduction of 184 identical transitions.
Iterating global reduction 12 with 395 rules applied. Total rules applied 6806 place count 827 transition count 1526
Reduce places removed 395 places and 0 transitions.
Drop transitions removed 469 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 480 transitions.
Graph (complete) has 1288 edges and 432 vertex of which 406 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 876 rules applied. Total rules applied 7682 place count 406 transition count 1046
Drop transitions removed 16 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 13 with 52 rules applied. Total rules applied 7734 place count 406 transition count 994
Discarding 62 places :
Symmetric choice reduction at 14 with 62 rule applications. Total rules 7796 place count 344 transition count 870
Iterating global reduction 14 with 62 rules applied. Total rules applied 7858 place count 344 transition count 870
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 14 with 75 rules applied. Total rules applied 7933 place count 344 transition count 795
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 1018 edges and 343 vertex of which 335 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 2 rules applied. Total rules applied 7935 place count 335 transition count 795
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 7951 place count 335 transition count 779
Discarding 17 places :
Symmetric choice reduction at 16 with 17 rule applications. Total rules 7968 place count 318 transition count 750
Iterating global reduction 16 with 17 rules applied. Total rules applied 7985 place count 318 transition count 750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 7987 place count 317 transition count 759
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 7994 place count 317 transition count 752
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 7995 place count 317 transition count 751
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 8000 place count 317 transition count 751
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 8002 place count 317 transition count 749
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 8003 place count 316 transition count 748
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (trivial) has 23 edges and 306 vertex of which 5 / 306 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 36 rules applied. Total rules applied 8039 place count 303 transition count 723
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 18 with 19 rules applied. Total rules applied 8058 place count 303 transition count 704
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 8062 place count 301 transition count 702
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 8069 place count 301 transition count 695
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 8071 place count 299 transition count 693
Iterating global reduction 20 with 2 rules applied. Total rules applied 8073 place count 299 transition count 693
Drop transitions removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 20 with 89 rules applied. Total rules applied 8162 place count 299 transition count 604
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 8164 place count 297 transition count 604
Discarding 31 places :
Symmetric choice reduction at 21 with 31 rule applications. Total rules 8195 place count 266 transition count 558
Iterating global reduction 21 with 31 rules applied. Total rules applied 8226 place count 266 transition count 558
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 8227 place count 266 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 8228 place count 265 transition count 557
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 8229 place count 265 transition count 557
Applied a total of 8229 rules in 1385 ms. Remains 265 /4375 variables (removed 4110) and now considering 557/6991 (removed 6434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1386 ms. Remains : 265/4375 places, 557/6991 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :1
FORMULA DLCround-PT-11b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 4456 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=318 )
FORMULA DLCround-PT-11b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 27644 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_11b
(NrP: 4375 NrTr: 6991 NrArc: 19673)

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

net check time: 0m 0.003sec

init dd package: 0m 2.742sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8935084 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101528 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.179sec

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-11b"
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-11b, 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-167814483200758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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