About the Execution of LTSMin+red for AutonomousCar-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 826.048 | 91285.00 | 152944.00 | 342.90 | [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.r468-smll-171620167400274.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 AutonomousCar-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400274
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K 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 AutonomousCar-PT-04b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717211191868
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:06:35] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-06-01 03:06:35] [INFO ] Transformed 221 places.
[2024-06-01 03:06:35] [INFO ] Transformed 368 transitions.
[2024-06-01 03:06:35] [INFO ] Found NUPN structural information;
[2024-06-01 03:06:35] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 106 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 210 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 210 transition count 357
Applied a total of 22 rules in 102 ms. Remains 210 /221 variables (removed 11) and now considering 357/368 (removed 11) transitions.
// Phase 1: matrix 357 rows 210 cols
[2024-06-01 03:06:35] [INFO ] Computed 9 invariants in 45 ms
[2024-06-01 03:06:36] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-06-01 03:06:36] [INFO ] Invariant cache hit.
[2024-06-01 03:06:36] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-06-01 03:06:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:06:43] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 43 ms to minimize.
[2024-06-01 03:06:43] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 5 ms to minimize.
[2024-06-01 03:06:44] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 5 ms to minimize.
[2024-06-01 03:06:44] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 3 ms to minimize.
[2024-06-01 03:06:44] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-01 03:06:45] [INFO ] Deduced a trap composed of 51 places in 811 ms of which 4 ms to minimize.
[2024-06-01 03:06:45] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 4 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 4 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 3 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 4 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 4 ms to minimize.
[2024-06-01 03:06:46] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 4 ms to minimize.
[2024-06-01 03:06:47] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
[2024-06-01 03:06:47] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-01 03:06:47] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-06-01 03:06:47] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 4 ms to minimize.
[2024-06-01 03:06:48] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:06:48] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2024-06-01 03:06:48] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:06:49] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2024-06-01 03:06:49] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 4 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-06-01 03:06:51] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 3 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-01 03:06:52] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-06-01 03:06:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:06:57] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 4 ms to minimize.
[2024-06-01 03:06:57] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 4 ms to minimize.
[2024-06-01 03:06:58] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:07:01] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 4 ms to minimize.
[2024-06-01 03:07:01] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-06-01 03:07:02] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:07:02] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-06-01 03:07:02] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 03:07:03] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:07:05] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/567 variables, and 57 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/210 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-06-01 03:07:11] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-06-01 03:07:12] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 5 (OVERLAPS) 357/567 variables, 210/269 constraints. Problems are: Problem set: 2 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 354/623 constraints. Problems are: Problem set: 2 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/623 constraints. Problems are: Problem set: 2 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 623 constraints, problems are : Problem set: 2 solved, 354 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 354/356 constraints, Known Traps: 50/50 constraints]
After SMT, in 61105ms problems are : Problem set: 2 solved, 354 unsolved
Search for dead transitions found 2 dead transitions in 61180ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/221 places, 355/368 transitions.
Deduced a syphon composed of 1 places in 5 ms
Applied a total of 0 rules in 14 ms. Remains 210 /210 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62540 ms. Remains : 210/221 places, 355/368 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 103 out of 209 places after structural reductions.
[2024-06-01 03:07:38] [INFO ] Flatten gal took : 98 ms
[2024-06-01 03:07:38] [INFO ] Flatten gal took : 41 ms
[2024-06-01 03:07:38] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 102 out of 209 places (down from 103) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 110 to 107
RANDOM walk for 40000 steps (90 resets) in 2945 ms. (13 steps per ms) remains 33/107 properties
BEST_FIRST walk for 4003 steps (9 resets) in 70 ms. (56 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 66 ms. (59 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 61 ms. (64 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (9 resets) in 53 ms. (74 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 53 ms. (74 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (10 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
// Phase 1: matrix 355 rows 209 cols
[2024-06-01 03:07:39] [INFO ] Computed 9 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 155/198 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 20 unsolved
[2024-06-01 03:07:40] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 3 ms to minimize.
[2024-06-01 03:07:40] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
[2024-06-01 03:07:40] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/11 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 11/209 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 18 unsolved
Problem AtomicPropp93 is UNSAT
At refinement iteration 6 (OVERLAPS) 355/564 variables, 209/221 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 221 constraints, problems are : Problem set: 8 solved, 17 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 17 unsolved
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 171/198 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/11 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 11/209 variables, 1/12 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 355/564 variables, 209/221 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 15/236 constraints. Problems are: Problem set: 10 solved, 15 unsolved
[2024-06-01 03:07:42] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/237 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/237 constraints. Problems are: Problem set: 10 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/564 variables, 0/237 constraints. Problems are: Problem set: 10 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 237 constraints, problems are : Problem set: 10 solved, 15 unsolved in 3308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 15/25 constraints, Known Traps: 4/4 constraints]
After SMT, in 4983ms problems are : Problem set: 10 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 5 properties in 14829 ms.
Support contains 22 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 355/355 transitions.
Graph (trivial) has 170 edges and 209 vertex of which 4 / 209 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 567 edges and 207 vertex of which 203 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 203 transition count 264
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 109 rules applied. Total rules applied 196 place count 119 transition count 239
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 210 place count 105 transition count 239
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 210 place count 105 transition count 228
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 232 place count 94 transition count 228
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 246 place count 80 transition count 214
Iterating global reduction 3 with 14 rules applied. Total rules applied 260 place count 80 transition count 214
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 325 place count 80 transition count 149
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 365 place count 60 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 367 place count 58 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 369 place count 58 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 371 place count 57 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 57 transition count 135
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 381 place count 57 transition count 126
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 390 place count 48 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 391 place count 48 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 392 place count 47 transition count 125
Applied a total of 392 rules in 184 ms. Remains 47 /209 variables (removed 162) and now considering 125/355 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 47/209 places, 125/355 transitions.
RANDOM walk for 40000 steps (1638 resets) in 567 ms. (70 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (361 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (365 resets) in 115 ms. (344 steps per ms) remains 1/2 properties
// Phase 1: matrix 125 rows 47 cols
[2024-06-01 03:08:00] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:08:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/136 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/168 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/172 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/172 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/136 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/168 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/170 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/172 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/172 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 125/125 transitions.
Graph (complete) has 300 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 45 transition count 120
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 43 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 42 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 42 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 40 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 39 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 39 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 37 transition count 110
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 37 transition count 107
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 36 place count 34 transition count 95
Applied a total of 36 rules in 34 ms. Remains 34 /47 variables (removed 13) and now considering 95/125 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 34/47 places, 95/125 transitions.
RANDOM walk for 34471 steps (1479 resets) in 113 ms. (302 steps per ms) remains 0/1 properties
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-06-01 03:08:00] [INFO ] Flatten gal took : 31 ms
[2024-06-01 03:08:00] [INFO ] Flatten gal took : 34 ms
[2024-06-01 03:08:00] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 93 out of 209 places (down from 94) after GAL structural reductions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 32 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 178/209 places, 260/355 transitions.
[2024-06-01 03:08:00] [INFO ] Flatten gal took : 31 ms
[2024-06-01 03:08:00] [INFO ] Flatten gal took : 34 ms
[2024-06-01 03:08:00] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 183 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 183 transition count 265
Applied a total of 116 rules in 22 ms. Remains 183 /209 variables (removed 26) and now considering 265/355 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 183/209 places, 265/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 30 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 22 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 181/209 places, 263/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 23 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 179/209 places, 261/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 14 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 179/209 places, 261/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 15 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 181/209 places, 263/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 180 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 180 transition count 326
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 326/355 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 180/209 places, 326/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 13 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 181/209 places, 263/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 190 transition count 336
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 190 transition count 336
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 190 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 188 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 188 transition count 270
Applied a total of 106 rules in 14 ms. Remains 188 /209 variables (removed 21) and now considering 270/355 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 188/209 places, 270/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 13 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 178/209 places, 260/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 12 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 178/209 places, 260/355 transitions.
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:01] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 180 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 180 transition count 262
Applied a total of 122 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 262/355 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 180/209 places, 262/355 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:02] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 11 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 179/209 places, 261/355 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:02] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 13 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 178/209 places, 260/355 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 188 transition count 334
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 188 transition count 334
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 188 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 184 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 184 transition count 266
Applied a total of 114 rules in 11 ms. Remains 184 /209 variables (removed 25) and now considering 266/355 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 184/209 places, 266/355 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:08:02] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 11 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 178/209 places, 260/355 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:08:02] [INFO ] Input system was already deterministic with 260 transitions.
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:08:02] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:08:02] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-06-01 03:08:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 355 transitions and 1630 arcs took 5 ms.
Total runtime 87955 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 : AutonomousCar-PT-04b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-04b-CTLFireability-2023-15
BK_STOP 1717211283153
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 AutonomousCar-PT-04b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/701/ctl_0_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/701/ctl_1_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/701/ctl_2_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/701/ctl_3_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/701/ctl_4_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/701/ctl_5_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/701/ctl_6_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/701/ctl_7_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/701/ctl_8_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/701/ctl_9_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/701/ctl_10_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/701/ctl_11_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/701/ctl_12_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/701/ctl_13_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/701/ctl_14_
ctl formula name AutonomousCar-PT-04b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/701/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="AutonomousCar-PT-04b"
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 AutonomousCar-PT-04b, 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 r468-smll-171620167400274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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 ;