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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 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.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.2M 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-18b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678575744996

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-18b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 23:02:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 23:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:02:26] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-11 23:02:26] [INFO ] Transformed 4370 places.
[2023-03-11 23:02:26] [INFO ] Transformed 5037 transitions.
[2023-03-11 23:02:26] [INFO ] Found NUPN structural information;
[2023-03-11 23:02:26] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 257 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-18b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 15) seen :4
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-11 23:02:28] [INFO ] Computed 20 place invariants in 155 ms
[2023-03-11 23:02:29] [INFO ] After 1524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 23:02:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 36 ms returned sat
[2023-03-11 23:02:36] [INFO ] After 4424ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-11 23:02:36] [INFO ] Deduced a trap composed of 327 places in 376 ms of which 5 ms to minimize.
[2023-03-11 23:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 678 ms
[2023-03-11 23:02:37] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 2 ms to minimize.
[2023-03-11 23:02:38] [INFO ] Deduced a trap composed of 189 places in 339 ms of which 2 ms to minimize.
[2023-03-11 23:02:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1139 ms
[2023-03-11 23:02:41] [INFO ] Deduced a trap composed of 334 places in 2502 ms of which 3 ms to minimize.
[2023-03-11 23:02:43] [INFO ] Deduced a trap composed of 1624 places in 2409 ms of which 3 ms to minimize.
[2023-03-11 23:02:46] [INFO ] Deduced a trap composed of 1587 places in 2214 ms of which 2 ms to minimize.
[2023-03-11 23:02:48] [INFO ] Deduced a trap composed of 1540 places in 1990 ms of which 3 ms to minimize.
[2023-03-11 23:02:50] [INFO ] Deduced a trap composed of 1528 places in 1854 ms of which 2 ms to minimize.
[2023-03-11 23:02:52] [INFO ] Deduced a trap composed of 1492 places in 2063 ms of which 3 ms to minimize.
[2023-03-11 23:02:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 14093 ms
[2023-03-11 23:02:53] [INFO ] After 22295ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 861 ms.
[2023-03-11 23:02:54] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 167 ms.
Support contains 94 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4151 edges and 4370 vertex of which 110 / 4370 are part of one of the 18 SCC in 28 ms
Free SCC test removed 92 places
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 990 transitions
Trivial Post-agglo rules discarded 990 transitions
Performed 990 trivial Post agglomeration. Transition count delta: 990
Iterating post reduction 0 with 990 rules applied. Total rules applied 991 place count 4278 transition count 3936
Reduce places removed 990 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1013 rules applied. Total rules applied 2004 place count 3288 transition count 3913
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2027 place count 3265 transition count 3913
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 2027 place count 3265 transition count 3606
Deduced a syphon composed of 307 places in 3 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 2641 place count 2958 transition count 3606
Discarding 1708 places :
Symmetric choice reduction at 3 with 1708 rule applications. Total rules 4349 place count 1250 transition count 1898
Iterating global reduction 3 with 1708 rules applied. Total rules applied 6057 place count 1250 transition count 1898
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6057 place count 1250 transition count 1892
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 6069 place count 1244 transition count 1892
Discarding 249 places :
Symmetric choice reduction at 3 with 249 rule applications. Total rules 6318 place count 995 transition count 1643
Iterating global reduction 3 with 249 rules applied. Total rules applied 6567 place count 995 transition count 1643
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Iterating post reduction 3 with 225 rules applied. Total rules applied 6792 place count 995 transition count 1418
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6994 place count 894 transition count 1317
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 7030 place count 894 transition count 1281
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 7046 place count 878 transition count 1265
Iterating global reduction 5 with 16 rules applied. Total rules applied 7062 place count 878 transition count 1265
Free-agglomeration rule applied 657 times.
Iterating global reduction 5 with 657 rules applied. Total rules applied 7719 place count 878 transition count 608
Reduce places removed 657 places and 0 transitions.
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 5 with 909 rules applied. Total rules applied 8628 place count 221 transition count 356
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 8630 place count 221 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8631 place count 220 transition count 355
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t4358.t3676.t3677.t3655.t3656 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 87 edges and 218 vertex of which 32 / 218 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 4 rules applied. Total rules applied 8635 place count 202 transition count 352
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 34 rules applied. Total rules applied 8669 place count 201 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 8670 place count 200 transition count 319
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 8670 place count 200 transition count 301
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 8706 place count 182 transition count 301
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 8723 place count 182 transition count 284
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 8757 place count 165 transition count 267
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 8758 place count 165 transition count 266
Free-agglomeration rule applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 8776 place count 165 transition count 248
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 33 rules applied. Total rules applied 8809 place count 147 transition count 233
Applied a total of 8809 rules in 930 ms. Remains 147 /4370 variables (removed 4223) and now considering 233/5037 (removed 4804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 147/4370 places, 233/5037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 23:02:56] [INFO ] Flow matrix only has 219 transitions (discarded 14 similar events)
// Phase 1: matrix 219 rows 147 cols
[2023-03-11 23:02:56] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-11 23:02:56] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 23:02:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-11 23:02:56] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 23:02:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-11 23:02:56] [INFO ] After 62ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 23:02:56] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2023-03-11 23:02:56] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2023-03-11 23:02:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-11 23:02:56] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2023-03-11 23:02:57] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2023-03-11 23:02:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-11 23:02:57] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 23:02:57] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 233/233 transitions.
Graph (trivial) has 61 edges and 147 vertex of which 2 / 147 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 146 transition count 217
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 132 transition count 217
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 47 place count 114 transition count 199
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 114 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 114 transition count 198
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 98 place count 98 transition count 181
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 143 place count 98 transition count 136
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 154 place count 98 transition count 125
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 177 place count 86 transition count 114
Applied a total of 177 rules in 13 ms. Remains 86 /147 variables (removed 61) and now considering 114/233 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 86/147 places, 114/233 transitions.
Incomplete random walk after 10000 steps, including 328 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 114 rows 86 cols
[2023-03-11 23:02:57] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 23:02:57] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 23:02:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-11 23:02:57] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 23:02:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 23:02:57] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 23:02:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-11 23:02:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-11 23:02:57] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 23:02:57] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 23 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 114/114 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 86 transition count 105
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 77 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 71 transition count 99
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 71 transition count 99
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 57 place count 56 transition count 87
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 73 place count 56 transition count 71
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 56 transition count 63
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 99 place count 46 transition count 55
Applied a total of 99 rules in 9 ms. Remains 46 /86 variables (removed 40) and now considering 55/114 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 46/86 places, 55/114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5628 steps, run visited all 1 properties in 14 ms. (steps per millisecond=402 )
Probabilistic random walk after 5628 steps, saw 1949 distinct states, run finished after 14 ms. (steps per millisecond=402 ) properties seen :1
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 31020 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_18b
(NrP: 4370 NrTr: 5037 NrArc: 12657)

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

net check time: 0m 0.001sec

init dd package: 0m 2.756sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6345852 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100800 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.055sec

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

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