Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810600029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d0m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 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-d0m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717241998722

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-d0m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:40:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:40:01] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 11:40:01] [INFO ] Transformed 262 places.
[2024-06-01 11:40:01] [INFO ] Transformed 73 transitions.
[2024-06-01 11:40:01] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-06-01 11:40:01] [INFO ] Computed 6 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[73, 1, 7, 1]
RANDOM walk for 10000 steps (2237 resets) in 79 ms. (125 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (3160 resets) in 115 ms. (258 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[73, 1, 7]
[2024-06-01 11:40:01] [INFO ] Invariant cache hit.
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-01 11:40:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:40:02] [INFO ] [Real]Added 31 Read/Feed constraints in 19 ms returned sat
[2024-06-01 11:40:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Nat]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:40:02] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 30 ms.
[2024-06-01 11:40:02] [INFO ] Added : 8 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 104 ms.
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:40:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:40:02] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 15 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Nat]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:40:03] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 23 ms to minimize.
[2024-06-01 11:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-06-01 11:40:03] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 21 ms.
[2024-06-01 11:40:03] [INFO ] Added : 4 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 43 ms.
[2024-06-01 11:40:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:40:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:40:03] [INFO ] [Nat]Added 31 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:40:03] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 12 ms.
[2024-06-01 11:40:03] [INFO ] Added : 6 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[73, 1, 7]
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[73, 7]
Support contains 2 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.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) 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 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 60 transition count 62
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 58 transition count 59
Applied a total of 26 rules in 90 ms. Remains 58 /72 variables (removed 14) and now considering 59/73 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-06-01 11:40:03] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[36, 7]
RANDOM walk for 1000000 steps (223705 resets) in 1172 ms. (852 steps per ms)
BEST_FIRST walk for 2000000 steps (205593 resets) in 937 ms. (2132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[36, 7]
[2024-06-01 11:40:06] [INFO ] Invariant cache hit.
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 11:40:06] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:06] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:40:06] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-06-01 11:40:06] [INFO ] Added : 13 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 47 ms.
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 11:40:06] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:06] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 13 ms.
[2024-06-01 11:40:06] [INFO ] Added : 11 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[36, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[36, 7]
Support contains 2 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 10 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 10 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 9 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:40:06] [INFO ] Invariant cache hit.
[2024-06-01 11:40:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 11:40:06] [INFO ] Invariant cache hit.
[2024-06-01 11:40:06] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 11:40:06] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:40:07] [INFO ] Invariant cache hit.
[2024-06-01 11:40:07] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3786ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4190 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8923 resets) in 1216 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4146 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4192 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4107 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4155 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 705021 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :2 out of 4
Probabilistic random walk after 705021 steps, saw 362059 distinct states, run finished after 3010 ms. (steps per millisecond=234 ) properties seen :2
[2024-06-01 11:40:14] [INFO ] Invariant cache hit.
[2024-06-01 11:40:14] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/86 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX1 is UNSAT
At refinement iteration 9 (OVERLAPS) 21/107 variables, 12/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 18/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/117 variables, 5/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 5/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 117/117 variables, and 86 constraints, problems are : Problem set: 2 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 201ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[36, 7]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[36]
[2024-06-01 11:40:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 10000 steps (2250 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (1002 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2024-06-01 11:40:14] [INFO ] Invariant cache hit.
[2024-06-01 11:40:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:40:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 11:40:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:14] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:40:14] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 11:40:14] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:14] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 7 ms.
[2024-06-01 11:40:14] [INFO ] Added : 13 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
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 32 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 34 ms. Remains : 58/58 places, 59/59 transitions.
[2024-06-01 11:40:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 1000000 steps (223639 resets) in 862 ms. (1158 steps per ms)
BEST_FIRST walk for 1000001 steps (103028 resets) in 377 ms. (2645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2024-06-01 11:40:16] [INFO ] Invariant cache hit.
[2024-06-01 11:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 11:40:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:16] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 11:40:16] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:40:16] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 11 ms.
[2024-06-01 11:40:16] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
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 11 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 11 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 10 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:40:16] [INFO ] Invariant cache hit.
[2024-06-01 11:40:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 11:40:16] [INFO ] Invariant cache hit.
[2024-06-01 11:40:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:16] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-01 11:40:16] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:40:16] [INFO ] Invariant cache hit.
[2024-06-01 11:40:16] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1791 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3140ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3470 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8937 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4181 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4090 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2975630 steps, run timeout after 3001 ms. (steps per millisecond=991 ) properties seen :1 out of 2
Probabilistic random walk after 2975630 steps, saw 1369195 distinct states, run finished after 3001 ms. (steps per millisecond=991 ) properties seen :1
[2024-06-01 11:40:23] [INFO ] Invariant cache hit.
[2024-06-01 11:40:23] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/84 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/103 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/117 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 117/117 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 163ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[36]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 in 8607 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:40:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2223 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (1016 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:40:23] [INFO ] Invariant cache hit.
[2024-06-01 11:40:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 11:40:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:23] [INFO ] [Real]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:40:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:40:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 11:40:23] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:40:23] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 8 ms.
[2024-06-01 11:40:23] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
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 13 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 13 ms. Remains : 58/58 places, 59/59 transitions.
[2024-06-01 11:40:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223354 resets) in 890 ms. (1122 steps per ms)
BEST_FIRST walk for 1000001 steps (102863 resets) in 400 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:40:24] [INFO ] Invariant cache hit.
[2024-06-01 11:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 11:40:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:24] [INFO ] [Real]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:40:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:40:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:40:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 11:40:25] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:40:25] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-06-01 11:40:25] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
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 5 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 5 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 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:40:25] [INFO ] Invariant cache hit.
[2024-06-01 11:40:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 11:40:25] [INFO ] Invariant cache hit.
[2024-06-01 11:40:25] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:40:25] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-06-01 11:40:25] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:40:25] [INFO ] Invariant cache hit.
[2024-06-01 11:40:25] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1816 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3050ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3333 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8947 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4050 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4095 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2895536 steps, run timeout after 3001 ms. (steps per millisecond=964 ) properties seen :1 out of 2
Probabilistic random walk after 2895536 steps, saw 1335341 distinct states, run finished after 3001 ms. (steps per millisecond=964 ) properties seen :1
[2024-06-01 11:40:31] [INFO ] Invariant cache hit.
[2024-06-01 11:40:31] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/45 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/71 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/81 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/83 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/83 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 117/117 variables, and 65 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 3/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 in 8335 ms.
[2024-06-01 11:40:31] [INFO ] Flatten gal took : 49 ms
[2024-06-01 11:40:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 11:40:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 59 transitions and 234 arcs took 7 ms.
Total runtime 30879 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-UpperBounds-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-UpperBounds-11

BK_STOP 1717242032320

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SieveSingleMsgMbox-PT-d0m36-UpperBounds-00
ub formula formula --maxsum=/tmp/645/ub_0_
ub formula name SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
ub formula formula --maxsum=/tmp/645/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d0m36"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d0m36, 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 r532-smll-171683810600029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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