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.r266-smll-167863540800326.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 NoC3x3-PT-7A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679004864841

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=NoC3x3-PT-7A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 22:14:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 22:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:14:28] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-16 22:14:28] [INFO ] Transformed 801 places.
[2023-03-16 22:14:28] [INFO ] Transformed 1544 transitions.
[2023-03-16 22:14:28] [INFO ] Found NUPN structural information;
[2023-03-16 22:14:28] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 12) seen :7
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 22:14:29] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2023-03-16 22:14:29] [INFO ] Computed 111 place invariants in 75 ms
[2023-03-16 22:14:30] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 22:14:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 127 ms returned sat
[2023-03-16 22:14:31] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-16 22:14:32] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 22:14:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-16 22:14:32] [INFO ] After 354ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 22:14:33] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 16 ms to minimize.
[2023-03-16 22:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-16 22:14:33] [INFO ] After 1150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-16 22:14:33] [INFO ] After 3030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 110 ms.
Support contains 43 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 670 edges and 801 vertex of which 56 / 801 are part of one of the 6 SCC in 7 ms
Free SCC test removed 50 places
Drop transitions removed 100 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 108 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 751 transition count 1327
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 749 transition count 1325
Discarding 166 places :
Symmetric choice reduction at 2 with 166 rule applications. Total rules 173 place count 583 transition count 1081
Ensure Unique test removed 37 places
Iterating global reduction 2 with 203 rules applied. Total rules applied 376 place count 546 transition count 1081
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 50 rules applied. Total rules applied 426 place count 546 transition count 1031
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 430 place count 542 transition count 1031
Performed 134 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 134 places in 5 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 698 place count 408 transition count 873
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 781 place count 408 transition count 790
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 803 place count 397 transition count 775
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 811 place count 397 transition count 767
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 839 place count 383 transition count 775
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 841 place count 383 transition count 773
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 7 with 130 rules applied. Total rules applied 971 place count 383 transition count 643
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 11 rules applied. Total rules applied 982 place count 374 transition count 641
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 985 place count 372 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 986 place count 371 transition count 640
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 986 place count 371 transition count 632
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 1002 place count 363 transition count 632
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1006 place count 361 transition count 630
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1008 place count 360 transition count 630
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1011 place count 360 transition count 627
Free-agglomeration rule applied 50 times with reduction of 22 identical transitions.
Iterating global reduction 10 with 50 rules applied. Total rules applied 1061 place count 360 transition count 555
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 78 rules applied. Total rules applied 1139 place count 310 transition count 527
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 1151 place count 310 transition count 515
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 1154 place count 310 transition count 512
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1160 place count 307 transition count 509
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 12 with 21 rules applied. Total rules applied 1181 place count 307 transition count 535
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1208 place count 286 transition count 529
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 13 with 26 rules applied. Total rules applied 1234 place count 286 transition count 503
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 13 with 30 rules applied. Total rules applied 1264 place count 286 transition count 503
Applied a total of 1264 rules in 509 ms. Remains 286 /801 variables (removed 515) and now considering 503/1437 (removed 934) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 286/801 places, 503/1437 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :3
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 22:14:34] [INFO ] Flow matrix only has 499 transitions (discarded 4 similar events)
// Phase 1: matrix 499 rows 286 cols
[2023-03-16 22:14:34] [INFO ] Computed 65 place invariants in 20 ms
[2023-03-16 22:14:34] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 22:14:34] [INFO ] [Nat]Absence check using 59 positive place invariants in 23 ms returned sat
[2023-03-16 22:14:34] [INFO ] [Nat]Absence check using 59 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-16 22:14:35] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 22:14:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 22:14:35] [INFO ] After 48ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 22:14:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2023-03-16 22:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-16 22:14:35] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-16 22:14:35] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 13 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 503/503 transitions.
Graph (trivial) has 117 edges and 286 vertex of which 18 / 286 are part of one of the 4 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 24 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 36 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 272 transition count 465
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 270 transition count 465
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 15 place count 260 transition count 451
Ensure Unique test removed 5 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 255 transition count 451
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 0 with 11 rules applied. Total rules applied 41 place count 255 transition count 440
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 252 transition count 440
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 249 transition count 437
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 246 transition count 438
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 246 transition count 436
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 246 transition count 430
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 242 transition count 425
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 242 transition count 432
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 76 place count 240 transition count 431
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 240 transition count 427
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 92 place count 240 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 240 transition count 425
Applied a total of 94 rules in 105 ms. Remains 240 /286 variables (removed 46) and now considering 425/503 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 240/286 places, 425/503 transitions.
Finished random walk after 8772 steps, including 2 resets, run visited all 1 properties in 45 ms. (steps per millisecond=194 )
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7142 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: NoC3x3_PT_7A
(NrP: 801 NrTr: 1544 NrArc: 4519)

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

net check time: 0m 0.001sec

init dd package: 0m 3.470sec


before gc: list nodes free: 1838233

after gc: idd nodes used:123249, unused:63876751; list nodes free:278362146

before gc: list nodes free: 1819322

after gc: idd nodes used:230365, unused:63769635; list nodes free:284175400

before gc: list nodes free: 826162

after gc: idd nodes used:209153, unused:63790847; list nodes free:284271221
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6258980 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099620 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.013sec

6970 27367 36897 40271 41962 72280 85220 73996 155619 124828 163918 168112 204672 189941 220187 230673 216695 220950 205730 192726 226179 272650 299924

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="NoC3x3-PT-7A"
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 NoC3x3-PT-7A, 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 r266-smll-167863540800326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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