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.r425-tajo-167905978300477.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 ltsminxred
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 r425-tajo-167905978300477
=====================================================================

--------------------
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 1679318719643

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:25:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 13:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:25:21] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-20 13:25:21] [INFO ] Transformed 2398 places.
[2023-03-20 13:25:21] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:25:21] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1984 places in 20 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-20 13:25:21] [INFO ] Computed 6 place invariants in 80 ms
Incomplete random walk after 10000 steps, including 2195 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
[2023-03-20 13:25:22] [INFO ] Invariant cache hit.
[2023-03-20 13:25:22] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-20 13:25:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:22] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-20 13:25:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:25:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:25:22] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:23] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-20 13:25:23] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 13:25:23] [INFO ] [Nat]Added 1674 Read/Feed constraints in 313 ms returned sat
[2023-03-20 13:25:23] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 3 ms to minimize.
[2023-03-20 13:25:24] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 1 ms to minimize.
[2023-03-20 13:25:24] [INFO ] Deduced a trap composed of 191 places in 245 ms of which 2 ms to minimize.
[2023-03-20 13:25:25] [INFO ] Deduced a trap composed of 97 places in 292 ms of which 2 ms to minimize.
[2023-03-20 13:25:25] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 2 ms to minimize.
[2023-03-20 13:25:25] [INFO ] Deduced a trap composed of 219 places in 236 ms of which 1 ms to minimize.
[2023-03-20 13:25:26] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 2 ms to minimize.
[2023-03-20 13:25:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2795 ms
[2023-03-20 13:25:26] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 374 ms.
[2023-03-20 13:25:27] [INFO ] Added : 24 causal constraints over 5 iterations in 1331 ms. Result :sat
Minimization took 36 ms.
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.11 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 161 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 161 ms. Remains : 107/414 places, 119/1954 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-20 13:25:27] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 224758 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103552 resets, run finished after 516 ms. (steps per millisecond=1937 ) properties (out of 1) seen :0
[2023-03-20 13:25:29] [INFO ] Invariant cache hit.
[2023-03-20 13:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-20 13:25:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:25:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-20 13:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 13:25:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:25:29] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2023-03-20 13:25:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2023-03-20 13:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 13:25:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 13:25:29] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 27 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 7 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 13:25:29] [INFO ] Invariant cache hit.
[2023-03-20 13:25:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 13:25:30] [INFO ] Invariant cache hit.
[2023-03-20 13:25:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:25:30] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-20 13:25:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:25:30] [INFO ] Invariant cache hit.
[2023-03-20 13:25:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 107/107 places, 119/119 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
[2023-03-20 13:25:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 13:25:30] [INFO ] Invariant cache hit.
[2023-03-20 13:25:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 13:25:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 13:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-20 13:25:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:25:30] [INFO ] [Nat]Added 44 Read/Feed constraints in 4 ms returned sat
[2023-03-20 13:25:30] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2023-03-20 13:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-20 13:25:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-20 13:25:30] [INFO ] Added : 14 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 19 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 5 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-20 13:25:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224112 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103299 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
[2023-03-20 13:25:32] [INFO ] Invariant cache hit.
[2023-03-20 13:25:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:25:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 13:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:25:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:25:32] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-20 13:25:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:25:32] [INFO ] [Nat]Added 44 Read/Feed constraints in 5 ms returned sat
[2023-03-20 13:25:32] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-20 13:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-20 13:25:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 13:25:32] [INFO ] Added : 14 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 25 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 8 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 8 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-20 13:25:32] [INFO ] Invariant cache hit.
[2023-03-20 13:25:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 13:25:32] [INFO ] Invariant cache hit.
[2023-03-20 13:25:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 13:25:32] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 13:25:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:25:32] [INFO ] Invariant cache hit.
[2023-03-20 13:25:32] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 in 2536 ms.
[2023-03-20 13:25:33] [INFO ] Flatten gal took : 43 ms
[2023-03-20 13:25:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 13 ms.
[2023-03-20 13:25:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 119 transitions and 474 arcs took 2 ms.
Total runtime 11775 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/554/ub_0_
FORMULA SieveSingleMsgMbox-PT-d2m36-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679319254450

--------------------
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
mcc2023
ub formula name SieveSingleMsgMbox-PT-d2m36-UpperBounds-04
ub formula formula --maxsum=/tmp/554/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 107 places, 119 transitions and 474 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d2m36 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 119->117 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 107; there are 117 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 10141088 group checks and 0 next state calls
pnml2lts-sym: reachability took 520.380 real 2075.120 user 4.400 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.060 real 0.250 user 0.000 sys
pnml2lts-sym: state space has 16049403360124 states, 288525 nodes
pnml2lts-sym: Maximum sum of /tmp/554/ub_0_ is: 0
pnml2lts-sym: group_next: 11255 nodes total
pnml2lts-sym: group_explored: 16790 nodes, 26419 short vectors total
pnml2lts-sym: max token count: 36

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="ltsminxred"
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 ltsminxred"
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 r425-tajo-167905978300477"
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 ;