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-171654351400327.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-D4N025, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351400327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Apr 11 22:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:52 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-D4N025-ReachabilityFireability-2024-00
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-01
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-02
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-03
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-04
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-05
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-06
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-07
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-08
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-09
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-10
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-11
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-12
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-13
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-14
FORMULA_NAME Murphy-PT-D4N025-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717236111717

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-D4N025
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:01:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:01:52] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-06-01 10:01:52] [INFO ] Transformed 30 places.
[2024-06-01 10:01:53] [INFO ] Transformed 35 transitions.
[2024-06-01 10:01:53] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40024 steps (8 resets) in 952 ms. (41 steps per ms) remains 13/16 properties
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1115 ms. (35 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
// Phase 1: matrix 35 rows 30 cols
[2024-06-01 10:01:54] [INFO ] Computed 6 invariants in 11 ms
[2024-06-01 10:01:54] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem Murphy-PT-D4N025-ReachabilityFireability-2024-01 is UNSAT
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Murphy-PT-D4N025-ReachabilityFireability-2024-04 is UNSAT
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Murphy-PT-D4N025-ReachabilityFireability-2024-05 is UNSAT
FORMULA Murphy-PT-D4N025-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/65 variables, 30/36 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 3 solved, 10 unsolved in 320 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: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 10:01:54] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 11 ms to minimize.
[2024-06-01 10:01:54] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 35/65 variables, 30/38 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 10/48 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 10/58 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 10:01:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/65 variables, 1/59 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 59 constraints, problems are : Problem set: 3 solved, 10 unsolved in 568 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: 10/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 989ms problems are : Problem set: 3 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 4158 ms.
Support contains 30 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 7 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:01:59] [INFO ] Invariant cache hit.
[2024-06-01 10:01:59] [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 254 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 364 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 635ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 636ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 30/30 places, 35/35 transitions.
RANDOM walk for 40025 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 298434 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 10
Probabilistic random walk after 298434 steps, saw 205792 distinct states, run finished after 3008 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/65 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 10 unsolved in 340 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: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/65 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 56 constraints, problems are : Problem set: 0 solved, 10 unsolved in 289 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: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 646ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 802 ms.
Support contains 30 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 1 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 1 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:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 10:02:04] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [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 240 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 226 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 473ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 30/30 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:05] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-01 10:02:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:05] [INFO ] After 65ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 10:02:05] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
[2024-06-01 10:02:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
TRAPS : Iteration 1
[2024-06-01 10:02:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 2 ms to minimize.
[2024-06-01 10:02:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-06-01 10:02:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:02:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:02:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 41 ms
TRAPS : Iteration 2
[2024-06-01 10:02:06] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 10:02:06] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 670 ms.
[2024-06-01 10:02:06] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 10:02:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 3 ms.
[2024-06-01 10:02:06] [INFO ] Flatten gal took : 19 ms
Total runtime 13483 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-00
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-02
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-03
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-06
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-07
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-08
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-09
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-10
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-13
Could not compute solution for formula : Murphy-PT-D4N025-ReachabilityFireability-2024-15

BK_STOP 1717236126685

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/562/inv_0_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/562/inv_1_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_2_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_3_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/562/inv_4_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_5_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/562/inv_6_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_7_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_8_
rfs formula name Murphy-PT-D4N025-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D4N025"
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-D4N025, 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-171654351400327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;