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

About the Execution of Marcie+red for FlexibleBarrier-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9768.560 3600000.00 3685307.00 9867.10 TTFTTFFFTFFFFTTT 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.r170-tall-167838857400550.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 FlexibleBarrier-PT-16b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857400550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 945K 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678570332080

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=FlexibleBarrier-PT-16b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 21:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 21:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:32:13] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-11 21:32:13] [INFO ] Transformed 3472 places.
[2023-03-11 21:32:13] [INFO ] Transformed 4001 transitions.
[2023-03-11 21:32:13] [INFO ] Found NUPN structural information;
[2023-03-11 21:32:13] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 91 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 10) seen :2
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 4001 rows 3472 cols
[2023-03-11 21:32:15] [INFO ] Computed 18 place invariants in 108 ms
[2023-03-11 21:32:16] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 21:32:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 32 ms returned sat
[2023-03-11 21:32:20] [INFO ] After 3146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 21:32:22] [INFO ] Deduced a trap composed of 28 places in 2004 ms of which 13 ms to minimize.
[2023-03-11 21:32:24] [INFO ] Deduced a trap composed of 371 places in 1908 ms of which 3 ms to minimize.
[2023-03-11 21:32:27] [INFO ] Deduced a trap composed of 243 places in 1930 ms of which 3 ms to minimize.
[2023-03-11 21:32:27] [INFO ] Deduced a trap composed of 384 places in 271 ms of which 2 ms to minimize.
[2023-03-11 21:32:27] [INFO ] Deduced a trap composed of 92 places in 251 ms of which 0 ms to minimize.
[2023-03-11 21:32:28] [INFO ] Deduced a trap composed of 303 places in 374 ms of which 1 ms to minimize.
[2023-03-11 21:32:28] [INFO ] Deduced a trap composed of 423 places in 191 ms of which 0 ms to minimize.
[2023-03-11 21:32:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7925 ms
[2023-03-11 21:32:30] [INFO ] Deduced a trap composed of 295 places in 1781 ms of which 3 ms to minimize.
[2023-03-11 21:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2019 ms
[2023-03-11 21:32:32] [INFO ] Deduced a trap composed of 286 places in 1817 ms of which 5 ms to minimize.
[2023-03-11 21:32:34] [INFO ] Deduced a trap composed of 1204 places in 1568 ms of which 2 ms to minimize.
[2023-03-11 21:32:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3758 ms
[2023-03-11 21:32:37] [INFO ] Deduced a trap composed of 1265 places in 1932 ms of which 2 ms to minimize.
[2023-03-11 21:32:39] [INFO ] Deduced a trap composed of 1190 places in 1883 ms of which 2 ms to minimize.
[2023-03-11 21:32:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4188 ms
[2023-03-11 21:32:39] [INFO ] After 22364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1104 ms.
[2023-03-11 21:32:41] [INFO ] After 24822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 273 ms.
Support contains 103 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 3241 edges and 3472 vertex of which 84 / 3472 are part of one of the 14 SCC in 17 ms
Free SCC test removed 70 places
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions removed 803 transitions
Trivial Post-agglo rules discarded 803 transitions
Performed 803 trivial Post agglomeration. Transition count delta: 803
Iterating post reduction 0 with 803 rules applied. Total rules applied 804 place count 3402 transition count 3114
Reduce places removed 803 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 832 rules applied. Total rules applied 1636 place count 2599 transition count 3085
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1665 place count 2570 transition count 3085
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 1665 place count 2570 transition count 2880
Deduced a syphon composed of 205 places in 5 ms
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 3 with 410 rules applied. Total rules applied 2075 place count 2365 transition count 2880
Discarding 1309 places :
Symmetric choice reduction at 3 with 1309 rule applications. Total rules 3384 place count 1056 transition count 1571
Iterating global reduction 3 with 1309 rules applied. Total rules applied 4693 place count 1056 transition count 1571
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4693 place count 1056 transition count 1567
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4701 place count 1052 transition count 1567
Discarding 179 places :
Symmetric choice reduction at 3 with 179 rule applications. Total rules 4880 place count 873 transition count 1388
Iterating global reduction 3 with 179 rules applied. Total rules applied 5059 place count 873 transition count 1388
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Iterating post reduction 3 with 159 rules applied. Total rules applied 5218 place count 873 transition count 1229
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 5414 place count 775 transition count 1131
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 5442 place count 775 transition count 1103
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 5455 place count 762 transition count 1090
Iterating global reduction 5 with 13 rules applied. Total rules applied 5468 place count 762 transition count 1090
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 5 with 2 rules applied. Total rules applied 5470 place count 761 transition count 1090
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 5474 place count 761 transition count 1086
Free-agglomeration rule applied 535 times.
Iterating global reduction 5 with 535 rules applied. Total rules applied 6009 place count 761 transition count 551
Reduce places removed 535 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 679 rules applied. Total rules applied 6688 place count 226 transition count 407
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 6726 place count 226 transition count 369
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 6729 place count 226 transition count 369
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6730 place count 226 transition count 368
Applied a total of 6730 rules in 913 ms. Remains 226 /3472 variables (removed 3246) and now considering 368/4001 (removed 3633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 914 ms. Remains : 226/3472 places, 368/4001 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :5
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-11 21:32:42] [INFO ] Flow matrix only has 349 transitions (discarded 19 similar events)
// Phase 1: matrix 349 rows 226 cols
[2023-03-11 21:32:42] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-11 21:32:42] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 21:32:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-11 21:32:42] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 21:32:42] [INFO ] State equation strengthened by 188 read => feed constraints.
[2023-03-11 21:32:42] [INFO ] After 43ms SMT Verify possible using 188 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 21:32:42] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-11 21:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-11 21:32:42] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 21:32:42] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 12 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 368/368 transitions.
Graph (trivial) has 125 edges and 226 vertex of which 6 / 226 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 222 transition count 330
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 190 transition count 330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 65 place count 190 transition count 329
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 189 transition count 329
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 189 transition count 328
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 123 place count 134 transition count 273
Iterating global reduction 3 with 55 rules applied. Total rules applied 178 place count 134 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 134 transition count 270
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 219 place count 115 transition count 251
Drop transitions removed 69 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 291 place count 115 transition count 179
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 113 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 113 transition count 177
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 308 place count 113 transition count 164
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 331 place count 100 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 332 place count 100 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 333 place count 99 transition count 153
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 79 edges and 98 vertex of which 32 / 98 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 336 place count 82 transition count 152
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 369 place count 81 transition count 120
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 369 place count 81 transition count 105
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 399 place count 66 transition count 105
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 414 place count 66 transition count 90
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 444 place count 51 transition count 75
Free-agglomeration rule applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 459 place count 51 transition count 60
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 507 place count 26 transition count 37
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 513 place count 26 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 515 place count 25 transition count 30
Applied a total of 515 rules in 50 ms. Remains 25 /226 variables (removed 201) and now considering 30/368 (removed 338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 25/226 places, 30/368 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=87 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29569 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: FlexibleBarrier_PT_16b
(NrP: 3472 NrTr: 4001 NrArc: 10043)

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

net check time: 0m 0.002sec

init dd package: 0m 2.786sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6382228 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100388 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.045sec

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="FlexibleBarrier-PT-16b"
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 FlexibleBarrier-PT-16b, 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 r170-tall-167838857400550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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