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-171734919700130.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-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366281438

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:11:23] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-02 22:11:23] [INFO ] Transformed 248 places.
[2024-06-02 22:11:23] [INFO ] Transformed 591 transitions.
[2024-06-02 22:11:23] [INFO ] Found NUPN structural information;
[2024-06-02 22:11:23] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 110 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 217 transition count 539
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 217 transition count 539
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 217 transition count 523
Applied a total of 78 rules in 64 ms. Remains 217 /248 variables (removed 31) and now considering 523/589 (removed 66) transitions.
// Phase 1: matrix 523 rows 217 cols
[2024-06-02 22:11:23] [INFO ] Computed 7 invariants in 46 ms
[2024-06-02 22:11:24] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-02 22:11:24] [INFO ] Invariant cache hit.
[2024-06-02 22:11:24] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-02 22:11:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:11:31] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 30 ms to minimize.
[2024-06-02 22:11:31] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 3 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 3 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 3 ms to minimize.
[2024-06-02 22:11:32] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:11:33] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:11:34] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-06-02 22:11:34] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:11:34] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-06-02 22:11:34] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 2 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 101 places in 191 ms of which 3 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 2 ms to minimize.
[2024-06-02 22:11:35] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:11:36] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:11:36] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-06-02 22:11:36] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:11:37] [INFO ] Deduced a trap composed of 129 places in 207 ms of which 3 ms to minimize.
[2024-06-02 22:11:38] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 3 ms to minimize.
[2024-06-02 22:11:38] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:11:38] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 2 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 2 ms to minimize.
[2024-06-02 22:11:40] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 3 ms to minimize.
[2024-06-02 22:11:40] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:11:40] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 5 ms to minimize.
[2024-06-02 22:11:40] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 3 ms to minimize.
[2024-06-02 22:11:41] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:11:41] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 4 ms to minimize.
[2024-06-02 22:11:41] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:11:41] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:11:42] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-06-02 22:11:42] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:11:43] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:11:46] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-02 22:11:46] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2024-06-02 22:11:46] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:11:47] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:11:47] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:11:48] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:11:51] [INFO ] Deduced a trap composed of 100 places in 226 ms of which 4 ms to minimize.
[2024-06-02 22:11:52] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 4 ms to minimize.
[2024-06-02 22:11:52] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 4 ms to minimize.
[2024-06-02 22:11:53] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2024-06-02 22:11:53] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 5 ms to minimize.
[2024-06-02 22:11:54] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 4 ms to minimize.
[2024-06-02 22:11:54] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:11:54] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 4 ms to minimize.
(s134 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.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 0.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 1.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 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/740 variables, and 61 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:12:00] [INFO ] Deduced a trap composed of 127 places in 314 ms of which 4 ms to minimize.
[2024-06-02 22:12:00] [INFO ] Deduced a trap composed of 46 places in 328 ms of which 4 ms to minimize.
[2024-06-02 22:12:00] [INFO ] Deduced a trap composed of 129 places in 340 ms of which 16 ms to minimize.
[2024-06-02 22:12:01] [INFO ] Deduced a trap composed of 129 places in 280 ms of which 4 ms to minimize.
[2024-06-02 22:12:01] [INFO ] Deduced a trap composed of 132 places in 361 ms of which 3 ms to minimize.
[2024-06-02 22:12:03] [INFO ] Deduced a trap composed of 127 places in 313 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:12:07] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2024-06-02 22:12:07] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2024-06-02 22:12:08] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:12:08] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:12:12] [INFO ] Deduced a trap composed of 122 places in 199 ms of which 3 ms to minimize.
[2024-06-02 22:12:12] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:12:16] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:12:16] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 22:12:20] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2024-06-02 22:12:20] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2024-06-02 22:12:20] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 2 ms to minimize.
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 2 ms to minimize.
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 130 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 110 places in 196 ms of which 3 ms to minimize.
[2024-06-02 22:12:22] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 2 ms to minimize.
[2024-06-02 22:12:22] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 2 ms to minimize.
[2024-06-02 22:12:22] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:12:22] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 217/740 variables, and 86 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 0/522 constraints, Known Traps: 79/79 constraints]
After SMT, in 60963ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 61013ms
Starting structural reductions in LTL mode, iteration 1 : 217/248 places, 523/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61944 ms. Remains : 217/248 places, 523/589 transitions.
Support contains 110 out of 217 places after structural reductions.
[2024-06-02 22:12:26] [INFO ] Flatten gal took : 122 ms
[2024-06-02 22:12:26] [INFO ] Flatten gal took : 74 ms
[2024-06-02 22:12:26] [INFO ] Input system was already deterministic with 523 transitions.
Reduction of identical properties reduced properties to check from 99 to 98
RANDOM walk for 40000 steps (1376 resets) in 2225 ms. (17 steps per ms) remains 87/98 properties
BEST_FIRST walk for 4004 steps (28 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (29 resets) in 59 ms. (66 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (29 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 45 ms. (87 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (27 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (29 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (29 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (27 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (27 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 73 ms. (54 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (26 resets) in 48 ms. (81 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (29 resets) in 55 ms. (71 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (27 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (28 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (29 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (28 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
[2024-06-02 22:12:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/217 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 81 unsolved
[2024-06-02 22:12:29] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 2 ms to minimize.
[2024-06-02 22:12:29] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:12:29] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:12:29] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 3 ms to minimize.
[2024-06-02 22:12:29] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
[2024-06-02 22:12:30] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:12:30] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 3 ms to minimize.
[2024-06-02 22:12:30] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 2 ms to minimize.
[2024-06-02 22:12:30] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-06-02 22:12:30] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:12:31] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-06-02 22:12:31] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2024-06-02 22:12:31] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:12:31] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 3 ms to minimize.
Problem AtomicPropp56 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 14/21 constraints. Problems are: Problem set: 7 solved, 80 unsolved
[2024-06-02 22:12:32] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:12:32] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/23 constraints. Problems are: Problem set: 7 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/740 variables, and 23 constraints, problems are : Problem set: 7 solved, 80 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 7 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 120/217 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 16/23 constraints. Problems are: Problem set: 7 solved, 80 unsolved
[2024-06-02 22:12:33] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:12:34] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:12:34] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:12:34] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 2 ms to minimize.
[2024-06-02 22:12:34] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:12:35] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:12:35] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:12:35] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2024-06-02 22:12:35] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 9/32 constraints. Problems are: Problem set: 7 solved, 80 unsolved
[2024-06-02 22:12:36] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-06-02 22:12:36] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 2 ms to minimize.
[2024-06-02 22:12:36] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 3/35 constraints. Problems are: Problem set: 7 solved, 80 unsolved
[2024-06-02 22:12:37] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:12:37] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:12:37] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 3/38 constraints. Problems are: Problem set: 7 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 217/740 variables, and 38 constraints, problems are : Problem set: 7 solved, 80 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 0/87 constraints, Known Traps: 31/31 constraints]
After SMT, in 10203ms problems are : Problem set: 7 solved, 80 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 97 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 70 edges and 217 vertex of which 3 / 217 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 215 transition count 504
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 199 transition count 501
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 196 transition count 501
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 196 transition count 492
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 57 place count 187 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 184 transition count 487
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 184 transition count 487
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 173 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 173 transition count 475
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 172 transition count 473
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 172 transition count 473
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 4 with 2 rules applied. Total rules applied 90 place count 171 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 92 place count 170 transition count 473
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 116 place count 170 transition count 449
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 120 place count 166 transition count 445
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 166 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 164 transition count 452
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 135 place count 164 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 142 place count 157 transition count 445
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 157 transition count 445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 148 place count 154 transition count 445
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 154 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 153 transition count 444
Applied a total of 151 rules in 206 ms. Remains 153 /217 variables (removed 64) and now considering 444/523 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 153/217 places, 444/523 transitions.
RANDOM walk for 40000 steps (2855 resets) in 872 ms. (45 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (59 resets) in 30 ms. (129 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (58 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (61 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (59 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (58 resets) in 21 ms. (181 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (47 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (55 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (55 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (55 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (59 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (60 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (59 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (56 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (56 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (59 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (58 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (57 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (60 resets) in 16 ms. (235 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
Interrupted probabilistic random walk after 274480 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :33 out of 80
Probabilistic random walk after 274480 steps, saw 53785 distinct states, run finished after 3015 ms. (steps per millisecond=91 ) properties seen :33
[2024-06-02 22:12:41] [INFO ] Flow matrix only has 440 transitions (discarded 4 similar events)
// Phase 1: matrix 440 rows 153 cols
[2024-06-02 22:12:41] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:12:41] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 92/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 22:12:42] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2024-06-02 22:12:42] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:12:42] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:12:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-02 22:12:43] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 440/593 variables, 153/176 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 11/187 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 22:12:46] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2024-06-02 22:12:46] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/593 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 189 constraints, problems are : Problem set: 0 solved, 47 unsolved in 6779 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 92/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 22:12:49] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 22:12:49] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 6 (OVERLAPS) 440/593 variables, 153/180 constraints. Problems are: Problem set: 14 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 11/191 constraints. Problems are: Problem set: 14 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 33/224 constraints. Problems are: Problem set: 14 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 224 constraints, problems are : Problem set: 14 solved, 33 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 33/47 constraints, Known Traps: 20/20 constraints]
After SMT, in 51890ms problems are : Problem set: 14 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 444/444 transitions.
Graph (trivial) has 53 edges and 153 vertex of which 3 / 153 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 151 transition count 436
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 146 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 145 transition count 435
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 145 transition count 432
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 142 transition count 432
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 29 place count 132 transition count 414
Iterating global reduction 3 with 10 rules applied. Total rules applied 39 place count 132 transition count 414
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 132 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 41 place count 131 transition count 413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 41 place count 131 transition count 412
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 43 place count 130 transition count 412
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 49 place count 127 transition count 409
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 57 place count 123 transition count 418
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 59 place count 123 transition count 416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 121 transition count 420
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 73 place count 121 transition count 410
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 83 place count 111 transition count 410
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 87 place count 111 transition count 414
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 91 place count 107 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 95 place count 107 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 96 place count 106 transition count 409
Applied a total of 96 rules in 183 ms. Remains 106 /153 variables (removed 47) and now considering 409/444 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 106/153 places, 409/444 transitions.
RANDOM walk for 40000 steps (5666 resets) in 985 ms. (40 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (122 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (126 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (137 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (132 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (143 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (138 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (109 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (124 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (125 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (100 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (126 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (130 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (138 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (106 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (128 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (127 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (136 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (128 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (126 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (126 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (125 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (127 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (131 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (130 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (127 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (127 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (127 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (125 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (128 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (88 resets) in 16 ms. (235 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4002 steps (128 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (124 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 370949 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :24 out of 31
Probabilistic random walk after 370949 steps, saw 73066 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :24
[2024-06-02 22:13:37] [INFO ] Flow matrix only has 387 transitions (discarded 22 similar events)
// Phase 1: matrix 387 rows 106 cols
[2024-06-02 22:13:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:13:37] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:13:37] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:13:38] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 387/493 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 129 constraints, problems are : Problem set: 0 solved, 7 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 88/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 387/493 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 136 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 4207ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 6415 ms.
Support contains 18 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 409/409 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 105 transition count 405
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 102 transition count 405
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 94 transition count 375
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 94 transition count 375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 92 transition count 373
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 91 transition count 361
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 91 transition count 361
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 91 transition count 343
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 66 place count 73 transition count 343
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 73 transition count 346
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 70 transition count 346
Applied a total of 72 rules in 54 ms. Remains 70 /106 variables (removed 36) and now considering 346/409 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 70/106 places, 346/409 transitions.
RANDOM walk for 40000 steps (19 resets) in 809 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (4444 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (91 resets) in 480 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 397 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (33 resets) in 326 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (19 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 415805 steps, run visited all 7 properties in 1219 ms. (steps per millisecond=341 )
Probabilistic random walk after 415805 steps, saw 76724 distinct states, run finished after 1227 ms. (steps per millisecond=338 ) properties seen :7
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-17-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:13:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:13:50] [INFO ] Flatten gal took : 51 ms
[2024-06-02 22:13:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:13:50] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:13:50] [INFO ] Input system was already deterministic with 523 transitions.
Support contains 81 out of 217 places (down from 96) after GAL structural reductions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 11 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 190/217 places, 458/523 transitions.
[2024-06-02 22:13:50] [INFO ] Flatten gal took : 35 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 11 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 228 edges and 217 vertex of which 9 / 217 are part of one of the 3 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 210 transition count 486
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 180 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 178 transition count 468
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 163 transition count 468
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 118 place count 141 transition count 427
Iterating global reduction 3 with 22 rules applied. Total rules applied 140 place count 141 transition count 427
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 156 place count 141 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 410
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 158 place count 140 transition count 410
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 190 place count 124 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 124 transition count 393
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 194 place count 121 transition count 363
Iterating global reduction 5 with 3 rules applied. Total rules applied 197 place count 121 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 206 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 214 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 116 transition count 349
Applied a total of 215 rules in 82 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 116/217 places, 349/523 transitions.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 194 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 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 1 with 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 181 transition count 470
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 165 transition count 470
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 117 place count 144 transition count 431
Iterating global reduction 3 with 21 rules applied. Total rules applied 138 place count 144 transition count 431
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 154 place count 144 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 144 transition count 414
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 156 place count 143 transition count 414
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 188 place count 127 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 127 transition count 397
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 125 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 125 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 201 place count 125 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 209 place count 121 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 121 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 120 transition count 366
Applied a total of 211 rules in 91 ms. Remains 120 /217 variables (removed 97) and now considering 366/523 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 120/217 places, 366/523 transitions.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 199 transition count 493
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 199 transition count 493
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 199 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 198 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 198 transition count 474
Applied a total of 55 rules in 10 ms. Remains 198 /217 variables (removed 19) and now considering 474/523 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 198/217 places, 474/523 transitions.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 29 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:13:51] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 217 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 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 1 with 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 181 transition count 473
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 168 transition count 473
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 112 place count 146 transition count 432
Iterating global reduction 3 with 22 rules applied. Total rules applied 134 place count 146 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 146 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 146 transition count 415
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 152 place count 145 transition count 415
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 184 place count 129 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 129 transition count 398
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 126 transition count 368
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 126 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 199 place count 126 transition count 360
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 5 with 8 rules applied. Total rules applied 207 place count 122 transition count 356
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 122 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 121 transition count 355
Applied a total of 209 rules in 95 ms. Remains 121 /217 variables (removed 96) and now considering 355/523 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 121/217 places, 355/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 194 transition count 484
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 194 transition count 484
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 64 place count 194 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 192 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 192 transition count 462
Applied a total of 68 rules in 9 ms. Remains 192 /217 variables (removed 25) and now considering 462/523 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 192/217 places, 462/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 235 edges and 217 vertex of which 9 / 217 are part of one of the 3 SCC in 0 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 210 transition count 484
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 66 place count 178 transition count 469
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 94 place count 164 transition count 469
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 117 place count 141 transition count 426
Iterating global reduction 2 with 23 rules applied. Total rules applied 140 place count 141 transition count 426
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 141 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 409
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 158 place count 140 transition count 409
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 190 place count 124 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 124 transition count 392
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 121 transition count 362
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 121 transition count 354
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 213 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 116 transition count 349
Applied a total of 214 rules in 47 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 116/217 places, 349/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 10 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 190/217 places, 458/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 9 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 11 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:13:52] [INFO ] Input system was already deterministic with 456 transitions.
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:13:52] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:13:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 22:13:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 217 places, 523 transitions and 2532 arcs took 6 ms.
Total runtime 149698 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 217
TRANSITIONS: 523
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
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: 975
MODEL NAME: /home/mcc/execution/411/model
217 places, 523 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-17-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA MedleyA-PT-17-CTLFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717367684934

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-17"
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-17, 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-171734919700130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;