About the Execution of LTSMin+red for DoubleLock-PT-p2s1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 484.247 | 16492.00 | 30232.00 | 40.60 | ??T?TF?FT?T?F??? | 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.r488-tall-171631133000609.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 DoubleLock-PT-p2s1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000609
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 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 DoubleLock-PT-p2s1-CTLCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2023-12
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2023-14
FORMULA_NAME DoubleLock-PT-p2s1-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717201995181
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:33:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:33:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:33:16] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 00:33:16] [INFO ] Transformed 64 places.
[2024-06-01 00:33:16] [INFO ] Transformed 212 transitions.
[2024-06-01 00:33:16] [INFO ] Parsed PT model containing 64 places and 212 transitions and 860 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 204/204 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 204
Applied a total of 1 rules in 15 ms. Remains 55 /56 variables (removed 1) and now considering 204/204 (removed 0) transitions.
[2024-06-01 00:33:16] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 55 cols
[2024-06-01 00:33:16] [INFO ] Computed 3 invariants in 14 ms
[2024-06-01 00:33:16] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 00:33:16] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-06-01 00:33:16] [INFO ] Invariant cache hit.
[2024-06-01 00:33:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 00:33:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-06-01 00:33:16] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-06-01 00:33:16] [INFO ] Invariant cache hit.
[2024-06-01 00:33:16] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 152/205 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:33:18] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 10 ms to minimize.
[2024-06-01 00:33:18] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 2/207 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 87 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 152/205 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 27/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 2/207 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 190/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 289 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6456 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
After SMT, in 12097ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 12110ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 204/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12455 ms. Remains : 55/56 places, 204/204 transitions.
Support contains 42 out of 55 places after structural reductions.
[2024-06-01 00:33:29] [INFO ] Flatten gal took : 38 ms
[2024-06-01 00:33:29] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:33:29] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 40 out of 55 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (198 resets) in 2383 ms. (16 steps per ms) remains 19/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
[2024-06-01 00:33:30] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-06-01 00:33:30] [INFO ] Invariant cache hit.
[2024-06-01 00:33:30] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/45 variables, 3/3 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 148/193 variables, 45/48 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 24/72 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/207 variables, 10/82 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 3/85 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/85 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/85 constraints. Problems are: Problem set: 17 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 85 constraints, problems are : Problem set: 17 solved, 2 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 2/2 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/151 variables, 13/15 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 7/22 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/24 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/169 variables, 2/26 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 6/32 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 38/207 variables, 34/66 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 1/67 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 20/87 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/87 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/87 constraints. Problems are: Problem set: 17 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 87 constraints, problems are : Problem set: 17 solved, 2 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 17 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 352 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 190
Applied a total of 9 rules in 24 ms. Remains 49 /55 variables (removed 6) and now considering 190/204 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 49/55 places, 190/204 transitions.
RANDOM walk for 40006 steps (126 resets) in 149 ms. (266 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-06-01 00:33:30] [INFO ] Flow matrix only has 141 transitions (discarded 49 similar events)
// Phase 1: matrix 141 rows 49 cols
[2024-06-01 00:33:30] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 00:33:30] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/135 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/148 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/190 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/135 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/148 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/190 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 190/190 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 188
Applied a total of 2 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 188/190 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 49/49 places, 188/190 transitions.
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35564 steps (7 resets) in 45 ms. (773 steps per ms) remains 0/1 properties
Successfully simplified 17 atomic propositions for a total of 15 simplifications.
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:33:30] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 00:33:30] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:33:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:33:30] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:30] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 23 out of 55 places (down from 25) after GAL structural reductions.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 192
Applied a total of 7 rules in 13 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:30] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:30] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:30] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 4 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:30] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 53 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 53 /55 variables (removed 2) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 53/55 places, 204/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 204 transitions.
RANDOM walk for 645 steps (2 resets) in 8 ms. (71 steps per ms) remains 0/1 properties
FORMULA DoubleLock-PT-p2s1-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Applied a total of 7 rules in 4 ms. Remains 50 /55 variables (removed 5) and now considering 196/204 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/55 places, 196/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 4 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 192
Applied a total of 7 rules in 12 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 9 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 192
Applied a total of 7 rules in 11 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 9 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 52 /55 variables (removed 3) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 52/55 places, 204/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 3 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 3 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/55 places, 192/204 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:33:31] [INFO ] Input system was already deterministic with 192 transitions.
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 9 ms
[2024-06-01 00:33:31] [INFO ] Flatten gal took : 9 ms
[2024-06-01 00:33:31] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:33:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 204 transitions and 824 arcs took 2 ms.
Total runtime 15090 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 : DoubleLock-PT-p2s1-CTLCardinality-2024-00
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2024-01
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2024-03
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2024-06
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2024-09
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2024-11
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2023-13
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2023-14
Could not compute solution for formula : DoubleLock-PT-p2s1-CTLCardinality-2023-15
BK_STOP 1717202011673
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/528/ctl_0_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/528/ctl_1_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/528/ctl_2_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/528/ctl_3_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/528/ctl_4_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/528/ctl_5_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/528/ctl_6_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/528/ctl_7_
ctl formula name DoubleLock-PT-p2s1-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/528/ctl_8_
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="DoubleLock-PT-p2s1"
export BK_EXAMINATION="CTLCardinality"
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 DoubleLock-PT-p2s1, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631133000609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s1.tgz
mv DoubleLock-PT-p2s1 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;