About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d0m020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 365.676 | 8433.00 | 21383.00 | 42.20 | F?F?F?T?F??T??TF | 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.r524-tall-171679079400026.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 RingSingleMessageInMbox-PT-d0m020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079400026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 00:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 00:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 00:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 00:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 64K 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 RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717217985272
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:59:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:46] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-06-01 04:59:46] [INFO ] Transformed 385 places.
[2024-06-01 04:59:46] [INFO ] Transformed 59 transitions.
[2024-06-01 04:59:46] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 47 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 13 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2024-06-01 04:59:46] [INFO ] Computed 3 invariants in 7 ms
[2024-06-01 04:59:46] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
[2024-06-01 04:59:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 04:59:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
[2024-06-01 04:59:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 5 solved, 53 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/137 constraints. Problems are: Problem set: 7 solved, 51 unsolved
[2024-06-01 04:59:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 7 ms to minimize.
[2024-06-01 04:59:48] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 139 constraints, problems are : Problem set: 7 solved, 51 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 53/58 constraints, Known Traps: 2/2 constraints]
After SMT, in 2639ms problems are : Problem set: 7 solved, 51 unsolved
Search for dead transitions found 7 dead transitions in 2652ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 52/59 transitions.
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2957 ms. Remains : 54/56 places, 51/59 transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Support contains 38 out of 48 places after structural reductions.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 04:59:49] [INFO ] Flatten gal took : 20 ms
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:49] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:59:49] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (8570 resets) in 2161 ms. (18 steps per ms) remains 11/34 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (6172 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (6169 resets) in 244 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1958 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (3790 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (2041 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1996 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (6149 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (3708 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1929 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
// Phase 1: matrix 51 rows 48 cols
[2024-06-01 04:59:51] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 04:59:51] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/34 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/41 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 45/86 variables, 41/44 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 18/62 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 04:59:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 13/99 variables, 7/70 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 6/76 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/99 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 76 constraints, problems are : Problem set: 4 solved, 7 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/37 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 40/77 variables, 37/40 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 13/53 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/54 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 21/98 variables, 10/64 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 11/75 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 6/81 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/82 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/82 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/99 variables, 1/83 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/99 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 83 constraints, problems are : Problem set: 4 solved, 7 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 433ms problems are : Problem set: 4 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 1319 ms.
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 28 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 43/48 places, 45/51 transitions.
RANDOM walk for 40000 steps (8684 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1970 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1959 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3826 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1979 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2026 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3756 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 463 steps, run visited all 6 properties in 10 ms. (steps per millisecond=46 )
Probabilistic random walk after 463 steps, saw 249 distinct states, run finished after 13 ms. (steps per millisecond=35 ) properties seen :6
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:53] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 5 ms
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 27 out of 48 places (down from 33) after GAL structural reductions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 47/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 45 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 45 transition count 47
Applied a total of 5 rules in 5 ms. Remains 45 /48 variables (removed 3) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 45/48 places, 47/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 44 transitions.
RANDOM walk for 40000 steps (8549 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1982 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 391 steps, run visited all 1 properties in 4 ms. (steps per millisecond=97 )
Probabilistic random walk after 391 steps, saw 202 distinct states, run finished after 4 ms. (steps per millisecond=97 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:59:53] [INFO ] Input system was already deterministic with 44 transitions.
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 04:59:53] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 04:59:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 51 transitions and 199 arcs took 1 ms.
Total runtime 7058 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 : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-01
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-03
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-05
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-07
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-09
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-10
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-12
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-13
BK_STOP 1717217993705
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/513/ctl_0_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/513/ctl_1_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/513/ctl_2_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/513/ctl_3_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/513/ctl_4_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/513/ctl_5_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/513/ctl_6_
ctl formula name RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/513/ctl_7_
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="RingSingleMessageInMbox-PT-d0m020"
export BK_EXAMINATION="CTLFireability"
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 RingSingleMessageInMbox-PT-d0m020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679079400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m020.tgz
mv RingSingleMessageInMbox-PT-d0m020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;