About the Execution of LTSMin+red for EisenbergMcGuire-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 527.831 | 93180.00 | 146045.00 | 522.90 | ???T???????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266300154.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 EisenbergMcGuire-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K 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 EisenbergMcGuire-PT-04-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717221166573
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:52:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:52:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:52:49] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-01 05:52:49] [INFO ] Transformed 196 places.
[2024-06-01 05:52:49] [INFO ] Transformed 448 transitions.
[2024-06-01 05:52:49] [INFO ] Found NUPN structural information;
[2024-06-01 05:52:49] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 64 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 420
Applied a total of 14 rules in 87 ms. Remains 189 /196 variables (removed 7) and now considering 420/448 (removed 28) transitions.
[2024-06-01 05:52:50] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
// Phase 1: matrix 256 rows 189 cols
[2024-06-01 05:52:50] [INFO ] Computed 13 invariants in 22 ms
[2024-06-01 05:52:50] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 05:52:50] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-06-01 05:52:50] [INFO ] Invariant cache hit.
[2024-06-01 05:52:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:52:51] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-06-01 05:52:51] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-06-01 05:52:51] [INFO ] Invariant cache hit.
[2024-06-01 05:52:51] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:52:55] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 20 ms to minimize.
[2024-06-01 05:52:55] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 4 ms to minimize.
[2024-06-01 05:52:55] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 4 ms to minimize.
[2024-06-01 05:52:56] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-06-01 05:52:56] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:52:56] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:52:56] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-06-01 05:52:56] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 3 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 3 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 4 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:52:57] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:52:58] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2024-06-01 05:52:59] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 3 ms to minimize.
[2024-06-01 05:52:59] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2024-06-01 05:52:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:52:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-06-01 05:53:00] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-01 05:53:00] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:53:00] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 5 ms to minimize.
[2024-06-01 05:53:00] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:53:01] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 4 ms to minimize.
[2024-06-01 05:53:01] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:53:02] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:53:02] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 4 ms to minimize.
[2024-06-01 05:53:02] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2024-06-01 05:53:02] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 05:53:03] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-06-01 05:53:03] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-06-01 05:53:04] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:53:05] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:08] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:53:12] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-06-01 05:53:12] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-01 05:53:12] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:14] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 05:53:15] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:53:15] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-06-01 05:53:15] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-06-01 05:53:16] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-06-01 05:53:16] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 3 ms to minimize.
[2024-06-01 05:53:18] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 4 ms to minimize.
[2024-06-01 05:53:18] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:19] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 05:53:19] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-06-01 05:53:20] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/445 variables, and 68 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:25] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:26] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 3 ms to minimize.
[2024-06-01 05:53:26] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:53:28] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 4 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-01 05:53:32] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:53:33] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:53:33] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:40] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-06-01 05:53:40] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-06-01 05:53:41] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-06-01 05:53:41] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-06-01 05:53:41] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-06-01 05:53:41] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-06-01 05:53:42] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-06-01 05:53:47] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:53:47] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-06-01 05:53:47] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2024-06-01 05:53:48] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/445 variables, and 89 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 76/76 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 420/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62020 ms. Remains : 189/196 places, 420/448 transitions.
Support contains 64 out of 189 places after structural reductions.
[2024-06-01 05:53:52] [INFO ] Flatten gal took : 127 ms
[2024-06-01 05:53:52] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:53:52] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40000 steps (8 resets) in 2602 ms. (15 steps per ms) remains 36/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
[2024-06-01 05:53:54] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-06-01 05:53:54] [INFO ] Invariant cache hit.
[2024-06-01 05:53:54] [INFO ] State equation strengthened by 91 read => feed constraints.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 145/189 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 05:53:54] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 05:53:54] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:53:54] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-01 05:53:54] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 3 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 2 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:53:55] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 4 ms to minimize.
[2024-06-01 05:53:56] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 17/30 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 3 ms to minimize.
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-06-01 05:53:57] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-06-01 05:53:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:53:59] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 5080ms, After SMT, problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 6 place count 186 transition count 373
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 94 place count 142 transition count 373
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 138 transition count 357
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 138 transition count 357
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 126 place count 126 transition count 345
Applied a total of 126 rules in 120 ms. Remains 126 /189 variables (removed 63) and now considering 345/420 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 126/189 places, 345/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 386205 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :22 out of 28
Probabilistic random walk after 386205 steps, saw 78880 distinct states, run finished after 3022 ms. (steps per millisecond=127 ) properties seen :22
[2024-06-01 05:54:02] [INFO ] Flow matrix only has 181 transitions (discarded 164 similar events)
// Phase 1: matrix 181 rows 126 cols
[2024-06-01 05:54:02] [INFO ] Computed 13 invariants in 3 ms
[2024-06-01 05:54:02] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 74/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/126 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:54:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/307 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 228 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 74/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/92 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/126 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:54:04] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 235 constraints, problems are : Problem set: 0 solved, 6 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 3185 ms.
Support contains 10 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 345/345 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 126 transition count 336
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 117 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 116 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 116 transition count 332
Applied a total of 20 rules in 38 ms. Remains 116 /126 variables (removed 10) and now considering 332/345 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 116/126 places, 332/345 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 461940 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :1 out of 5
Probabilistic random walk after 461940 steps, saw 93978 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :1
[2024-06-01 05:54:11] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-06-01 05:54:11] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 05:54:11] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 71/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/88 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 132/220 variables, 88/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 40/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/234 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 20/254 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/256 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:54:11] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 28/284 variables, 22/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/284 variables, 30/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/284 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 71/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/88 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:12] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 132/220 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/234 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 20/254 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/256 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:54:13] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:54:13] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:54:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:54:13] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 28/284 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 30/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/284 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/284 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 225 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 2546ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1040 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 116/116 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 503460 steps, run visited all 4 properties in 2659 ms. (steps per millisecond=189 )
Probabilistic random walk after 503460 steps, saw 102083 distinct states, run finished after 2664 ms. (steps per millisecond=188 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 05:54:17] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:54:17] [INFO ] Flatten gal took : 29 ms
[2024-06-01 05:54:17] [INFO ] Input system was already deterministic with 420 transitions.
Support contains 58 out of 189 places (down from 59) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 7 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 185/189 places, 404/420 transitions.
[2024-06-01 05:54:17] [INFO ] Flatten gal took : 23 ms
[2024-06-01 05:54:17] [INFO ] Flatten gal took : 23 ms
[2024-06-01 05:54:17] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 116 transition count 332
Applied a total of 146 rules in 39 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 116/189 places, 332/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 129 transition count 345
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 144 place count 117 transition count 333
Applied a total of 144 rules in 27 ms. Remains 117 /189 variables (removed 72) and now considering 333/420 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 117/189 places, 333/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 333 transitions.
RANDOM walk for 4193 steps (0 resets) in 20 ms. (199 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 5 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 6 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 185/189 places, 404/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 8 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 118 transition count 337
Applied a total of 142 rules in 27 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 118/189 places, 337/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 186 transition count 366
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 135 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 130 transition count 346
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 130 transition count 346
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 140 place count 119 transition count 335
Applied a total of 140 rules in 21 ms. Remains 119 /189 variables (removed 70) and now considering 335/420 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 119/189 places, 335/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:54:18] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 185 transition count 367
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 136 transition count 367
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 131 transition count 347
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 131 transition count 347
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 138 place count 120 transition count 336
Applied a total of 138 rules in 20 ms. Remains 120 /189 variables (removed 69) and now considering 336/420 (removed 84) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 120/189 places, 336/420 transitions.
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:54:18] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:54:19] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 6 place count 186 transition count 365
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 118 transition count 337
Applied a total of 142 rules in 20 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 118/189 places, 337/420 transitions.
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:54:19] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 116 transition count 332
Applied a total of 146 rules in 19 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 116/189 places, 332/420 transitions.
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:54:19] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:54:19] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:54:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 05:54:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 420 transitions and 1840 arcs took 5 ms.
Total runtime 90046 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 : EisenbergMcGuire-PT-04-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-04-CTLFireability-2023-15
BK_STOP 1717221259753
--------------------
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 EisenbergMcGuire-PT-04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/950/ctl_0_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/950/ctl_1_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/950/ctl_2_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/950/ctl_3_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/950/ctl_4_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/950/ctl_5_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/950/ctl_6_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/950/ctl_7_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/950/ctl_8_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/950/ctl_9_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/950/ctl_10_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/950/ctl_11_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/950/ctl_12_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/950/ctl_13_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/950/ctl_14_
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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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 r492-smll-171636266300154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 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 ;