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-171683810600013.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-d0m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 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-d0m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717241606053

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:33:29] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 11:33:29] [INFO ] Transformed 262 places.
[2024-06-01 11:33:29] [INFO ] Transformed 73 transitions.
[2024-06-01 11:33:29] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-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:33:29] [INFO ] Computed 6 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 7, 43, 1]
RANDOM walk for 10000 steps (2172 resets) in 66 ms. (149 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (1983 resets) in 54 ms. (363 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 43]
[2024-06-01 11:33:29] [INFO ] Invariant cache hit.
[2024-06-01 11:33:29] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 11:33:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:33:29] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 11:33:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:33:29] [INFO ] [Real]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:33:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 11:33:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:33:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 11:33:29] [INFO ] [Nat]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:33:30] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 23 ms.
[2024-06-01 11:33:30] [INFO ] Added : 6 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 11:33:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 11:33:30] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2024-06-01 11:33:30] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 16 ms.
[2024-06-01 11:33:30] [INFO ] Added : 6 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[7, 43]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 43]
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.1 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 96 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 118 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-06-01 11:33:30] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[7, 6]
RANDOM walk for 1000000 steps (223832 resets) in 1275 ms. (783 steps per ms)
BEST_FIRST walk for 2000000 steps (206421 resets) in 807 ms. (2475 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 6]
[2024-06-01 11:33:32] [INFO ] Invariant cache hit.
[2024-06-01 11:33:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:33:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 11:33:32] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:32] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-06-01 11:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:33:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 11:33:32] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:33:32] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 8 ms.
[2024-06-01 11:33:32] [INFO ] Added : 10 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 11:33:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:33:33] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:33:33] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 13 ms.
[2024-06-01 11:33:33] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 16 ms to minimize.
[2024-06-01 11:33:33] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 3 ms to minimize.
[2024-06-01 11:33:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-06-01 11:33:33] [INFO ] Added : 12 causal constraints over 4 iterations in 298 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[7, 6]
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:33:33] [INFO ] Invariant cache hit.
[2024-06-01 11:33:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 11:33:33] [INFO ] Invariant cache hit.
[2024-06-01 11:33:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:33] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-01 11:33:34] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:33:34] [INFO ] Invariant cache hit.
[2024-06-01 11:33:34] [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 1995 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 2873 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 5062ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5525 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8980 resets) in 1147 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4088 resets) in 473 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4148 resets) in 606 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4114 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4103 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Probably explored full state space saw : 19185 states, properties seen :2
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 602 ms. (steps per millisecond=80 ) properties seen :2
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 244 ms. (steps per millisecond=199 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[7, 6]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-01
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:33:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2240 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (1040 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:33:40] [INFO ] Invariant cache hit.
[2024-06-01 11:33:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 11:33:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 11:33:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:41] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:33:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 11:33:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 11:33:41] [INFO ] [Nat]Added 23 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:33:41] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 12 ms.
[2024-06-01 11:33:41] [INFO ] Added : 10 causal constraints over 2 iterations in 50 ms. Result :sat
Minimization took 42 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 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.
[2024-06-01 11:33:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223583 resets) in 762 ms. (1310 steps per ms)
BEST_FIRST walk for 1000000 steps (103036 resets) in 362 ms. (2754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:33:42] [INFO ] Invariant cache hit.
[2024-06-01 11:33:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:33:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 11:33:42] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:42] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:42] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 11:33:42] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:33:42] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-06-01 11:33:42] [INFO ] Added : 10 causal constraints over 2 iterations in 44 ms. Result :sat
Minimization took 37 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 6 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 6 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:33:42] [INFO ] Invariant cache hit.
[2024-06-01 11:33:42] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 11:33:42] [INFO ] Invariant cache hit.
[2024-06-01 11:33:42] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-01 11:33:43] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:33:43] [INFO ] Invariant cache hit.
[2024-06-01 11:33:43] [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 1801 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 2974 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 4842ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5119 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8975 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4068 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4079 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Probably explored full state space saw : 19185 states, properties seen :1
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 75 ms. (steps per millisecond=649 ) properties seen :1
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 48 ms. (steps per millisecond=1014 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 in 7141 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-06-01 11:33:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2223 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1030 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-06-01 11:33:48] [INFO ] Invariant cache hit.
[2024-06-01 11:33:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:48] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 11:33:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:48] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:33:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:48] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 11:33:48] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:33:48] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 12 ms.
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:33:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2024-06-01 11:33:48] [INFO ] Added : 12 causal constraints over 4 iterations in 253 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
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 9 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 9 ms. Remains : 58/58 places, 59/59 transitions.
[2024-06-01 11:33:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (223488 resets) in 1055 ms. (946 steps per ms)
BEST_FIRST walk for 1000001 steps (102836 resets) in 355 ms. (2808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-06-01 11:33:50] [INFO ] Invariant cache hit.
[2024-06-01 11:33:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:33:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 11:33:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:50] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:33:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:33:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:33:50] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 11:33:50] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:33:50] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-06-01 11:33:50] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 11:33:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-06-01 11:33:50] [INFO ] Added : 12 causal constraints over 4 iterations in 230 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
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 8 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 8 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 7 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:33:50] [INFO ] Invariant cache hit.
[2024-06-01 11:33:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 11:33:50] [INFO ] Invariant cache hit.
[2024-06-01 11:33:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:33:50] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 11:33:50] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:33:50] [INFO ] Invariant cache hit.
[2024-06-01 11:33:50] [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 1877 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 2281 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 4247ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4624 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8948 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4254 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4116 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Probably explored full state space saw : 19185 states, properties seen :1
Probabilistic random walk after 48690 steps, saw 19185 distinct states, run finished after 72 ms. (steps per millisecond=676 ) properties seen :1
Explored full state space saw : 19185 states, properties seen :0
Exhaustive walk after 48690 steps, saw 19185 distinct states, run finished after 74 ms. (steps per millisecond=657 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 in 7333 ms.
[2024-06-01 11:33:55] [INFO ] Flatten gal took : 60 ms
[2024-06-01 11:33:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 11:33:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 59 transitions and 234 arcs took 8 ms.
Total runtime 27296 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-d0m06-UpperBounds-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-UpperBounds-04

BK_STOP 1717241636203

--------------------
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-d0m06-UpperBounds-01
ub formula formula --maxsum=/tmp/636/ub_0_
ub formula name SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
ub formula formula --maxsum=/tmp/636/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-d0m06"
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-d0m06, 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-171683810600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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