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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 238K 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-22-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717387268231

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 04:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 04:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 04:01:10] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-03 04:01:10] [INFO ] Transformed 307 places.
[2024-06-03 04:01:10] [INFO ] Transformed 740 transitions.
[2024-06-03 04:01:10] [INFO ] Found NUPN structural information;
[2024-06-03 04:01:10] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1162 resets) in 3633 ms. (11 steps per ms) remains 8/11 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (248 resets) in 694 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (238 resets) in 268 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (239 resets) in 842 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (276 resets) in 338 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (241 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (231 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (271 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (242 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
// Phase 1: matrix 740 rows 307 cols
[2024-06-03 04:01:13] [INFO ] Computed 24 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 96/237 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 96/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 70/307 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 70/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 638 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2122 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 96/237 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 96/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 04:01:16] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 81 ms to minimize.
[2024-06-03 04:01:16] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 04:01:17] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 3 ms to minimize.
[2024-06-03 04:01:17] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 04:01:17] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 70/307 variables, 14/266 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 70/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 04:01:18] [INFO ] Deduced a trap composed of 37 places in 346 ms of which 3 ms to minimize.
[2024-06-03 04:01:18] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 5 ms to minimize.
[2024-06-03 04:01:19] [INFO ] Deduced a trap composed of 85 places in 328 ms of which 6 ms to minimize.
[2024-06-03 04:01:19] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 5 ms to minimize.
[2024-06-03 04:01:20] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 5 ms to minimize.
[2024-06-03 04:01:20] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 3 ms to minimize.
[2024-06-03 04:01:20] [INFO ] Deduced a trap composed of 56 places in 403 ms of which 5 ms to minimize.
SMT process timed out in 7809ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 141 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 305 transition count 736
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 302 transition count 730
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 21 place count 296 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 21 place count 296 transition count 725
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 292 transition count 725
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 66 place count 255 transition count 683
Iterating global reduction 3 with 37 rules applied. Total rules applied 103 place count 255 transition count 683
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 255 transition count 680
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 254 transition count 679
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 254 transition count 679
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 122 place count 247 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 246 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 139 place count 246 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 245 transition count 666
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 245 transition count 662
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 149 place count 241 transition count 662
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 153 place count 241 transition count 663
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 157 place count 237 transition count 663
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 166 place count 237 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 237 transition count 662
Applied a total of 167 rules in 508 ms. Remains 237 /307 variables (removed 70) and now considering 662/740 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 237/307 places, 662/740 transitions.
RANDOM walk for 40000 steps (1294 resets) in 973 ms. (41 steps per ms) remains 6/8 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (271 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (263 resets) in 175 ms. (227 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (318 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (273 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (262 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (303 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
// Phase 1: matrix 662 rows 237 cols
[2024-06-03 04:01:22] [INFO ] Computed 23 invariants in 8 ms
[2024-06-03 04:01:22] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 84/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 57/232 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 660/892 variables, 232/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 124/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/898 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/899 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/899 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/899 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 899/899 variables, and 384 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 237/237 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 84/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 57/232 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:24] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 4 ms to minimize.
[2024-06-03 04:01:24] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 4 ms to minimize.
[2024-06-03 04:01:24] [INFO ] Deduced a trap composed of 24 places in 402 ms of which 5 ms to minimize.
[2024-06-03 04:01:25] [INFO ] Deduced a trap composed of 62 places in 280 ms of which 3 ms to minimize.
[2024-06-03 04:01:25] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 4 ms to minimize.
[2024-06-03 04:01:25] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 3 ms to minimize.
[2024-06-03 04:01:26] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 4 ms to minimize.
[2024-06-03 04:01:26] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 3 ms to minimize.
[2024-06-03 04:01:26] [INFO ] Deduced a trap composed of 51 places in 321 ms of which 4 ms to minimize.
[2024-06-03 04:01:27] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-06-03 04:01:27] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:27] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 4 ms to minimize.
[2024-06-03 04:01:28] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-03 04:01:28] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 3 ms to minimize.
[2024-06-03 04:01:28] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 3 ms to minimize.
[2024-06-03 04:01:28] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-06-03 04:01:29] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-06-03 04:01:29] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 3 ms to minimize.
[2024-06-03 04:01:29] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 4 ms to minimize.
[2024-06-03 04:01:30] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 660/892 variables, 232/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 124/399 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/892 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:30] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 3 ms to minimize.
[2024-06-03 04:01:31] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 4 ms to minimize.
[2024-06-03 04:01:31] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/898 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/898 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:32] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 3 ms to minimize.
[2024-06-03 04:01:33] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 4 ms to minimize.
[2024-06-03 04:01:33] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 3 ms to minimize.
[2024-06-03 04:01:33] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-06-03 04:01:34] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/898 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:35] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 4 ms to minimize.
[2024-06-03 04:01:36] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/898 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:36] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 3 ms to minimize.
[2024-06-03 04:01:37] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 04:01:38] [INFO ] Deduced a trap composed of 40 places in 365 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/898 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/898 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/899 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/899 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/899 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 899/899 variables, and 422 constraints, problems are : Problem set: 0 solved, 5 unsolved in 17177 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 237/237 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 33/33 constraints]
After SMT, in 18581ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2956 ms.
Support contains 56 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 662/662 transitions.
Graph (complete) has 1009 edges and 237 vertex of which 234 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 234 transition count 647
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 20 rules applied. Total rules applied 34 place count 221 transition count 640
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 215 transition count 640
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 215 transition count 638
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 213 transition count 638
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 67 place count 190 transition count 600
Iterating global reduction 3 with 23 rules applied. Total rules applied 90 place count 190 transition count 600
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 184 transition count 586
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 184 transition count 586
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 183 transition count 583
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 183 transition count 583
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 136 place count 167 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 167 transition count 566
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 165 transition count 563
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 165 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 143 place count 164 transition count 570
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 164 transition count 569
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 164 transition count 563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 156 place count 158 transition count 563
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 163 place count 158 transition count 564
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 171 place count 151 transition count 563
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 150 transition count 559
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 150 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 150 transition count 558
Applied a total of 174 rules in 165 ms. Remains 150 /237 variables (removed 87) and now considering 558/662 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 150/237 places, 558/662 transitions.
RANDOM walk for 40000 steps (2251 resets) in 1663 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (494 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (512 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 521493 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 2
Probabilistic random walk after 521493 steps, saw 103334 distinct states, run finished after 3007 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-03 04:01:47] [INFO ] Flow matrix only has 522 transitions (discarded 36 similar events)
// Phase 1: matrix 522 rows 150 cols
[2024-06-03 04:01:47] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 04:01:47] [INFO ] State equation strengthened by 193 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/146 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 522/670 variables, 148/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 193/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/672 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/672 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/672 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/146 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:01:48] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-03 04:01:48] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-03 04:01:48] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 2 ms to minimize.
[2024-06-03 04:01:48] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 3 ms to minimize.
[2024-06-03 04:01:49] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 2 ms to minimize.
[2024-06-03 04:01:49] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
[2024-06-03 04:01:49] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-03 04:01:49] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-03 04:01:49] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 2 ms to minimize.
[2024-06-03 04:01:50] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/148 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 522/670 variables, 148/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 193/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:01:50] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/672 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/672 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/672 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/672 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3877 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 4388ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 411 ms.
Support contains 56 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 558/558 transitions.
Applied a total of 0 rules in 27 ms. Remains 150 /150 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 150/150 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 558/558 transitions.
Applied a total of 0 rules in 13 ms. Remains 150 /150 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-06-03 04:01:52] [INFO ] Flow matrix only has 522 transitions (discarded 36 similar events)
[2024-06-03 04:01:52] [INFO ] Invariant cache hit.
[2024-06-03 04:01:52] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-03 04:01:52] [INFO ] Flow matrix only has 522 transitions (discarded 36 similar events)
[2024-06-03 04:01:52] [INFO ] Invariant cache hit.
[2024-06-03 04:01:52] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-06-03 04:01:53] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-06-03 04:01:53] [INFO ] Redundant transitions in 59 ms returned []
Running 557 sub problems to find dead transitions.
[2024-06-03 04:01:53] [INFO ] Flow matrix only has 522 transitions (discarded 36 similar events)
[2024-06-03 04:01:53] [INFO ] Invariant cache hit.
[2024-06-03 04:01:53] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/149 variables, 9/23 constraints. Problems are: Problem set: 144 solved, 413 unsolved
[2024-06-03 04:02:03] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 18 ms to minimize.
[2024-06-03 04:02:03] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-06-03 04:02:03] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-03 04:02:03] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-06-03 04:02:03] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-06-03 04:02:04] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 2 ms to minimize.
[2024-06-03 04:02:04] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-06-03 04:02:04] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 4 ms to minimize.
[2024-06-03 04:02:05] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 2 ms to minimize.
[2024-06-03 04:02:05] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-06-03 04:02:05] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-03 04:02:05] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-06-03 04:02:05] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-06-03 04:02:06] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-06-03 04:02:06] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-06-03 04:02:07] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-06-03 04:02:07] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-06-03 04:02:08] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 2 ms to minimize.
[2024-06-03 04:02:08] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2024-06-03 04:02:08] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 3 ms to minimize.
Problem TDEAD311 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/43 constraints. Problems are: Problem set: 145 solved, 412 unsolved
[2024-06-03 04:02:11] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-06-03 04:02:13] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 3 ms to minimize.
[2024-06-03 04:02:13] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-06-03 04:02:13] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
Problem TDEAD398 is UNSAT
[2024-06-03 04:02:14] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-03 04:02:14] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 2 ms to minimize.
[2024-06-03 04:02:15] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 7/50 constraints. Problems are: Problem set: 147 solved, 410 unsolved
[2024-06-03 04:02:16] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/51 constraints. Problems are: Problem set: 147 solved, 410 unsolved
[2024-06-03 04:02:19] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-06-03 04:02:20] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 2/53 constraints. Problems are: Problem set: 147 solved, 410 unsolved
[2024-06-03 04:02:25] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 2 ms to minimize.
[2024-06-03 04:02:26] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 32706ms, After SMT, problems are : Problem set: 147 solved, 410 unsolved
Search for dead transitions found 147 dead transitions in 32725ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/150 places, 411/558 transitions.
Applied a total of 0 rules in 14 ms. Remains 150 /150 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-03 04:02:26] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33877 ms. Remains : 150/150 places, 411/558 transitions.
RANDOM walk for 40000 steps (2244 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (502 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (513 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 525215 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 525215 steps, saw 104124 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 411 rows 150 cols
[2024-06-03 04:02:29] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 04:02:29] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/146 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/148 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 411/559 variables, 148/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 109/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/561 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/561 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 282 constraints, problems are : Problem set: 0 solved, 2 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/146 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:02:30] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2024-06-03 04:02:30] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 2 ms to minimize.
[2024-06-03 04:02:30] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-06-03 04:02:30] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-03 04:02:30] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-06-03 04:02:31] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:02:31] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/148 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 411/559 variables, 148/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 109/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:02:31] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/561 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/561 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2900 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3454ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 56 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 411/411 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 150/150 places, 411/411 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 411/411 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-06-03 04:02:33] [INFO ] Invariant cache hit.
[2024-06-03 04:02:33] [INFO ] Implicit Places using invariants in 182 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/150 places, 411/411 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 201 ms. Remains : 149/150 places, 411/411 transitions.
RANDOM walk for 40000 steps (2261 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (496 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (506 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 696744 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :1 out of 2
Probabilistic random walk after 696744 steps, saw 137132 distinct states, run finished after 3005 ms. (steps per millisecond=231 ) properties seen :1
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 411 rows 149 cols
[2024-06-03 04:02:36] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 04:02:36] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/143 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/145 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 409/554 variables, 145/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 89/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/559 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/560 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/560 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 149/149 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 04:02:36] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 38/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 04:02:37] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-03 04:02:37] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/145 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 409/554 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 89/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/559 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/559 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/560 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/560 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 149/149 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 33 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 411/411 transitions.
Graph (complete) has 715 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 146 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 146 transition count 407
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 7 place count 144 transition count 407
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 13 place count 138 transition count 396
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 138 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 136 transition count 385
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 136 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 135 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 135 transition count 381
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 44 place count 125 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 124 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 124 transition count 370
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 121 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 120 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 120 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 70 place count 120 transition count 370
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 120 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 118 transition count 368
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 118 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 117 transition count 427
Applied a total of 76 rules in 77 ms. Remains 117 /149 variables (removed 32) and now considering 427/411 (removed -16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 117/149 places, 427/411 transitions.
RANDOM walk for 40000 steps (3866 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (886 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1025293 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 1
Probabilistic random walk after 1025293 steps, saw 211541 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
// Phase 1: matrix 427 rows 117 cols
[2024-06-03 04:02:41] [INFO ] Computed 21 invariants in 2 ms
[2024-06-03 04:02:41] [INFO ] State equation strengthened by 191 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/116 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 427/543 variables, 116/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 191/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/544 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/544 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 04:02:41] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/93 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/116 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 04:02:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 427/543 variables, 116/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 191/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/544 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 04:02:41] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-03 04:02:42] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/544 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 33 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/117 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-03 04:02:42] [INFO ] Invariant cache hit.
[2024-06-03 04:02:42] [INFO ] Implicit Places using invariants in 122 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 116/117 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 142 ms. Remains : 116/117 places, 427/427 transitions.
RANDOM walk for 40000 steps (3846 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (881 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1017071 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1017071 steps, saw 210007 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
// Phase 1: matrix 427 rows 116 cols
[2024-06-03 04:02:45] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 04:02:45] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/115 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 427/542 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 189/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/543 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/543 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/115 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 427/542 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 189/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/543 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/543 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 33 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 116/116 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-03 04:02:46] [INFO ] Invariant cache hit.
[2024-06-03 04:02:46] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-03 04:02:46] [INFO ] Invariant cache hit.
[2024-06-03 04:02:46] [INFO ] State equation strengthened by 189 read => feed constraints.
[2024-06-03 04:02:47] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-06-03 04:02:47] [INFO ] Redundant transitions in 8 ms returned []
Running 426 sub problems to find dead transitions.
[2024-06-03 04:02:47] [INFO ] Invariant cache hit.
[2024-06-03 04:02:47] [INFO ] State equation strengthened by 189 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-03 04:02:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-03 04:02:51] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-03 04:02:51] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-03 04:02:52] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-06-03 04:02:52] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-03 04:02:52] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-06-03 04:02:52] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/543 variables, 116/143 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 332 constraints, problems are : Problem set: 0 solved, 426 unsolved in 23143 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-03 04:03:14] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 427/543 variables, 116/144 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 189/333 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 426/759 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-03 04:03:33] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-03 04:03:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-03 04:03:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-03 04:03:35] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 763 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 12/12 constraints]
After SMT, in 54156ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 54162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54830 ms. Remains : 116/116 places, 427/427 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 560 edges and 116 vertex of which 112 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 112 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 112 transition count 419
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 112 transition count 464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 109 transition count 463
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 109 transition count 463
Applied a total of 24 rules in 57 ms. Remains 109 /116 variables (removed 7) and now considering 463/427 (removed -36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 109 cols
[2024-06-03 04:03:41] [INFO ] Computed 16 invariants in 6 ms
[2024-06-03 04:03:41] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 04:03:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-03 04:03:41] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 4 ms returned sat
[2024-06-03 04:03:41] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 04:03:41] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 04:03:41] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 634 ms.
[2024-06-03 04:03:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-03 04:03:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 427 transitions and 2516 arcs took 9 ms.
[2024-06-03 04:03:42] [INFO ] Flatten gal took : 130 ms
Total runtime 151900 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-22

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 982
MODEL NAME: /home/mcc/execution/406/model
116 places, 427 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-22-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717387461774

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="ReachabilityCardinality"
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-22, examination is ReachabilityCardinality"
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-171734919800174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;