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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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-d0m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679313637419

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-d0m04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 12:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:00:39] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-20 12:00:39] [INFO ] Transformed 262 places.
[2023-03-20 12:00:39] [INFO ] Transformed 73 transitions.
[2023-03-20 12:00:39] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 12:00:39] [INFO ] Computed 6 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1072 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :3
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1021 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 995 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
[2023-03-20 12:00:39] [INFO ] Invariant cache hit.
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned unsat
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:00:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 12:00:39] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2023-03-20 12:00:39] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2023-03-20 12:00:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:39] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2023-03-20 12:00:39] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-20 12:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-20 12:00:39] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2023-03-20 12:00:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-20 12:00:39] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2023-03-20 12:00:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-20 12:00:39] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2023-03-20 12:00:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2023-03-20 12:00:39] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2023-03-20 12:00:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-20 12:00:39] [INFO ] Added : 14 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 29 ms.
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-20 12:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:40] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 5 ms.
[2023-03-20 12:00:40] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-20 12:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2023-03-20 12:00:40] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 5 ms.
[2023-03-20 12:00:40] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:40] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 41, 1, 7, 1] Max seen :[1, 0, 0, 0, 0, 0, 1]
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 61 transition count 63
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 21 ms. Remains 61 /72 variables (removed 11) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 61/72 places, 63/73 transitions.
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:00:40] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 223497 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102764 resets, run finished after 303 ms. (steps per millisecond=3300 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102876 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102733 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 3) seen :0
[2023-03-20 12:00:41] [INFO ] Invariant cache hit.
[2023-03-20 12:00:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-20 12:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:41] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:41] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-20 12:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-20 12:00:41] [INFO ] Added : 13 causal constraints over 4 iterations in 67 ms. Result :sat
Minimization took 25 ms.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-20 12:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-20 12:00:42] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:42] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-20 12:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-20 12:00:42] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 14 ms.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-20 12:00:42] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-20 12:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-20 12:00:42] [INFO ] Added : 13 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 7] Max seen :[0, 0, 0]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-20 12:00:42] [INFO ] Invariant cache hit.
[2023-03-20 12:00:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 12:00:42] [INFO ] Invariant cache hit.
[2023-03-20 12:00:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-20 12:00:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:00:42] [INFO ] Invariant cache hit.
[2023-03-20 12:00:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 61/61 places, 63/63 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-04
[2023-03-20 12:00:42] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 12:00:42] [INFO ] Invariant cache hit.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-20 12:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-20 12:00:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:42] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-20 12:00:42] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2023-03-20 12:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-20 12:00:42] [INFO ] Added : 13 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 59 transition count 60
Applied a total of 5 rules in 8 ms. Remains 59 /61 variables (removed 2) and now considering 60/63 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/61 places, 60/63 transitions.
// Phase 1: matrix 60 rows 59 cols
[2023-03-20 12:00:42] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223991 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103250 resets, run finished after 278 ms. (steps per millisecond=3597 ) properties (out of 1) seen :0
[2023-03-20 12:00:43] [INFO ] Invariant cache hit.
[2023-03-20 12:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-20 12:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-20 12:00:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 12:00:43] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:43] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-20 12:00:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2023-03-20 12:00:43] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-20 12:00:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2023-03-20 12:00:43] [INFO ] Added : 13 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-20 12:00:43] [INFO ] Invariant cache hit.
[2023-03-20 12:00:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 12:00:43] [INFO ] Invariant cache hit.
[2023-03-20 12:00:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 12:00:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-20 12:00:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:00:43] [INFO ] Invariant cache hit.
[2023-03-20 12:00:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 59/59 places, 60/60 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-04 in 1442 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-05
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:00:44] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1015 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-03-20 12:00:44] [INFO ] Invariant cache hit.
[2023-03-20 12:00:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-20 12:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:44] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-20 12:00:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:44] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:44] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-20 12:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-20 12:00:44] [INFO ] Added : 14 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [45] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 62
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 62/63 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 60/61 places, 62/63 transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:00:44] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223905 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103017 resets, run finished after 287 ms. (steps per millisecond=3484 ) properties (out of 1) seen :0
[2023-03-20 12:00:45] [INFO ] Invariant cache hit.
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-20 12:00:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 12:00:45] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2023-03-20 12:00:45] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 45 transitions) in 4 ms.
[2023-03-20 12:00:45] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-20 12:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-20 12:00:45] [INFO ] Added : 15 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [41] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 60/60 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:00:45] [INFO ] Invariant cache hit.
[2023-03-20 12:00:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:00:45] [INFO ] Invariant cache hit.
[2023-03-20 12:00:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 12:00:45] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-20 12:00:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:00:45] [INFO ] Invariant cache hit.
[2023-03-20 12:00:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 60/60 places, 62/62 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-05 in 1382 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-06
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:00:45] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 12:00:45] [INFO ] Invariant cache hit.
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-20 12:00:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-20 12:00:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:00:45] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:45] [INFO ] Computed and/alt/rep : 16/30/16 causal constraints (skipped 46 transitions) in 5 ms.
[2023-03-20 12:00:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-20 12:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-20 12:00:45] [INFO ] Added : 13 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 58 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 58 transition count 60
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 58 transition count 59
Applied a total of 7 rules in 21 ms. Remains 58 /61 variables (removed 3) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 58/61 places, 59/63 transitions.
// Phase 1: matrix 59 rows 58 cols
[2023-03-20 12:00:45] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 223492 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103161 resets, run finished after 274 ms. (steps per millisecond=3649 ) properties (out of 1) seen :0
[2023-03-20 12:00:46] [INFO ] Invariant cache hit.
[2023-03-20 12:00:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:00:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-20 12:00:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:00:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:00:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:00:46] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-20 12:00:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 12:00:46] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2023-03-20 12:00:46] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2023-03-20 12:00:46] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-20 12:00:46] [INFO ] Invariant cache hit.
[2023-03-20 12:00:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 12:00:46] [INFO ] Invariant cache hit.
[2023-03-20 12:00:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 12:00:46] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-20 12:00:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:00:46] [INFO ] Invariant cache hit.
[2023-03-20 12:00:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m04-UpperBounds-06 in 1364 ms.
[2023-03-20 12:00:46] [INFO ] Flatten gal took : 28 ms
[2023-03-20 12:00:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 12:00:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 63 transitions and 250 arcs took 1 ms.
Total runtime 8095 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/662/ub_0_ --maxsum=/tmp/662/ub_1_ --maxsum=/tmp/662/ub_2_
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679313647362

--------------------
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-d0m04-UpperBounds-04
ub formula formula --maxsum=/tmp/662/ub_0_
ub formula name SieveSingleMsgMbox-PT-d0m04-UpperBounds-05
ub formula formula --maxsum=/tmp/662/ub_1_
ub formula name SieveSingleMsgMbox-PT-d0m04-UpperBounds-06
ub formula formula --maxsum=/tmp/662/ub_2_
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 61 places, 63 transitions and 250 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d0m04 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: 63->61 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 61; there are 61 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: 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: Exploration took 2295 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.030 real 0.120 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 670 states, 1055 nodes
pnml2lts-sym: Maximum sum of /tmp/662/ub_0_ is: 0
pnml2lts-sym: Maximum sum of /tmp/662/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/662/ub_2_ is: 1
pnml2lts-sym: group_next: 373 nodes total
pnml2lts-sym: group_explored: 619 nodes, 470 short vectors total
pnml2lts-sym: max token count: 4

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

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