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.r522-tall-167987246800070.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 Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 31 16:48 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 Anderson-PT-12-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680855842807

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=Anderson-PT-12
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 08:24:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 08:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 08:24:04] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-04-07 08:24:04] [INFO ] Transformed 889 places.
[2023-04-07 08:24:04] [INFO ] Transformed 4152 transitions.
[2023-04-07 08:24:04] [INFO ] Found NUPN structural information;
[2023-04-07 08:24:04] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 14) seen :8
FORMULA Anderson-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4152 rows 889 cols
[2023-04-07 08:24:05] [INFO ] Computed 27 invariants in 80 ms
[2023-04-07 08:24:06] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 08:24:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 08:24:06] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 17 ms returned sat
[2023-04-07 08:24:12] [INFO ] After 5975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 08:24:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:14] [INFO ] After 2325ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 08:24:17] [INFO ] After 5078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2383 ms.
[2023-04-07 08:24:20] [INFO ] After 13866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 103 ms.
Support contains 83 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 99 Pre rules applied. Total rules applied 0 place count 889 transition count 4053
Deduced a syphon composed of 99 places in 5 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 790 transition count 4053
Discarding 226 places :
Symmetric choice reduction at 0 with 226 rule applications. Total rules 424 place count 564 transition count 1209
Iterating global reduction 0 with 226 rules applied. Total rules applied 650 place count 564 transition count 1209
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 690 place count 544 transition count 1189
Applied a total of 690 rules in 216 ms. Remains 544 /889 variables (removed 345) and now considering 1189/4152 (removed 2963) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 544/889 places, 1189/4152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1189 rows 544 cols
[2023-04-07 08:24:20] [INFO ] Computed 27 invariants in 26 ms
[2023-04-07 08:24:21] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 08:24:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 08:24:21] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 15 ms returned sat
[2023-04-07 08:24:22] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 08:24:22] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:23] [INFO ] After 832ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 08:24:23] [INFO ] Deduced a trap composed of 257 places in 246 ms of which 1 ms to minimize.
[2023-04-07 08:24:23] [INFO ] Deduced a trap composed of 272 places in 248 ms of which 0 ms to minimize.
[2023-04-07 08:24:24] [INFO ] Deduced a trap composed of 301 places in 232 ms of which 1 ms to minimize.
[2023-04-07 08:24:24] [INFO ] Deduced a trap composed of 285 places in 237 ms of which 1 ms to minimize.
[2023-04-07 08:24:24] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 1 ms to minimize.
[2023-04-07 08:24:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1605 ms
[2023-04-07 08:24:25] [INFO ] After 3181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-04-07 08:24:26] [INFO ] After 5138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 33 ms.
Support contains 69 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1189/1189 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 544 transition count 1188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 543 transition count 1188
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 540 transition count 1119
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 540 transition count 1119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 535 transition count 1114
Applied a total of 18 rules in 76 ms. Remains 535 /544 variables (removed 9) and now considering 1114/1189 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 535/544 places, 1114/1189 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 297652 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 297652 steps, saw 230126 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :2
FORMULA Anderson-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1114 rows 535 cols
[2023-04-07 08:24:29] [INFO ] Computed 27 invariants in 8 ms
[2023-04-07 08:24:30] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 08:24:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-04-07 08:24:30] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 21 ms returned sat
[2023-04-07 08:24:31] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 08:24:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:31] [INFO ] After 371ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 08:24:32] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-04-07 08:24:32] [INFO ] After 2321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Anderson-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 31 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 1114/1114 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 535 transition count 1109
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 530 transition count 1109
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 20 place count 520 transition count 923
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 520 transition count 923
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 508 transition count 911
Applied a total of 54 rules in 57 ms. Remains 508 /535 variables (removed 27) and now considering 911/1114 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 508/535 places, 911/1114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 845089 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 845089 steps, saw 646629 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 911 rows 508 cols
[2023-04-07 08:24:35] [INFO ] Computed 27 invariants in 18 ms
[2023-04-07 08:24:35] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 08:24:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-04-07 08:24:35] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 14 ms returned sat
[2023-04-07 08:24:36] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:36] [INFO ] After 425ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:36] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-04-07 08:24:36] [INFO ] After 1207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 911/911 transitions.
Applied a total of 0 rules in 36 ms. Remains 508 /508 variables (removed 0) and now considering 911/911 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 508/508 places, 911/911 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 911/911 transitions.
Applied a total of 0 rules in 19 ms. Remains 508 /508 variables (removed 0) and now considering 911/911 (removed 0) transitions.
[2023-04-07 08:24:36] [INFO ] Invariant cache hit.
[2023-04-07 08:24:37] [INFO ] Implicit Places using invariants in 582 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 585 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 507/508 places, 911/911 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 507 transition count 802
Reduce places removed 109 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 127 rules applied. Total rules applied 236 place count 398 transition count 784
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 254 place count 380 transition count 784
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 380 transition count 772
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 278 place count 368 transition count 772
Applied a total of 278 rules in 40 ms. Remains 368 /507 variables (removed 139) and now considering 772/911 (removed 139) transitions.
// Phase 1: matrix 772 rows 368 cols
[2023-04-07 08:24:37] [INFO ] Computed 26 invariants in 10 ms
[2023-04-07 08:24:37] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-04-07 08:24:37] [INFO ] Invariant cache hit.
[2023-04-07 08:24:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:39] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 368/508 places, 772/911 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2471 ms. Remains : 368/508 places, 772/911 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 894536 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 894536 steps, saw 670002 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 08:24:42] [INFO ] Invariant cache hit.
[2023-04-07 08:24:42] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 08:24:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 08:24:42] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 08:24:42] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:43] [INFO ] After 144ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:43] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 1 ms to minimize.
[2023-04-07 08:24:43] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 0 ms to minimize.
[2023-04-07 08:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-04-07 08:24:43] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-04-07 08:24:43] [INFO ] After 1471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 31 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 11 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 368/368 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 10 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-04-07 08:24:43] [INFO ] Invariant cache hit.
[2023-04-07 08:24:44] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-04-07 08:24:44] [INFO ] Invariant cache hit.
[2023-04-07 08:24:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 08:24:45] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-04-07 08:24:45] [INFO ] Redundant transitions in 49 ms returned []
[2023-04-07 08:24:45] [INFO ] Invariant cache hit.
[2023-04-07 08:24:46] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2307 ms. Remains : 368/368 places, 772/772 transitions.
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 130 Pre rules applied. Total rules applied 0 place count 368 transition count 642
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 238 transition count 642
Applied a total of 260 rules in 13 ms. Remains 238 /368 variables (removed 130) and now considering 642/772 (removed 130) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 642 rows 238 cols
[2023-04-07 08:24:46] [INFO ] Computed 26 invariants in 7 ms
[2023-04-07 08:24:46] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 08:24:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 08:24:46] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 9 ms returned sat
[2023-04-07 08:24:46] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:46] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-07 08:24:46] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 08:24:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 08:24:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 368 places, 772 transitions and 3052 arcs took 7 ms.
[2023-04-07 08:24:47] [INFO ] Flatten gal took : 93 ms
Total runtime 42903 ms.
There are residual formulas that ITS could not solve within timeout
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: Anderson_PT_12
(NrP: 368 NrTr: 772 NrArc: 3052)

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

