Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905979000487.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d2m64, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679356832036

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:00:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 00:00:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:00:34] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2023-03-21 00:00:34] [INFO ] Transformed 2398 places.
[2023-03-21 00:00:34] [INFO ] Transformed 1954 transitions.
[2023-03-21 00:00:34] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2187 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 146852 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{1=1, 3=1, 7=1, 8=1}
Probabilistic random walk after 146852 steps, saw 67329 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :4
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-21 00:00:38] [INFO ] Computed 6 place invariants in 52 ms
[2023-03-21 00:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 00:00:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 23 ms returned sat
[2023-03-21 00:00:39] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-21 00:00:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 00:00:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 46 ms returned sat
[2023-03-21 00:00:41] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :6
[2023-03-21 00:00:41] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-21 00:00:44] [INFO ] After 3167ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :6 sat :6
[2023-03-21 00:00:45] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 7 ms to minimize.
[2023-03-21 00:00:45] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2023-03-21 00:00:46] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 1 ms to minimize.
[2023-03-21 00:00:46] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 2 ms to minimize.
[2023-03-21 00:00:46] [INFO ] Deduced a trap composed of 155 places in 85 ms of which 7 ms to minimize.
[2023-03-21 00:00:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1243 ms
[2023-03-21 00:00:48] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 1 ms to minimize.
[2023-03-21 00:00:48] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 0 ms to minimize.
[2023-03-21 00:00:48] [INFO ] Deduced a trap composed of 253 places in 182 ms of which 1 ms to minimize.
[2023-03-21 00:00:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 909 ms
[2023-03-21 00:00:49] [INFO ] Deduced a trap composed of 204 places in 221 ms of which 1 ms to minimize.
[2023-03-21 00:00:49] [INFO ] Deduced a trap composed of 217 places in 196 ms of which 0 ms to minimize.
[2023-03-21 00:00:50] [INFO ] Deduced a trap composed of 252 places in 196 ms of which 0 ms to minimize.
[2023-03-21 00:00:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1227 ms
[2023-03-21 00:00:51] [INFO ] After 9746ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 4434 ms.
[2023-03-21 00:00:55] [INFO ] After 16202ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 348 ms.
Support contains 17 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.6 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 935 place count 284 transition count 601
Iterating global reduction 1 with 104 rules applied. Total rules applied 1039 place count 284 transition count 601
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1050 place count 284 transition count 590
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1128 place count 206 transition count 512
Iterating global reduction 2 with 78 rules applied. Total rules applied 1206 place count 206 transition count 512
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1238 place count 206 transition count 480
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1266 place count 178 transition count 446
Iterating global reduction 3 with 28 rules applied. Total rules applied 1294 place count 178 transition count 446
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1347 place count 178 transition count 393
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1354 place count 171 transition count 381
Iterating global reduction 4 with 7 rules applied. Total rules applied 1361 place count 171 transition count 381
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1368 place count 164 transition count 374
Iterating global reduction 4 with 7 rules applied. Total rules applied 1375 place count 164 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1379 place count 160 transition count 369
Iterating global reduction 4 with 4 rules applied. Total rules applied 1383 place count 160 transition count 369
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1386 place count 157 transition count 366
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 157 transition count 366
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1392 place count 154 transition count 363
Iterating global reduction 4 with 3 rules applied. Total rules applied 1395 place count 154 transition count 363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1396 place count 153 transition count 362
Iterating global reduction 4 with 1 rules applied. Total rules applied 1397 place count 153 transition count 362
Applied a total of 1397 rules in 183 ms. Remains 153 /414 variables (removed 261) and now considering 362/1954 (removed 1592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 153/414 places, 362/1954 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 446293 steps, run timeout after 3020 ms. (steps per millisecond=147 ) properties seen :{1=1, 2=1, 5=1}
Probabilistic random walk after 446293 steps, saw 199759 distinct states, run finished after 3021 ms. (steps per millisecond=147 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 362 rows 153 cols
[2023-03-21 00:01:00] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-21 00:01:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:01:00] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:01:00] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:01:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:01:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:01:00] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:00] [INFO ] State equation strengthened by 243 read => feed constraints.
[2023-03-21 00:01:00] [INFO ] After 159ms SMT Verify possible using 243 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:00] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2023-03-21 00:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-21 00:01:01] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2023-03-21 00:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-21 00:01:01] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-21 00:01:01] [INFO ] After 962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 118 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 362/362 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 234
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 133 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 133 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 133 transition count 220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 127 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 127 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 127 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 126 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 126 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 125 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 125 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 124 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 124 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 123 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 123 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 122 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 122 transition count 197
Applied a total of 71 rules in 40 ms. Remains 122 /153 variables (removed 31) and now considering 197/362 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 122/153 places, 197/362 transitions.
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 694478 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694478 steps, saw 286629 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 197 rows 122 cols
[2023-03-21 00:01:04] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-21 00:01:04] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-21 00:01:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:01:04] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:01:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:01:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:01:04] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-21 00:01:04] [INFO ] After 83ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:05] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-21 00:01:05] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-21 00:01:05] [INFO ] Invariant cache hit.
[2023-03-21 00:01:05] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-21 00:01:05] [INFO ] Invariant cache hit.
[2023-03-21 00:01:05] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-21 00:01:05] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-21 00:01:05] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 00:01:05] [INFO ] Invariant cache hit.
[2023-03-21 00:01:06] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 122/122 places, 197/197 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 122 transition count 191
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 117 transition count 191
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 117 transition count 174
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 100 transition count 174
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 90 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 89 transition count 175
Applied a total of 67 rules in 18 ms. Remains 89 /122 variables (removed 33) and now considering 175/197 (removed 22) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 175 rows 89 cols
[2023-03-21 00:01:06] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 00:01:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:01:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:01:06] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:01:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-21 00:01:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 00:01:06] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:06] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2023-03-21 00:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-21 00:01:06] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-21 00:01:06] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 00:01:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-21 00:01:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 197 transitions and 782 arcs took 3 ms.
[2023-03-21 00:01:06] [INFO ] Flatten gal took : 41 ms
Total runtime 33151 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d2m64
(NrP: 122 NrTr: 197 NrArc: 782)

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

net check time: 0m 0.000sec

init dd package: 0m 3.031sec


before gc: list nodes free: 1034035

after gc: idd nodes used:630789, unused:63369211; list nodes free:479824591
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 3142544 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098500 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 ReachabilityFireability -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.000sec

14280 41957 58864 63688 142370 218934 126634 258800 435311 377967 342319 640644 818968 412803 765025 1226744 982803 817026

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="SieveSingleMsgMbox-PT-d2m64"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d2m64, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905979000487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;