About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d0m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 494.012 | 24395.00 | 43993.00 | 159.50 | 1 1 0 0 3 0 1 0 0 0 0 0 0 0 0 0 | normal |
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.r377-smll-171683809500013.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 greatspnxred
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 r377-smll-171683809500013
=====================================================================
--------------------
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 1716876716554
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:11:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 06:11:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:11:58] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-28 06:11:58] [INFO ] Transformed 262 places.
[2024-05-28 06:11:58] [INFO ] Transformed 73 transitions.
[2024-05-28 06:11:58] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 190 places in 1 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-05-28 06:11:58] [INFO ] Computed 6 invariants in 18 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 (2238 resets) in 54 ms. (181 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 20001 steps (2049 resets) in 51 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 43]
[2024-05-28 06:11:58] [INFO ] Invariant cache hit.
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-28 06:11:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:11:59] [INFO ] [Real]Added 31 Read/Feed constraints in 141 ms returned sat
[2024-05-28 06:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:11:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Nat]Added 31 Read/Feed constraints in 12 ms returned sat
[2024-05-28 06:11:59] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 23 ms.
[2024-05-28 06:11:59] [INFO ] Added : 6 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 37 ms.
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:11:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:11:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:12:00] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 06:12:00] [INFO ] [Nat]Added 31 Read/Feed constraints in 12 ms returned sat
[2024-05-28 06:12:00] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 29 ms.
[2024-05-28 06:12:00] [INFO ] Added : 6 causal constraints over 2 iterations in 60 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.2 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 67 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 93 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-05-28 06:12:00] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[7, 6]
RANDOM walk for 1000000 steps (224063 resets) in 1028 ms. (971 steps per ms)
BEST_FIRST walk for 2000001 steps (205918 resets) in 871 ms. (2293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[7, 6]
[2024-05-28 06:12:02] [INFO ] Invariant cache hit.
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-28 06:12:02] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:02] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:02] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-05-28 06:12:02] [INFO ] Added : 10 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:12:02] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:12:02] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 11 ms to minimize.
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 7 ms to minimize.
[2024-05-28 06:12:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-28 06:12:02] [INFO ] Added : 12 causal constraints over 4 iterations in 248 ms. Result :sat
Minimization took 46 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 7 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 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:02] [INFO ] Invariant cache hit.
[2024-05-28 06:12:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 06:12:03] [INFO ] Invariant cache hit.
[2024-05-28 06:12:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:03] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-28 06:12:03] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:03] [INFO ] Invariant cache hit.
[2024-05-28 06:12:03] [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 1460 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 2166 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 3747ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4042 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (9004 resets) in 1135 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4054 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4109 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4149 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4110 resets) in 101 ms. (392 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 449 ms. (steps per millisecond=108 ) 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 284 ms. (steps per millisecond=171 ) 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-05-28 06:12:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2230 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1053 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:12:08] [INFO ] Invariant cache hit.
[2024-05-28 06:12:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:12:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:12:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:08] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:08] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:12:08] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:08] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 15 ms.
[2024-05-28 06:12:08] [INFO ] Added : 10 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 29 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.
[2024-05-28 06:12:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223862 resets) in 682 ms. (1464 steps per ms)
BEST_FIRST walk for 1000001 steps (102653 resets) in 371 ms. (2688 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:12:09] [INFO ] Invariant cache hit.
[2024-05-28 06:12:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:09] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-28 06:12:09] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:09] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:12:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 06:12:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:12:09] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:12:09] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 7 ms.
[2024-05-28 06:12:09] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 40 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 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 8 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:09] [INFO ] Invariant cache hit.
[2024-05-28 06:12:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 06:12:10] [INFO ] Invariant cache hit.
[2024-05-28 06:12:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-28 06:12:10] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:10] [INFO ] Invariant cache hit.
[2024-05-28 06:12:10] [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 1286 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 2013 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 3377ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3636 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8927 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4159 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4110 resets) in 41 ms. (952 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 55 ms. (steps per millisecond=885 ) 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 33 ms. (steps per millisecond=1475 ) 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 5468 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-05-28 06:12:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2234 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (1006 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-28 06:12:13] [INFO ] Invariant cache hit.
[2024-05-28 06:12:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:12:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:13] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 06:12:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:13] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:13] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:12:13] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:13] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-05-28 06:12:14] [INFO ] Added : 12 causal constraints over 4 iterations in 170 ms. Result :sat
Minimization took 45 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 6 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.
[2024-05-28 06:12:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (223979 resets) in 695 ms. (1436 steps per ms)
BEST_FIRST walk for 1000000 steps (103453 resets) in 410 ms. (2433 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-28 06:12:15] [INFO ] Invariant cache hit.
[2024-05-28 06:12:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 06:12:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:15] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:12:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:12:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:12:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 06:12:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:12:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 7 ms.
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:12:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-28 06:12:15] [INFO ] Added : 12 causal constraints over 4 iterations in 179 ms. Result :sat
Minimization took 42 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 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 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:12:15] [INFO ] Invariant cache hit.
[2024-05-28 06:12:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 06:12:15] [INFO ] Invariant cache hit.
[2024-05-28 06:12:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:12:15] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-28 06:12:15] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:12:15] [INFO ] Invariant cache hit.
[2024-05-28 06:12: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 1307 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 2008 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 3400ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3654 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8966 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4149 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4080 resets) in 39 ms. (1000 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 62 ms. (steps per millisecond=785 ) 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 35 ms. (steps per millisecond=1391 ) 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 5882 ms.
[2024-05-28 06:12:19] [INFO ] Flatten gal took : 44 ms
[2024-05-28 06:12:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-28 06:12:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 59 transitions and 234 arcs took 5 ms.
Total runtime 21666 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SieveSingleMsgMbox-PT-d0m06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 58
TRANSITIONS: 59
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 664
MODEL NAME: /home/mcc/execution/413/model
58 places, 59 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716876740949
--------------------
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
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="greatspnxred"
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 greatspnxred"
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 r377-smll-171683809500013"
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 '
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 ;