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.r427-tajo-167905979700477.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 smartxred
Input is SieveSingleMsgMbox-PT-d2m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979700477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679388793660

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 08:53:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 08:53:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 08:53:15] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-21 08:53:15] [INFO ] Transformed 2398 places.
[2023-03-21 08:53:15] [INFO ] Transformed 1954 transitions.
[2023-03-21 08:53:15] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1984 places in 19 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-21 08:53:15] [INFO ] Computed 6 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
[2023-03-21 08:53:15] [INFO ] Invariant cache hit.
[2023-03-21 08:53:16] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-21 08:53:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-21 08:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:16] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-21 08:53:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:53:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-21 08:53:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:16] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-21 08:53:17] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-21 08:53:17] [INFO ] [Nat]Added 1674 Read/Feed constraints in 368 ms returned sat
[2023-03-21 08:53:17] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 4 ms to minimize.
[2023-03-21 08:53:18] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 1 ms to minimize.
[2023-03-21 08:53:18] [INFO ] Deduced a trap composed of 191 places in 243 ms of which 1 ms to minimize.
[2023-03-21 08:53:19] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 2 ms to minimize.
[2023-03-21 08:53:19] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 1 ms to minimize.
[2023-03-21 08:53:19] [INFO ] Deduced a trap composed of 219 places in 215 ms of which 0 ms to minimize.
[2023-03-21 08:53:20] [INFO ] Deduced a trap composed of 234 places in 397 ms of which 1 ms to minimize.
[2023-03-21 08:53:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3222 ms
[2023-03-21 08:53:21] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 646 ms.
[2023-03-21 08:53:21] [INFO ] Added : 5 causal constraints over 1 iterations in 799 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 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.7 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 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1169 place count 178 transition count 271
Iterating global reduction 2 with 92 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1335 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1374 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1398 place count 139 transition count 158
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1407 place count 130 transition count 145
Iterating global reduction 4 with 9 rules applied. Total rules applied 1416 place count 130 transition count 145
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1425 place count 121 transition count 136
Iterating global reduction 4 with 9 rules applied. Total rules applied 1434 place count 121 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1439 place count 116 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 1444 place count 116 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1446 place count 116 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1451 place count 111 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1456 place count 111 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1459 place count 108 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 1462 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1463 place count 107 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 1464 place count 107 transition count 119
Applied a total of 1464 rules in 142 ms. Remains 107 /414 variables (removed 307) and now considering 119/1954 (removed 1835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 107/414 places, 119/1954 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-21 08:53:21] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224557 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103171 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
[2023-03-21 08:53:23] [INFO ] Invariant cache hit.
[2023-03-21 08:53:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:53:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 08:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-21 08:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:53:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:53:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 08:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:23] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-21 08:53:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 08:53:23] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2023-03-21 08:53:23] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2023-03-21 08:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-21 08:53:23] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 14 ms.
[2023-03-21 08:53:23] [INFO ] Added : 14 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-21 08:53:23] [INFO ] Invariant cache hit.
[2023-03-21 08:53:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-21 08:53:23] [INFO ] Invariant cache hit.
[2023-03-21 08:53:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 08:53:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-21 08:53:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 08:53:24] [INFO ] Invariant cache hit.
[2023-03-21 08:53:24] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 107/107 places, 119/119 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
[2023-03-21 08:53:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-21 08:53:24] [INFO ] Invariant cache hit.
[2023-03-21 08:53:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:53:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-21 08:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:24] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-21 08:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:53:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:53:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 08:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:24] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-21 08:53:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 08:53:24] [INFO ] [Nat]Added 44 Read/Feed constraints in 13 ms returned sat
[2023-03-21 08:53:24] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2023-03-21 08:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-21 08:53:24] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 16 ms.
[2023-03-21 08:53:24] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [486] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/107 places, 119/119 transitions.
[2023-03-21 08:53:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224838 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103544 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 1) seen :0
[2023-03-21 08:53:25] [INFO ] Invariant cache hit.
[2023-03-21 08:53:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 08:53:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 08:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-21 08:53:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:53:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 08:53:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 08:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:53:26] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-21 08:53:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 08:53:26] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2023-03-21 08:53:26] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-21 08:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-21 08:53:26] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 11 ms.
[2023-03-21 08:53:26] [INFO ] Added : 14 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [486] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-21 08:53:26] [INFO ] Invariant cache hit.
[2023-03-21 08:53:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-21 08:53:26] [INFO ] Invariant cache hit.
[2023-03-21 08:53:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 08:53:26] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-21 08:53:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 08:53:26] [INFO ] Invariant cache hit.
[2023-03-21 08:53:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 in 2524 ms.
[2023-03-21 08:53:26] [INFO ] Flatten gal took : 57 ms
[2023-03-21 08:53:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 12 ms.
[2023-03-21 08:53:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 119 transitions and 474 arcs took 5 ms.
Total runtime 11804 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SieveSingleMsgMbox (PT), instance d2m36
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 107 places, 119 transitions, 474 arcs.
Final Score: 1487.367
Took : 9 seconds
Bounds file is: UpperBounds.xml
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679388888677

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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-d2m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r427-tajo-167905979700477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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