About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 404.376 | 30593.00 | 60643.00 | 227.30 | [undef] | Cannot compute |
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.r532-smll-171683810600010.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 SieveSingleMsgMbox-PT-d0m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717241537892
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:32:20] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 11:32:20] [INFO ] Transformed 262 places.
[2024-06-01 11:32:20] [INFO ] Transformed 73 transitions.
[2024-06-01 11:32:20] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 58 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 37 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-06-01 11:32:20] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 11:32:21] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 11:32:21] [INFO ] Invariant cache hit.
[2024-06-01 11:32:21] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 11:32:21] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 11:32:21] [INFO ] Invariant cache hit.
[2024-06-01 11:32:21] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:32:23] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 21 ms to minimize.
[2024-06-01 11:32:23] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 6 ms to minimize.
[2024-06-01 11:32:23] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:32:24] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:32:24] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:32:24] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 108 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5099 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:32:28] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4930 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 10326ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 10364ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11055 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 58 out of 68 places after structural reductions.
[2024-06-01 11:32:32] [INFO ] Flatten gal took : 34 ms
[2024-06-01 11:32:32] [INFO ] Flatten gal took : 15 ms
[2024-06-01 11:32:32] [INFO ] Input system was already deterministic with 71 transitions.
Reduction of identical properties reduced properties to check from 60 to 56
RANDOM walk for 40000 steps (8912 resets) in 3025 ms. (13 steps per ms) remains 34/56 properties
BEST_FIRST walk for 4004 steps (401 resets) in 101 ms. (39 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (201 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (201 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (191 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (199 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (427 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (407 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (391 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (187 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (302 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (394 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (194 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (405 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (187 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (187 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (401 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (404 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (385 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (192 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (405 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (382 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (148 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (217 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (424 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (183 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (219 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (193 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (369 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (188 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (300 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (187 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (190 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (357 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (424 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
[2024-06-01 11:32:33] [INFO ] Invariant cache hit.
[2024-06-01 11:32:33] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 23/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/67 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 30 unsolved
[2024-06-01 11:32:34] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:32:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 30 unsolved
[2024-06-01 11:32:34] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:32:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 71/138 variables, 67/76 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 29/105 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/105 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 106 constraints, problems are : Problem set: 5 solved, 29 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 5 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 27/61 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 4/9 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 70/135 variables, 65/74 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 28/102 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 11/113 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-06-01 11:32:37] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/114 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 4/139 variables, 3/117 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 1/118 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 18/136 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-06-01 11:32:37] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 1/137 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-06-01 11:32:38] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/139 variables, 1/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 0/139 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 138 constraints, problems are : Problem set: 5 solved, 29 unsolved in 4027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 29/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 6467ms problems are : Problem set: 5 solved, 29 unsolved
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1258 ms.
Support contains 34 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Applied a total of 6 rules in 12 ms. Remains 65 /68 variables (removed 3) and now considering 68/71 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 65/68 places, 68/71 transitions.
RANDOM walk for 40000 steps (8867 resets) in 389 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (424 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (176 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (179 resets) in 13 ms. (285 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4002 steps (195 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (420 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (396 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (409 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (183 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (402 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (193 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (410 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (411 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (431 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (194 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (399 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (426 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (169 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (202 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (402 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (164 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (402 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (207 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (418 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
// Phase 1: matrix 68 rows 65 cols
[2024-06-01 11:32:42] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 11:32:42] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 27/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 11:32:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:32:42] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 11:32:42] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 67/128 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 5/133 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 101 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 27/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 67/128 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 11:32:44] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 5/133 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/133 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 0/133 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 126 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 3441ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 968 ms.
Support contains 30 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 65/65 places, 68/68 transitions.
RANDOM walk for 40000 steps (8983 resets) in 447 ms. (89 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (428 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (203 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (198 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (190 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (431 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (396 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (175 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (432 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (174 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (431 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (186 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (413 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (368 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (437 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (191 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (419 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (390 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (150 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (206 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (401 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (184 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (435 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (191 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (398 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 7044 steps, run visited all 24 properties in 98 ms. (steps per millisecond=71 )
Probabilistic random walk after 7044 steps, saw 3281 distinct states, run finished after 108 ms. (steps per millisecond=65 ) properties seen :24
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 16 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 16 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 71 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 17 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 62/68 places, 65/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 29 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 21 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 60/68 places, 62/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 67
Applied a total of 8 rules in 7 ms. Remains 64 /68 variables (removed 4) and now considering 67/71 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 64/68 places, 67/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 11 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 60/68 places, 62/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 7 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 63/68 places, 66/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 11 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 5 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 63/68 places, 66/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 18 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 60/68 places, 62/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 4 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 3 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/68 places, 66/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 7 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 59/68 places, 61/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 8 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 60/68 places, 62/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 3 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 3 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/68 places, 62/71 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 4 ms
[2024-06-01 11:32:47] [INFO ] Input system was already deterministic with 62 transitions.
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:32:47] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:32:47] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 11:32:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 71 transitions and 281 arcs took 5 ms.
Total runtime 27535 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 : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-14
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-15
BK_STOP 1717241568485
--------------------
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 SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/589/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/589/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/589/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/589/ctl_3_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/589/ctl_4_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/589/ctl_5_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/589/ctl_6_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/589/ctl_7_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/589/ctl_8_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/589/ctl_9_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/589/ctl_10_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/589/ctl_11_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/589/ctl_12_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/589/ctl_13_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/589/ctl_14_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/589/ctl_15_
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="SieveSingleMsgMbox-PT-d0m06"
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 SieveSingleMsgMbox-PT-d0m06, 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 r532-smll-171683810600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 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 ;