fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762300983
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1865.560 21994.00 41196.00 69.70 TTTTTTTFFFFT?FTT 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.r528-tall-171683762300983.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 ShieldRVt-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762300983
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 12 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 01:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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 ShieldRVt-PT-020A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717276262189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:11:03] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 21:11:03] [INFO ] Transformed 163 places.
[2024-06-01 21:11:03] [INFO ] Transformed 163 transitions.
[2024-06-01 21:11:03] [INFO ] Found NUPN structural information;
[2024-06-01 21:11:03] [INFO ] Parsed PT model containing 163 places and 163 transitions and 686 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2272 ms. (17 steps per ms) remains 11/16 properties
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 328 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/11 properties
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1175 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
// Phase 1: matrix 162 rows 163 cols
[2024-06-01 21:11:05] [INFO ] Computed 81 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 34/143 variables, 71/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 34/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 20/163 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 407 constraints, problems are : Problem set: 0 solved, 7 unsolved in 621 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 34/143 variables, 71/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 34/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 20/163 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 7/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/325 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 414 constraints, problems are : Problem set: 0 solved, 7 unsolved in 732 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1849 ms.
Support contains 63 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 163 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 163 transition count 151
Applied a total of 22 rules in 36 ms. Remains 163 /163 variables (removed 0) and now considering 151/162 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 163/163 places, 151/162 transitions.
RANDOM walk for 40000 steps (8 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 323690 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 323690 steps, saw 307433 distinct states, run finished after 3005 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 151 rows 163 cols
[2024-06-01 21:11:11] [INFO ] Computed 81 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 151/314 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 407 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 151/314 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 304 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 268 ms.
Support contains 32 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 151/151 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 163 transition count 148
Applied a total of 6 rules in 41 ms. Remains 163 /163 variables (removed 0) and now considering 148/151 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 163/163 places, 148/151 transitions.
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 980440 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 1
Probabilistic random walk after 980440 steps, saw 919437 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
// Phase 1: matrix 148 rows 163 cols
[2024-06-01 21:11:15] [INFO ] Computed 81 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 25/57 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 106/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 25/57 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 106/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 32 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 163/163 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 21:11:15] [INFO ] Invariant cache hit.
[2024-06-01 21:11:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 21:11:16] [INFO ] Invariant cache hit.
[2024-06-01 21:11:16] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-01 21:11:16] [INFO ] Redundant transitions in 3 ms returned []
Running 147 sub problems to find dead transitions.
[2024-06-01 21:11:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 407 constraints, problems are : Problem set: 0 solved, 147 unsolved in 3639 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 147/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 554 constraints, problems are : Problem set: 0 solved, 147 unsolved in 3854 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 7529ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 7532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7784 ms. Remains : 163/163 places, 148/148 transitions.
[2024-06-01 21:11:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 21:11:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 148 transitions and 656 arcs took 4 ms.
[2024-06-01 21:11:23] [INFO ] Flatten gal took : 73 ms
Total runtime 20650 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 : ShieldRVt-PT-020A-ReachabilityFireability-2024-12

BK_STOP 1717276284183

--------------------
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 ShieldRVt-PT-020A-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/539/inv_0_
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="ShieldRVt-PT-020A"
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 ShieldRVt-PT-020A, 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 r528-tall-171683762300983"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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