About the Execution of LTSMin+red for ShieldIIPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2494.768 | 78108.00 | 123102.00 | 353.70 | ?TTTTTFFTTFT?TTT | 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-171683760800327.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 ShieldIIPt-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800327
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 22:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 22:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 265K 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 ShieldIIPt-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717239298111
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:54:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:54:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:54:59] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 10:54:59] [INFO ] Transformed 953 places.
[2024-06-01 10:54:59] [INFO ] Transformed 703 transitions.
[2024-06-01 10:54:59] [INFO ] Found NUPN structural information;
[2024-06-01 10:54:59] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 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 2028 ms. (19 steps per ms) remains 15/16 properties
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 248 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 136864 steps, run timeout after 3003 ms. (steps per millisecond=45 ) properties seen :12 out of 15
Probabilistic random walk after 136864 steps, saw 135352 distinct states, run finished after 3008 ms. (steps per millisecond=45 ) properties seen :12
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 702 rows 953 cols
[2024-06-01 10:55:03] [INFO ] Computed 451 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 131/254 variables, 119/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 131/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 699/953 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 699/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1655/1655 variables, and 2357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1592 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 131/254 variables, 119/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 131/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 699/953 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 699/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 3/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1655 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1655 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1655/1655 variables, and 2360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1937 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3784ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7982 ms.
Support contains 75 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 87 times.
Drop transitions (Partial Free agglomeration) removed 87 transitions
Iterating global reduction 0 with 87 rules applied. Total rules applied 91 place count 951 transition count 700
Applied a total of 91 rules in 233 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 951/953 places, 700/702 transitions.
RANDOM walk for 40000 steps (8 resets) in 1025 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 182267 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 182267 steps, saw 177209 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 700 rows 951 cols
[2024-06-01 10:55:19] [INFO ] Computed 451 invariants in 6 ms
[2024-06-01 10:55:19] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/156 variables, 73/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 81/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 795/951 variables, 378/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 795/1402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 700/1651 variables, 951/2353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1651 variables, 47/2400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1651 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1651 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1651/1651 variables, and 2400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 608 ms.
Refiners :[Domain max(s): 951/951 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 951/951 constraints, ReadFeed: 47/47 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/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/156 variables, 73/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 81/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 795/951 variables, 378/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 795/1402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 700/1651 variables, 951/2353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1651 variables, 47/2400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1651 variables, 2/2402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1651 variables, 0/2402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1651 variables, 0/2402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1651/1651 variables, and 2402 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1766 ms.
Refiners :[Domain max(s): 951/951 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 951/951 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6767 ms.
Support contains 75 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 57 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 951/951 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 162 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-06-01 10:55:28] [INFO ] Invariant cache hit.
[2024-06-01 10:55:29] [INFO ] Implicit Places using invariants in 586 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 597 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 949/951 places, 700/700 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 36 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2024-06-01 10:55:29] [INFO ] Computed 449 invariants in 9 ms
[2024-06-01 10:55:29] [INFO ] Implicit Places using invariants in 529 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 530 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 699/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 64 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2024-06-01 10:55:30] [INFO ] Computed 448 invariants in 10 ms
[2024-06-01 10:55:30] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-01 10:55:30] [INFO ] Invariant cache hit.
[2024-06-01 10:55:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 10:55:31] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 698/700 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3191 ms. Remains : 946/951 places, 698/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 526 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 191317 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191317 steps, saw 185833 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 10:55:35] [INFO ] Invariant cache hit.
[2024-06-01 10:55:35] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/156 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 790/946 variables, 375/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1644 variables, 44/1438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1644 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1644 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1644/1644 variables, and 1438 constraints, problems are : Problem set: 0 solved, 2 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 946/946 constraints, ReadFeed: 44/44 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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/156 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 790/946 variables, 375/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1644 variables, 44/1438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1644 variables, 2/1440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1644 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1644 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1644/1644 variables, and 1440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 946/946 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1752ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 4922 ms.
Support contains 75 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 38 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 31 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2024-06-01 10:55:41] [INFO ] Invariant cache hit.
[2024-06-01 10:55:42] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-06-01 10:55:42] [INFO ] Invariant cache hit.
[2024-06-01 10:55:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 10:55:43] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-06-01 10:55:43] [INFO ] Redundant transitions in 41 ms returned []
Running 697 sub problems to find dead transitions.
[2024-06-01 10:55:43] [INFO ] Invariant cache hit.
[2024-06-01 10:55:43] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/946 variables, 448/448 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 697 unsolved
SMT process timed out in 30291ms, After SMT, problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32134 ms. Remains : 946/946 places, 698/698 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 946 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 946 transition count 657
Applied a total of 82 rules in 69 ms. Remains 946 /946 variables (removed 0) and now considering 657/698 (removed 41) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 657 rows 946 cols
[2024-06-01 10:56:14] [INFO ] Computed 448 invariants in 5 ms
[2024-06-01 10:56:14] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 10:56:14] [INFO ] [Nat]Absence check using 448 positive place invariants in 59 ms returned sat
[2024-06-01 10:56:15] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 10:56:15] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 10:56:15] [INFO ] After 1297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1528 ms.
[2024-06-01 10:56:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 10:56:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 698 transitions and 3200 arcs took 11 ms.
[2024-06-01 10:56:15] [INFO ] Flatten gal took : 148 ms
Total runtime 76759 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=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldIIPt-PT-050A-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-050A-ReachabilityFireability-2024-12
BK_STOP 1717239376219
--------------------
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 ShieldIIPt-PT-050A-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_0_
rfs formula name ShieldIIPt-PT-050A-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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-171683760800327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050A.tgz
mv ShieldIIPt-PT-050A 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 ;