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-167905978900421.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-d1m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 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 450K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679352406877

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:46:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 22:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:46:48] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-20 22:46:48] [INFO ] Transformed 1295 places.
[2023-03-20 22:46:48] [INFO ] Transformed 749 transitions.
[2023-03-20 22:46:48] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 22:46:48] [INFO ] Computed 6 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :2
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
[2023-03-20 22:46:49] [INFO ] Invariant cache hit.
[2023-03-20 22:46:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 22:46:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:49] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-20 22:46:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:46:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 22:46:50] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:50] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-20 22:46:50] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 22:46:50] [INFO ] [Nat]Added 587 Read/Feed constraints in 107 ms returned sat
[2023-03-20 22:46:50] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2023-03-20 22:46:50] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 1 ms to minimize.
[2023-03-20 22:46:51] [INFO ] Deduced a trap composed of 158 places in 111 ms of which 2 ms to minimize.
[2023-03-20 22:46:51] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 2 ms to minimize.
[2023-03-20 22:46:51] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 0 ms to minimize.
[2023-03-20 22:46:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1083 ms
[2023-03-20 22:46:51] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 166 ms.
[2023-03-20 22:46:52] [INFO ] Added : 29 causal constraints over 6 iterations in 562 ms. Result :sat
Minimization took 114 ms.
[2023-03-20 22:46:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 22:46:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:52] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-20 22:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:46:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 22:46:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:52] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-20 22:46:52] [INFO ] [Nat]Added 587 Read/Feed constraints in 146 ms returned sat
[2023-03-20 22:46:53] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2023-03-20 22:46:53] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2023-03-20 22:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-20 22:46:53] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 93 ms.
[2023-03-20 22:46:53] [INFO ] Added : 20 causal constraints over 4 iterations in 374 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 415 place count 136 transition count 180
Iterating global reduction 2 with 44 rules applied. Total rules applied 459 place count 136 transition count 180
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 474 place count 136 transition count 165
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 501 place count 109 transition count 136
Iterating global reduction 3 with 27 rules applied. Total rules applied 528 place count 109 transition count 136
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 544 place count 109 transition count 120
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 551 place count 102 transition count 111
Iterating global reduction 4 with 7 rules applied. Total rules applied 558 place count 102 transition count 111
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 565 place count 95 transition count 104
Iterating global reduction 4 with 7 rules applied. Total rules applied 572 place count 95 transition count 104
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 576 place count 91 transition count 99
Iterating global reduction 4 with 4 rules applied. Total rules applied 580 place count 91 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 582 place count 91 transition count 97
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 586 place count 87 transition count 93
Iterating global reduction 5 with 4 rules applied. Total rules applied 590 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 592 place count 85 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 594 place count 85 transition count 91
Applied a total of 594 rules in 122 ms. Remains 85 /259 variables (removed 174) and now considering 91/749 (removed 658) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 85/259 places, 91/749 transitions.
// Phase 1: matrix 91 rows 85 cols
[2023-03-20 22:46:54] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224071 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103562 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :0
[2023-03-20 22:46:55] [INFO ] Invariant cache hit.
[2023-03-20 22:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:46:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 22:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:46:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-20 22:46:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:46:55] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2023-03-20 22:46:55] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 7 ms.
[2023-03-20 22:46:55] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-20 22:46:55] [INFO ] Invariant cache hit.
[2023-03-20 22:46:56] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 22:46:56] [INFO ] Invariant cache hit.
[2023-03-20 22:46:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:46:56] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-20 22:46:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:46:56] [INFO ] Invariant cache hit.
[2023-03-20 22:46:56] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 85/85 places, 91/91 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15
[2023-03-20 22:46:56] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 996 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-20 22:46:56] [INFO ] Invariant cache hit.
[2023-03-20 22:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:46:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-20 22:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:46:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:56] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 22:46:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:46:56] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2023-03-20 22:46:56] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 8 ms.
[2023-03-20 22:46:56] [INFO ] Added : 18 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 85/85 places, 91/91 transitions.
[2023-03-20 22:46:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224423 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103427 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 1) seen :0
[2023-03-20 22:46:57] [INFO ] Invariant cache hit.
[2023-03-20 22:46:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 22:46:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:58] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-20 22:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:46:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:46:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 22:46:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:46:58] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2023-03-20 22:46:58] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 6 ms.
[2023-03-20 22:46:58] [INFO ] Added : 18 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-20 22:46:58] [INFO ] Invariant cache hit.
[2023-03-20 22:46:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 22:46:58] [INFO ] Invariant cache hit.
[2023-03-20 22:46:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 22:46:58] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 22:46:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:46:58] [INFO ] Invariant cache hit.
[2023-03-20 22:46:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 in 2344 ms.
[2023-03-20 22:46:58] [INFO ] Flatten gal took : 41 ms
[2023-03-20 22:46:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-20 22:46:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 91 transitions and 362 arcs took 1 ms.
Total runtime 10111 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d1m18
(NrP: 85 NrTr: 91 NrArc: 362)

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

net check time: 0m 0.000sec

init dd package: 0m 3.113sec


RS generation: 0m45.996sec


-> reachability set: #nodes 22808 (2.3e+04) #states 3,191,595,529 (9)



starting MCC model checker
--------------------------

checking: place_bound(p41)
normalized: place_bound(p41)

-> the formula is 1

FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 2951678 (3.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 158104376 124118987 282223363
used/not used/entry size/cache size: 56933794 10175070 16 1024MB
basic ops cache: hits/miss/sum: 33 3692 3725
used/not used/entry size/cache size: 11044 16766172 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 28978 22809 51787
used/not used/entry size/cache size: 22794 8365814 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64412883
1 2491548
2 177092
3 20969
4 2821
5 529
6 1417
7 200
8 368
9 55
>= 10 982

Total processing time: 0m52.415sec


BK_STOP 1679352471450

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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

11414 20118 42697 39585
iterations count:439340 (4827), effective:10306 (113)

initing FirstDep: 0m 0.000sec

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-d1m18"
export BK_EXAMINATION="UpperBounds"
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-d1m18, examination is UpperBounds"
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-167905978900421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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