net check time: 0m 0.000sec

init dd package: 0m 2.692sec


before gc: list nodes free: 315989

after gc: idd nodes used:452619, unused:63547381; list nodes free:260249995
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6628188 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105568 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.002sec

14059 32258 34876 46095 53573 54814 67964 63746 67691 72068 73173 75128 79746 80274 79766 78505 78708 81833 78932 79613 82401 79473 79326 80234 79154 79405 210839 274470 285806 303391 316811 324338 338186 349977 353803 366314 364003 374878 372158 373750 374376 375329 378650 377648 378142 380341 378190 378555 377831 377963 378421 377872 378185 378358 379039 378695 378257 379298 378403 392904 398693 398355 398451 399180 402084 408754 407451 409208 410583 410996 412884 416067 416420 415161 413648 413214 419984 413241 412993 415280 413489 416060 413570 415610 417440 416891 420481 425403 424892 429430 425110 425476 428210 425352 429097 431156 432490 430659 437733 430339 430727 430463 431728 432961 431742 430778 430572 430996 431394 432336 431258 433340 439232 438845 446627 439116 438736 439174 438910 439043 440969 440852 443696 441155 445777 441528 441270 449730 441662 443086 441515 443436 442134 441589 443762 443647 447571 446718 446383 446153 447218 446588 446414 447471 447015 446633 446468 448533 446504 447866 446768 453003 446775 446894 446977 449644 447101 447132 447449 447445 449841 453564 453274 449288 450513 449823 450043 450165 451066 450573 451688 450565 449621 450114 456889 450174 449837 450073 451870 450058 449981 453989 450180 453850 451203 453618 451378 454169 452841 460213 452102 452293 451800 452170 451742 451646 451739 452706 451778 451815 451762 451688 453507 451899 461868 452507 452147 453089 453214 453852 452394 453007 453321 452192 452486 452659 454570 452492 452579 452603 452359 452446 454010 452146 452904 455335 453131 452215 452790 452585 461739 452674 453005 452832 454282 456483 452759 452749 452670 452918 453443 452754 455056 453378 453143 453135 453052 453746 453516 452862 453557 454890 454315 453995 452749 452769 454616 452855 452931 452865 452963 453070 453324 453176 453028 453161 453318 453071 453283 453144 457513 453230 454222 452965 453437 453878 452948 452958 453052 455803 453017 454603 455763 453329 453451 453800 453084 453306 453781 454072 453363 458460 453007 454131 453149 453267 455764 453058 453429 453395 453216 453010 453119 453180 453119 453091 453985 453014 453030 2251540 2267148 2270533 2280518 2283286 2287705 2290783 2292325 2293210 2294417 2295188 2295174

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="Anderson-PT-12"
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 Anderson-PT-12, 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 r522-tall-167987246800070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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