About the Execution of GreatSPN+red for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9280.955 | 1046449.00 | 2925656.00 | 1398.80 | FTFFFTTFFTFFFTFF | 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.r575-smll-171734919700138.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 greatspnxred
Input is MedleyA-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717368477164
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:47:59] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-02 22:47:59] [INFO ] Transformed 252 places.
[2024-06-02 22:47:59] [INFO ] Transformed 543 transitions.
[2024-06-02 22:47:59] [INFO ] Found NUPN structural information;
[2024-06-02 22:47:59] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 100 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 103 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 225 transition count 500
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 225 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 223 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 223 transition count 498
Applied a total of 58 rules in 69 ms. Remains 223 /252 variables (removed 29) and now considering 498/541 (removed 43) transitions.
// Phase 1: matrix 498 rows 223 cols
[2024-06-02 22:47:59] [INFO ] Computed 7 invariants in 39 ms
[2024-06-02 22:48:00] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-02 22:48:00] [INFO ] Invariant cache hit.
[2024-06-02 22:48:00] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2024-06-02 22:48:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:07] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 26 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 2 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:48:10] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:48:10] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-06-02 22:48:10] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:48:10] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:48:11] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:48:11] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:48:13] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:48:14] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:48:14] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:48:14] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:48:14] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:48:14] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:48:15] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-06-02 22:48:15] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2024-06-02 22:48:15] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:48:15] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 4 ms to minimize.
[2024-06-02 22:48:15] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:48:16] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 2 ms to minimize.
[2024-06-02 22:48:16] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:48:16] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:48:16] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
[2024-06-02 22:48:17] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:20] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:48:20] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 6 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:48:22] [INFO ] Deduced a trap composed of 140 places in 187 ms of which 3 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-06-02 22:48:23] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:48:24] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-02 22:48:24] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:48:24] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:24] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 4 ms to minimize.
[2024-06-02 22:48:26] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:48:26] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:48:26] [INFO ] Deduced a trap composed of 155 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:48:27] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-02 22:48:27] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:48:27] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:48:27] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:48:27] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:48:28] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:48:28] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 3 ms to minimize.
[2024-06-02 22:48:28] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:48:28] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 3 ms to minimize.
[2024-06-02 22:48:29] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:48:29] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:48:30] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2024-06-02 22:48:30] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/721 variables, and 87 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:35] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 3 ms to minimize.
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:48:37] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:48:37] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:40] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-06-02 22:48:40] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:48:41] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:48:41] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:48:43] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:44] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:48:45] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:48:45] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 2 ms to minimize.
[2024-06-02 22:48:45] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:48:45] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 2 ms to minimize.
[2024-06-02 22:48:46] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:49] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:54] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 140 places in 209 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/721 variables, and 108 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 0/497 constraints, Known Traps: 101/101 constraints]
After SMT, in 60846ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Starting structural reductions in LTL mode, iteration 1 : 223/252 places, 498/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61870 ms. Remains : 223/252 places, 498/541 transitions.
Support contains 103 out of 223 places after structural reductions.
[2024-06-02 22:49:01] [INFO ] Flatten gal took : 134 ms
[2024-06-02 22:49:02] [INFO ] Flatten gal took : 86 ms
[2024-06-02 22:49:02] [INFO ] Input system was already deterministic with 498 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (1533 resets) in 2557 ms. (15 steps per ms) remains 67/78 properties
BEST_FIRST walk for 4000 steps (36 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 51 ms. (77 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (34 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (32 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (34 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (34 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (35 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (34 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
[2024-06-02 22:49:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/223 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-02 22:49:04] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 3 ms to minimize.
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 3 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:49:06] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:49:07] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:49:07] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:49:07] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 16/23 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-02 22:49:07] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:49:07] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:49:08] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 3/26 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-02 22:49:08] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:49:09] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:49:09] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
SMT process timed out in 5345ms, After SMT, problems are : Problem set: 6 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 81 edges and 223 vertex of which 4 / 223 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 220 transition count 475
Reduce places removed 19 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 29 rules applied. Total rules applied 49 place count 201 transition count 465
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 61 place count 191 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 190 transition count 463
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 62 place count 190 transition count 456
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 76 place count 183 transition count 456
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 180 transition count 450
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 180 transition count 450
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 120 place count 161 transition count 431
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 160 transition count 429
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 160 transition count 429
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 159 transition count 427
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 159 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 156 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 156 transition count 422
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 152 transition count 418
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 152 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 151 transition count 423
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 151 transition count 418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 161 place count 146 transition count 418
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 145 transition count 416
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 145 transition count 416
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 164 place count 145 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 145 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 144 transition count 414
Applied a total of 166 rules in 226 ms. Remains 144 /223 variables (removed 79) and now considering 414/498 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 144/223 places, 414/498 transitions.
RANDOM walk for 40000 steps (2651 resets) in 833 ms. (47 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4003 steps (58 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (54 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (53 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (55 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (56 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (59 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (58 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (46 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (56 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (58 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (57 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (56 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (56 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (59 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (55 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (60 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (58 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (57 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (56 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (55 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
Interrupted probabilistic random walk after 388656 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :42 out of 59
Probabilistic random walk after 388656 steps, saw 66570 distinct states, run finished after 3007 ms. (steps per millisecond=129 ) properties seen :42
[2024-06-02 22:49:13] [INFO ] Flow matrix only has 412 transitions (discarded 2 similar events)
// Phase 1: matrix 412 rows 144 cols
[2024-06-02 22:49:13] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:49:13] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 109/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:49:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:49:13] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-02 22:49:13] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:49:13] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:49:14] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:49:14] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-02 22:49:14] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:49:14] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-02 22:49:14] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 412/556 variables, 144/160 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 6/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 166 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 111/144 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-02 22:49:15] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:49:15] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:49:15] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:49:16] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:49:16] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:49:16] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:49:16] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:49:16] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 5 (OVERLAPS) 412/556 variables, 144/168 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 6/174 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 12/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 186 constraints, problems are : Problem set: 5 solved, 12 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 17/17 constraints]
After SMT, in 47201ms problems are : Problem set: 5 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 414/414 transitions.
Graph (trivial) has 89 edges and 144 vertex of which 2 / 144 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 143 transition count 404
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 135 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 134 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 134 transition count 400
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 131 transition count 400
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 41 place count 115 transition count 372
Iterating global reduction 3 with 16 rules applied. Total rules applied 57 place count 115 transition count 372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 115 transition count 371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 114 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 113 transition count 369
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 113 transition count 369
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 75 place count 106 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 104 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 104 transition count 356
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 103 transition count 354
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 103 transition count 354
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 91 place count 98 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 98 transition count 352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 97 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 97 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 96 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 96 transition count 346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 93 transition count 379
Free-agglomeration rule applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 126 place count 93 transition count 358
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 155 place count 76 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 166 place count 76 transition count 335
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 76 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 75 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 75 transition count 332
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 75 transition count 336
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 180 place count 72 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 182 place count 72 transition count 330
Applied a total of 182 rules in 170 ms. Remains 72 /144 variables (removed 72) and now considering 330/414 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 72/144 places, 330/414 transitions.
RANDOM walk for 40000 steps (3543 resets) in 586 ms. (68 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (853 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (853 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (884 resets) in 117 ms. (339 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (143 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (970 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (821 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (892 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (908 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (897 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (821 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 308 transitions (discarded 22 similar events)
// Phase 1: matrix 308 rows 72 cols
[2024-06-02 22:50:01] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:50:01] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 47/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:50:01] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 308/380 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 96 constraints, problems are : Problem set: 0 solved, 10 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 47/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:50:01] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:50:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:50:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:50:02] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 308/380 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 16/100 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:50:04] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:50:05] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:50:05] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 113 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 8/8 constraints]
After SMT, in 4752ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 1 properties in 34055 ms.
Support contains 23 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 330/330 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 70 transition count 321
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 70 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 68 transition count 319
Applied a total of 14 rules in 42 ms. Remains 68 /72 variables (removed 4) and now considering 319/330 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 68/72 places, 319/330 transitions.
RANDOM walk for 40000 steps (3537 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (854 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (893 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (136 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (969 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (821 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (896 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (914 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (895 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (820 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1165307 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :8 out of 9
Probabilistic random walk after 1165307 steps, saw 208672 distinct states, run finished after 3004 ms. (steps per millisecond=387 ) properties seen :8
[2024-06-02 22:50:43] [INFO ] Flow matrix only has 288 transitions (discarded 31 similar events)
// Phase 1: matrix 288 rows 68 cols
[2024-06-02 22:50:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:50:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/297 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/356 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/356 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/297 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/356 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/356 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 319/319 transitions.
Graph (trivial) has 43 edges and 68 vertex of which 2 / 68 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 67 transition count 310
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 60 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 60 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 58 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 58 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 25 place count 56 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 56 transition count 284
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 56 transition count 274
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 57 place count 46 transition count 264
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 46 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 44 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 44 transition count 350
Applied a total of 63 rules in 139 ms. Remains 44 /68 variables (removed 24) and now considering 350/319 (removed -31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 44/68 places, 350/319 transitions.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 50 ms
[2024-06-02 22:50:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 49 ms
[2024-06-02 22:50:44] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 80 out of 223 places (down from 89) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 7 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 204/223 places, 464/498 transitions.
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 37 ms
[2024-06-02 22:50:44] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 460
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 460
Applied a total of 42 rules in 9 ms. Remains 202 /223 variables (removed 21) and now considering 460/498 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 202/223 places, 460/498 transitions.
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 35 ms
[2024-06-02 22:50:44] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 9 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:50:44] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:50:44] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 8 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 203/223 places, 461/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 461 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 227 edges and 223 vertex of which 8 / 223 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 216 transition count 446
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 171 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 169 transition count 442
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 97 place count 169 transition count 431
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 119 place count 158 transition count 431
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 142 place count 135 transition count 388
Iterating global reduction 3 with 23 rules applied. Total rules applied 165 place count 135 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 165 place count 135 transition count 387
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 134 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 133 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 133 transition count 371
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 209 place count 113 transition count 351
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 108 transition count 331
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 108 transition count 331
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 106 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 106 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 234 place count 106 transition count 316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 106 transition count 315
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 105 transition count 315
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 248 place count 99 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 97 transition count 301
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 97 transition count 301
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 254 place count 95 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 95 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 94 transition count 296
Applied a total of 257 rules in 106 ms. Remains 94 /223 variables (removed 129) and now considering 296/498 (removed 202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 94/223 places, 296/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 6812 steps (1114 resets) in 47 ms. (141 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 8 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 203/223 places, 462/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 463
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 463
Applied a total of 38 rules in 8 ms. Remains 204 /223 variables (removed 19) and now considering 463/498 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 204/223 places, 463/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 222 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 212 transition count 448
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 173 transition count 444
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 171 transition count 440
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 93 place count 167 transition count 440
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 93 place count 167 transition count 430
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 135 place count 135 transition count 389
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 135 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 135 transition count 388
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 159 place count 134 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 133 transition count 372
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 133 transition count 372
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 195 place count 116 transition count 355
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 200 place count 111 transition count 335
Iterating global reduction 4 with 5 rules applied. Total rules applied 205 place count 111 transition count 335
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 109 transition count 331
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 109 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 218 place count 109 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 218 place count 109 transition count 321
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 220 place count 108 transition count 321
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 228 place count 104 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 102 transition count 309
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 102 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 100 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 100 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 100 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 99 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 99 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 98 transition count 303
Applied a total of 240 rules in 92 ms. Remains 98 /223 variables (removed 125) and now considering 303/498 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 98/223 places, 303/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 8 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 203/223 places, 462/498 transitions.
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:45] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:50:45] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 6 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:50:46] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 5 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 204/223 places, 464/498 transitions.
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:50:46] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 238 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 212 transition count 443
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 168 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 166 transition count 439
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 166 transition count 430
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 134 place count 136 transition count 391
Iterating global reduction 3 with 21 rules applied. Total rules applied 155 place count 136 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 136 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 135 transition count 390
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 195 place count 116 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 111 transition count 347
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 111 transition count 347
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 109 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 109 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 109 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 221 place count 109 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 107 transition count 329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 101 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 99 transition count 315
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 99 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 97 transition count 311
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 97 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 310
Applied a total of 246 rules in 67 ms. Remains 96 /223 variables (removed 127) and now considering 310/498 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 96/223 places, 310/498 transitions.
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:50:46] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 4 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 203/223 places, 461/498 transitions.
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:50:46] [INFO ] Input system was already deterministic with 461 transitions.
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:50:46] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:50:46] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 22:50:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 498 transitions and 2346 arcs took 6 ms.
Total runtime 167671 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MedleyA-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 223
TRANSITIONS: 498
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.004s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1034
MODEL NAME: /home/mcc/execution/413/model
223 places, 498 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-18-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717369523613
--------------------
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
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="MedleyA-PT-18"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-18, 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 r575-smll-171734919700138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 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 ;