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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 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 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-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679317032665

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-d1m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:57:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 12:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:57:14] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-20 12:57:14] [INFO ] Transformed 1295 places.
[2023-03-20 12:57:14] [INFO ] Transformed 749 transitions.
[2023-03-20 12:57:14] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 12:57:14] [INFO ] Computed 6 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 961 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1012 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 999 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
[2023-03-20 12:57:15] [INFO ] Invariant cache hit.
[2023-03-20 12:57:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 12:57:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:15] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-20 12:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:15] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-20 12:57:15] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 12:57:15] [INFO ] [Nat]Added 587 Read/Feed constraints in 91 ms returned sat
[2023-03-20 12:57:16] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 142 ms.
[2023-03-20 12:57:16] [INFO ] Added : 12 causal constraints over 3 iterations in 362 ms. Result :sat
Minimization took 328 ms.
[2023-03-20 12:57:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 12:57:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:16] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-20 12:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:17] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-20 12:57:17] [INFO ] [Nat]Added 587 Read/Feed constraints in 156 ms returned sat
[2023-03-20 12:57:17] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 4 ms to minimize.
[2023-03-20 12:57:17] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
[2023-03-20 12:57:17] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 4 ms to minimize.
[2023-03-20 12:57:17] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 2 ms to minimize.
[2023-03-20 12:57:17] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 2 ms to minimize.
[2023-03-20 12:57:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 568 ms
[2023-03-20 12:57:17] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 79 ms.
[2023-03-20 12:57:18] [INFO ] Added : 23 causal constraints over 5 iterations in 320 ms. Result :sat
Minimization took 189 ms.
[2023-03-20 12:57:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:18] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-20 12:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-20 12:57:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 12:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:19] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-20 12:57:19] [INFO ] [Nat]Added 587 Read/Feed constraints in 134 ms returned sat
[2023-03-20 12:57:19] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 1 ms to minimize.
[2023-03-20 12:57:19] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 1 ms to minimize.
[2023-03-20 12:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-20 12:57:19] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 81 ms.
[2023-03-20 12:57:20] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 1 ms to minimize.
[2023-03-20 12:57:20] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 1 ms to minimize.
[2023-03-20 12:57:20] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 1 ms to minimize.
[2023-03-20 12:57:20] [INFO ] Deduced a trap composed of 141 places in 91 ms of which 0 ms to minimize.
[2023-03-20 12:57:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 814 ms
[2023-03-20 12:57:21] [INFO ] Added : 28 causal constraints over 7 iterations in 1373 ms. Result :sat
Minimization took 187 ms.
[2023-03-20 12:57:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:21] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:21] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-20 12:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:21] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-20 12:57:21] [INFO ] [Nat]Added 587 Read/Feed constraints in 119 ms returned sat
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 0 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 0 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 0 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 95 places in 44 ms of which 1 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 0 ms to minimize.
[2023-03-20 12:57:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 808 ms
[2023-03-20 12:57:22] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 62 ms.
[2023-03-20 12:57:23] [INFO ] Added : 26 causal constraints over 6 iterations in 334 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [91, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 301 place count 183 transition count 247
Iterating global reduction 1 with 58 rules applied. Total rules applied 359 place count 183 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 365 place count 183 transition count 241
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 408 place count 140 transition count 198
Iterating global reduction 2 with 43 rules applied. Total rules applied 451 place count 140 transition count 198
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 466 place count 140 transition count 183
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 490 place count 116 transition count 157
Iterating global reduction 3 with 24 rules applied. Total rules applied 514 place count 116 transition count 157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 534 place count 116 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 540 place count 110 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 546 place count 110 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 552 place count 104 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 558 place count 104 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 560 place count 102 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 562 place count 102 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 564 place count 100 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 566 place count 100 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 568 place count 98 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 570 place count 98 transition count 116
Applied a total of 570 rules in 82 ms. Remains 98 /259 variables (removed 161) and now considering 116/749 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 98/259 places, 116/749 transitions.
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 12:57:23] [INFO ] Computed 4 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 224635 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103460 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103406 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103160 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103061 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 4) seen :0
[2023-03-20 12:57:26] [INFO ] Invariant cache hit.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-20 12:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-20 12:57:27] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:27] [INFO ] [Nat]Added 52 Read/Feed constraints in 11 ms returned sat
[2023-03-20 12:57:27] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 12:57:27] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 45 ms.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-20 12:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-20 12:57:27] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-20 12:57:27] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 21 ms.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-20 12:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Added 52 Read/Feed constraints in 10 ms returned sat
[2023-03-20 12:57:27] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 6 ms.
[2023-03-20 12:57:27] [INFO ] Added : 19 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 41 ms.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-20 12:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 12:57:27] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-20 12:57:27] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2023-03-20 12:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-20 12:57:28] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-20 12:57:28] [INFO ] Added : 19 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [64, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-20 12:57:28] [INFO ] Invariant cache hit.
[2023-03-20 12:57:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:57:28] [INFO ] Invariant cache hit.
[2023-03-20 12:57:28] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:29] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
[2023-03-20 12:57:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 12:57:29] [INFO ] Invariant cache hit.
[2023-03-20 12:57:29] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 98/98 places, 116/116 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
[2023-03-20 12:57:29] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-20 12:57:29] [INFO ] Invariant cache hit.
[2023-03-20 12:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 12:57:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-20 12:57:30] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:30] [INFO ] [Nat]Added 52 Read/Feed constraints in 10 ms returned sat
[2023-03-20 12:57:30] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-20 12:57:30] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 92 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 89 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 87 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 36 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 77 transition count 81
Applied a total of 46 rules in 33 ms. Remains 77 /98 variables (removed 21) and now considering 81/116 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 77/98 places, 81/116 transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-20 12:57:30] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224363 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103462 resets, run finished after 402 ms. (steps per millisecond=2487 ) properties (out of 1) seen :0
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-20 12:57:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:57:31] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:57:31] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 5 ms.
[2023-03-20 12:57:31] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:57:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-20 12:57:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 77/77 places, 81/81 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 in 2166 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 12:57:31] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2248 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 1049 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-20 12:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-20 12:57:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:32] [INFO ] [Nat]Added 52 Read/Feed constraints in 14 ms returned sat
[2023-03-20 12:57:32] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 12:57:32] [INFO ] Added : 14 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 93 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 90 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 84 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 84 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 82 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Applied a total of 44 rules in 30 ms. Remains 78 /98 variables (removed 20) and now considering 82/116 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 78/98 places, 82/116 transitions.
// Phase 1: matrix 82 rows 78 cols
[2023-03-20 12:57:32] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224140 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103736 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 1) seen :0
[2023-03-20 12:57:33] [INFO ] Invariant cache hit.
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 12:57:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:57:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:57:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 26 ms returned sat
[2023-03-20 12:57:33] [INFO ] Computed and/alt/rep : 20/47/20 causal constraints (skipped 61 transitions) in 7 ms.
[2023-03-20 12:57:33] [INFO ] Added : 16 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-20 12:57:33] [INFO ] Invariant cache hit.
[2023-03-20 12:57:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 12:57:33] [INFO ] Invariant cache hit.
[2023-03-20 12:57:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 12:57:34] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-20 12:57:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:57:34] [INFO ] Invariant cache hit.
[2023-03-20 12:57:34] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 in 2189 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 12:57:34] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1027 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-20 12:57:34] [INFO ] Invariant cache hit.
[2023-03-20 12:57:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:34] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-20 12:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-20 12:57:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 12:57:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:34] [INFO ] [Nat]Added 52 Read/Feed constraints in 36 ms returned sat
[2023-03-20 12:57:34] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 21 ms.
[2023-03-20 12:57:34] [INFO ] Added : 19 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 93 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 93 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 93 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 92 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 92 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 92 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 91 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 91 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 90 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 89 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 89 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 88 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 88 transition count 93
Applied a total of 25 rules in 36 ms. Remains 88 /98 variables (removed 10) and now considering 93/116 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 88/98 places, 93/116 transitions.
// Phase 1: matrix 93 rows 88 cols
[2023-03-20 12:57:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223954 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103130 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :0
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-20 12:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-20 12:57:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:57:36] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2023-03-20 12:57:36] [INFO ] Computed and/alt/rep : 24/53/24 causal constraints (skipped 68 transitions) in 7 ms.
[2023-03-20 12:57:36] [INFO ] Added : 20 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 93/93 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 88/88 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:36] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:57:36] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-20 12:57:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 88/88 places, 93/93 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 in 2545 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
// Phase 1: matrix 116 rows 98 cols
[2023-03-20 12:57:36] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 983 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:36] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-20 12:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 12:57:36] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:57:36] [INFO ] [Nat]Added 52 Read/Feed constraints in 13 ms returned sat
[2023-03-20 12:57:36] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2023-03-20 12:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-20 12:57:36] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-20 12:57:37] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 95 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 91 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 90 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 90 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 89 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 89 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 88 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 85 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 83 transition count 96
Applied a total of 33 rules in 24 ms. Remains 83 /98 variables (removed 15) and now considering 96/116 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 83/98 places, 96/116 transitions.
// Phase 1: matrix 96 rows 83 cols
[2023-03-20 12:57:37] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224395 resets, run finished after 1240 ms. (steps per millisecond=806 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103146 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 1) seen :0
[2023-03-20 12:57:38] [INFO ] Invariant cache hit.
[2023-03-20 12:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:57:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:38] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-20 12:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-20 12:57:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 12:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:38] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 12:57:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:57:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-20 12:57:38] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 6 ms.
[2023-03-20 12:57:38] [INFO ] Added : 17 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:57:39] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-20 12:57:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 in 2695 ms.
[2023-03-20 12:57:39] [INFO ] Flatten gal took : 44 ms
[2023-03-20 12:57:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 12:57:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 116 transitions and 461 arcs took 2 ms.
Total runtime 25252 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/710/ub_0_ --maxsum=/tmp/710/ub_1_ --maxsum=/tmp/710/ub_2_ --maxsum=/tmp/710/ub_3_
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 8579336 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16094244 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-UpperBounds-13

BK_STOP 1679320631051

--------------------
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-d1m64-UpperBounds-03
ub formula formula --maxsum=/tmp/710/ub_0_
ub formula name SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
ub formula formula --maxsum=/tmp/710/ub_1_
ub formula name SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
ub formula formula --maxsum=/tmp/710/ub_2_
ub formula name SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
ub formula formula --maxsum=/tmp/710/ub_3_
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 98 places, 116 transitions and 461 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d1m64 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: 116->113 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 98; there are 113 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
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: 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
Killing (15) : 716
Killing (9) : 716

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-d1m64"
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-d1m64, 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-167905978200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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