About the Execution of LTSMin+red for Murphy-PT-D4N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
382.420 | 10493.00 | 23862.00 | 46.40 | ?TFF?????TFTFFFT | 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.r508-tall-171654351400335.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 Murphy-PT-D4N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351400335
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.2K Apr 11 22:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 11 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 22:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-00
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-01
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-02
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-03
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-04
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-05
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-06
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-07
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-08
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-09
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-10
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-11
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-12
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-13
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-14
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717236168222
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:02:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:02:49] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-06-01 10:02:49] [INFO ] Transformed 30 places.
[2024-06-01 10:02:49] [INFO ] Transformed 35 transitions.
[2024-06-01 10:02:49] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40163 steps (8 resets) in 606 ms. (66 steps per ms) remains 7/12 properties
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
// Phase 1: matrix 35 rows 30 cols
[2024-06-01 10:02:50] [INFO ] Computed 6 invariants in 8 ms
[2024-06-01 10:02:50] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem Murphy-PT-D4N050-ReachabilityFireability-2024-02 is UNSAT
FORMULA Murphy-PT-D4N050-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/64 variables, 29/35 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 10/45 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/65 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 1 solved, 6 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/63 variables, 28/34 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/65 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 52 constraints, problems are : Problem set: 1 solved, 6 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1711 ms.
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 23 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:52] [INFO ] Invariant cache hit.
[2024-06-01 10:02:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 30/30 places, 35/35 transitions.
RANDOM walk for 40105 steps (8 resets) in 81 ms. (489 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 252843 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 6
Probabilistic random walk after 252843 steps, saw 173440 distinct states, run finished after 3008 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 10:02:56] [INFO ] Invariant cache hit.
[2024-06-01 10:02:56] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/63 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/65 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 6 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/63 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/65 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 52 constraints, problems are : Problem set: 0 solved, 6 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 282 ms.
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:02:57] [INFO ] Invariant cache hit.
[2024-06-01 10:02:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 10:02:57] [INFO ] Invariant cache hit.
[2024-06-01 10:02:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 10:02:57] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:57] [INFO ] Invariant cache hit.
[2024-06-01 10:02:57] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 30/30 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-06-01 10:02:57] [INFO ] Invariant cache hit.
[2024-06-01 10:02:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:57] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 10:02:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:57] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 10:02:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:57] [INFO ] After 36ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 10:02:57] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 7 ms to minimize.
[2024-06-01 10:02:57] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:02:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-06-01 10:02:58] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 16 ms to minimize.
[2024-06-01 10:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 2
[2024-06-01 10:02:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
[2024-06-01 10:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 3
[2024-06-01 10:02:58] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 10:02:58] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 538 ms.
[2024-06-01 10:02:58] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 10:02:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 4 ms.
[2024-06-01 10:02:58] [INFO ] Flatten gal took : 20 ms
Total runtime 8941 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="Murphy-PT-D4N050"
export BK_EXAMINATION="ReachabilityFireability"
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 Murphy-PT-D4N050, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351400335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N050.tgz
mv Murphy-PT-D4N050 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;