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.r464-smll-171620117900143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 839K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-08
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-10
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-13
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717234548331

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:35:50] [INFO ] Load time of PNML (sax parser for PT used): 394 ms
[2024-06-01 09:35:50] [INFO ] Transformed 1991 places.
[2024-06-01 09:35:50] [INFO ] Transformed 2919 transitions.
[2024-06-01 09:35:50] [INFO ] Found NUPN structural information;
[2024-06-01 09:35:50] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
RANDOM walk for 40000 steps (172 resets) in 3449 ms. (11 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 733 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (14 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (14 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 364 ms. (109 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 269 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (13 resets) in 1860 ms. (21 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 229 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (14 resets) in 470 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (17 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (17 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
// Phase 1: matrix 2888 rows 1991 cols
[2024-06-01 09:35:54] [INFO ] Computed 384 invariants in 198 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 226/501 variables, 49/324 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 226/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 120/621 variables, 44/594 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 120/714 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1328/1949 variables, 279/993 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1949 variables, 1328/2321 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1949 variables, 0/2321 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 42/1991 variables, 12/2333 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1991 variables, 42/2375 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1991 variables, 0/2375 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SMT process timed out in 5896ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 239 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 35 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1938 transition count 2743
Reduce places removed 145 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 154 rules applied. Total rules applied 352 place count 1793 transition count 2734
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 361 place count 1784 transition count 2734
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 361 place count 1784 transition count 2570
Deduced a syphon composed of 164 places in 16 ms
Ensure Unique test removed 57 places
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 385 rules applied. Total rules applied 746 place count 1563 transition count 2570
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 747 place count 1563 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 748 place count 1562 transition count 2569
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 753 place count 1557 transition count 2544
Ensure Unique test removed 1 places
Iterating global reduction 5 with 6 rules applied. Total rules applied 759 place count 1556 transition count 2544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions 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 5 with 2 rules applied. Total rules applied 761 place count 1556 transition count 2542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 762 place count 1555 transition count 2542
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 14 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 858 place count 1507 transition count 2494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 860 place count 1506 transition count 2497
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 862 place count 1506 transition count 2495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 864 place count 1504 transition count 2495
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 872 place count 1504 transition count 2487
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 880 place count 1496 transition count 2487
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 886 place count 1496 transition count 2487
Applied a total of 886 rules in 1409 ms. Remains 1496 /1991 variables (removed 495) and now considering 2487/2888 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1429 ms. Remains : 1496/1991 places, 2487/2888 transitions.
RANDOM walk for 40000 steps (258 resets) in 1370 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 446 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (31 resets) in 214 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (25 resets) in 273 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (30 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (31 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (31 resets) in 408 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 365 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (29 resets) in 270 ms. (147 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 71906 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 12
Probabilistic random walk after 71906 steps, saw 38206 distinct states, run finished after 3009 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 2487 rows 1496 cols
[2024-06-01 09:36:05] [INFO ] Computed 273 invariants in 94 ms
[2024-06-01 09:36:05] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/429 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 125/554 variables, 35/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 908/1462 variables, 189/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 34/1496 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1496 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2487/3983 variables, 1496/1769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3983 variables, 46/1815 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3983 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/3983 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3983/3983 variables, and 1815 constraints, problems are : Problem set: 0 solved, 12 unsolved in 13293 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 195/195 constraints, State Equation: 1496/1496 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/429 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 125/554 variables, 35/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 908/1462 variables, 189/267 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 26 places in 783 ms of which 84 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 4 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 68 places in 1299 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 3/270 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 09:36:25] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
[2024-06-01 09:36:26] [INFO ] Deduced a trap composed of 71 places in 1293 ms of which 11 ms to minimize.
[2024-06-01 09:36:27] [INFO ] Deduced a trap composed of 23 places in 1056 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 3/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1462 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 34/1496 variables, 6/279 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 09:36:30] [INFO ] Deduced a trap composed of 104 places in 1247 ms of which 10 ms to minimize.
[2024-06-01 09:36:31] [INFO ] Deduced a trap composed of 101 places in 946 ms of which 12 ms to minimize.
[2024-06-01 09:36:32] [INFO ] Deduced a trap composed of 75 places in 981 ms of which 12 ms to minimize.
[2024-06-01 09:36:33] [INFO ] Deduced a trap composed of 123 places in 804 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1496 variables, 4/283 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2023-08 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 2487/3983 variables, 1496/1779 constraints. Problems are: Problem set: 6 solved, 6 unsolved
SMT process timed out in 58737ms, After SMT, problems are : Problem set: 6 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 1496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1496/1496 places, 2487/2487 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1496 transition count 2475
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1484 transition count 2475
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 1484 transition count 2460
Deduced a syphon composed of 15 places in 4 ms
Ensure Unique test removed 9 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 63 place count 1460 transition count 2460
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 1456 transition count 2436
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1456 transition count 2436
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 1454 transition count 2434
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1454 transition count 2433
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 83 place count 1452 transition count 2428
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 1452 transition count 2428
Applied a total of 87 rules in 765 ms. Remains 1452 /1496 variables (removed 44) and now considering 2428/2487 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 765 ms. Remains : 1452/1496 places, 2428/2487 transitions.
RANDOM walk for 40000 steps (267 resets) in 535 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (31 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 82769 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 6
Probabilistic random walk after 82769 steps, saw 43667 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 2428 rows 1452 cols
[2024-06-01 09:37:08] [INFO ] Computed 263 invariants in 39 ms
[2024-06-01 09:37:08] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 115/241 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 173/414 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 993/1407 variables, 181/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 45/1452 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1452 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2428/3880 variables, 1452/1715 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3880 variables, 52/1767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3880 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3880 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3880/3880 variables, and 1767 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6656 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 191/191 constraints, State Equation: 1452/1452 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 115/241 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 173/414 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 993/1407 variables, 181/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:37:17] [INFO ] Deduced a trap composed of 25 places in 1204 ms of which 14 ms to minimize.
[2024-06-01 09:37:18] [INFO ] Deduced a trap composed of 73 places in 830 ms of which 8 ms to minimize.
[2024-06-01 09:37:19] [INFO ] Deduced a trap composed of 72 places in 1049 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 45/1452 variables, 10/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2023-10 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 2428/3880 variables, 1452/1718 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3880 variables, 52/1770 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3880 variables, 4/1774 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3880 variables, 0/1774 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 09:38:26] [INFO ] Deduced a trap composed of 108 places in 282 ms of which 4 ms to minimize.
[2024-06-01 09:38:27] [INFO ] Deduced a trap composed of 97 places in 322 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/3880 variables, 2/1776 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 0)
(t3 0)
(t4 0)
(t5 0)
(t6 1)
(t7 1)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 11)
(t13 0)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 3)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 1)
(t26 0)
(t27 3)
(t28 0)
(t29 26)
(t30 0)
(t31 0)
(t32 0)
(t33 1)
(t34 0)
(t35 3)
(t36 0)
(t37 0)
(t38 2)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 1)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 1)
(t51 1)
(t52 0)
(t53 0)
(t54 1)
(t55 1)
(t56 2)
(t57 0)
(t58 0)
(t59 0)
(t60 1)
(t61 1)
(t62 0)
(t63 14)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 1)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 1)
(t80 0)
(t81 1)
(t82 0)
(t83 0)
(t84 1)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 1)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 1)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 3)
(t108 0)
(t109 0)
(t110 26)
(t111 0)
(t112 2)
(t113 0)
(t114 2)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 12)
(t121 0)
(t122 0)
(t123 17)
(t124 0)
(t125 3)
(t126 0)
(t127 0)
(t128 26)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 17)
(t137 0)
(t138 0)
(t139 12)
(t140 0)
(t141 0)
(t142 1)
(t143 0)
(t144 0)
(t145 0)
(t146 28)
(t147 0)
(t148 1)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 28)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 6)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 23)
(t164 0)
(t165 0)
(t166 0)
(t167 28)
(t168 0)
(t169 1)
(t170 0)
(t171 0)
(t172 1)
(t173 23)
(t174 0)
(t175 1)
(t176 0)
(t177 0)
(t178 0)
(t179 4)
(t180 0)
(t181 0)
(t182 29)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 27)
(t189 2)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 28)
(t197 0)
(t198 0)
(t199 1)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 1)
(t205 1)
(t206 22)
(t207 1)
(t208 1)
(t209 1)
(t210 1)
(t211 1)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 29)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 28)
(t226 0)
(t227 1)
(t228 0)
(t229 29)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 27)
(t240 2)
(t241 0)
(t242 0)
(t243 0)
(t244 2)
(t245 0)
(t246 41)
(t247 2)
(t248 0)
(t249 40)
(t250 0)
(t251 1)
(t252 0)
(t253 0)
(t254 0)
(t255 24)
(t256 0)
(t257 0)
(t258 1)
(t259 1)
(t260 0)
(t261 1)
(t262 1)
(t263 0)
(t264 1)
(t265 20)
(t266 0)
(t267 24)
(t268 0)
(t269 0)
(t270 0)
(t271 1)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 1)
(t280 23)
(t281 1)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 25)
(t287 0)
(t288 0)
(t289 0)
(t290 24)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 1)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 25)
(t305 0)
(t306 0)
(t307 1)
(t308 0)
(t309 0)
(t310 24)
(t311 0)
(t312 0)
(t313 0)
(t314 24)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 1)
(t322 0)
(t323 0)
(t324 0)
(t325 24)
(t326 0)
(t327 0)
(t328 1)
(t329 0)
(t330 0)
(t331 0)
(t332 25)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 22)
(t340 1)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 2)
(t346 1)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 24)
(t354 0)
(t355 1)
(t356 24)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 25)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 24)
(t376 0)
(t377 1)
(t378 0)
(t379 0)
(t380 7)
(t381 0)
(t382 0)
(t383 6)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 15)
(t389 0)
(t390 0)
(t391 0)
(t392 15)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 15)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 15)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 15)
(t423 0)
(t424 0)
(t425 15)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 15)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 15)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 15)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 15)
(t463 0)
(t464 0)
(t465 15)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 15)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 15)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 15)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 15)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 15)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 1)
(t513 5)
(t514 1)
(t515 1)
(t516 4)
(t517 1)
(t518 2)
(t519 0)
(t520 0)
(t521 0)
(t522 13)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 5)
(t528 8)
(t529 1)
(t530 0)
(t531 0)
(t532 0)
(t533 1)
(t534 1)
(t535 14)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 7)
(t544 0)
(t545 0)
(t546 8)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 2)
(t556 12)
(t557 0)
(t558 0)
(t559 1)
(t560 0)
(t561 2)
(t562 1)
(t563 0)
(t564 0)
(t565 10)
(t566 12)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 2)
(t573 0)
(t574 1)
(t575 0)
(t576 0)
(t577 1)
(t578 1)
(t579 10)
(t580 0)
(t581 1)
(t582 0)
(t583 0)
(t584 0)
(t585 14)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 2)
(t594 1)
(t595 0)
(t596 11)
(t597 0)
(t598 0)
(t599 0)
(t600 14)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 4)
(t609 8)
(t610 1)
(t611 0)
(t612 1)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 14)
(t622 8)
(t623 1)
(t624 1)
(t625 0)
(t626 1)
(t627 1)
(t628 1)
(t629 1)
(t630 0)
(t631 1)
(t632 0)
(t633 0)
(t634 1)
(t635 12)
(t636 0)
(t637 0)
(t638 6)
(t639 1)
(t640 1)
(t641 0)
(t642 1)
(t643 3)
(t644 1)
(t645 1)
(t646 0)
(t647 0)
(t648 0)
(t649 1)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 1)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 1)
(t672 0)
(t673 0)
(t674 0)
(t675 1)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 1)
(t687 0)
(t688 0)
(t689 0)
(t690 1)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 1)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 1)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 1)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 1)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 1)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 1)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 1)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 1)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 1)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 1)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 1)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 1)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 1)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 1)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 1)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 1)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 1)
(t830 0)
(t831 0)
(t832 0)
(t833 1)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 1)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 1)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 1)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 1)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 1)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 1)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 1)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 1)
(t904 0)
(t905 0)
(t906 1)
(t907 0)
(t908 0)
(t909 1)
(t910 0)
(t911 12)
(t912 1)
(t913 1)
(t914 1)
(t915 0)
(t916 0)
(t917 0)
(t918 14)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 1)
(t926 0)
(t927 1)
(t928 1)
(t929 13)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 1)
(t939 0)
(t940 14)
(t941 0)
(t942 14)
(t943 1)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 14)
(t953 1)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 1)
(t962 0)
(t963 0)
(t964 14)
(t965 0)
(t966 0)
(t967 1)
(t968 0)
(t969 14)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 1)
(t979 0)
(t980 1)
(t981 13)
(t982 0)
(t983 0)
(t984 1)
(t985 0)
(t986 14)
(t987 0)
(t988 0)
(t989 0)
(t990 1)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 14)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 15)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 13)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 2)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 1)
(t1021 14)
(t1022 0)
(t1023 1)
(t1024 0)
(t1025 0)
(t1026 13)
(t1027 1)
(t1028 0)
(t1029 0)
(t1030 1)
(t1031 14)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 16)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 16)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 16)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 16)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 16)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 16)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 16)
(t1098 16)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 16)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 16)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 16)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 16)
(t1138 0)
(t1139 16)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3880/3880 variables, and 1776 constraints, problems are : Problem set: 2 solved, 4 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 191/191 constraints, State Equation: 1452/1452 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 81836ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 1452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1452/1452 places, 2428/2428 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1452 transition count 2426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1450 transition count 2426
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 1450 transition count 2421
Deduced a syphon composed of 5 places in 5 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 17 place count 1442 transition count 2421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 1440 transition count 2419
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1440 transition count 2419
Applied a total of 22 rules in 320 ms. Remains 1440 /1452 variables (removed 12) and now considering 2419/2428 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 1440/1452 places, 2419/2428 transitions.
RANDOM walk for 40000 steps (328 resets) in 709 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (30 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 110919 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 110919 steps, saw 31437 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 2419 rows 1440 cols
[2024-06-01 09:38:34] [INFO ] Computed 260 invariants in 44 ms
[2024-06-01 09:38:34] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/219 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/394 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 996/1390 variables, 177/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/1440 variables, 13/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1440 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2419/3859 variables, 1440/1700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3859 variables, 54/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3859 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3859 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3859/3859 variables, and 1754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 190/190 constraints, State Equation: 1440/1440 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/219 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/394 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 996/1390 variables, 177/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:38:40] [INFO ] Deduced a trap composed of 107 places in 306 ms of which 4 ms to minimize.
[2024-06-01 09:38:41] [INFO ] Deduced a trap composed of 134 places in 1223 ms of which 13 ms to minimize.
[2024-06-01 09:38:43] [INFO ] Deduced a trap composed of 75 places in 1463 ms of which 14 ms to minimize.
[2024-06-01 09:38:43] [INFO ] Deduced a trap composed of 71 places in 671 ms of which 9 ms to minimize.
[2024-06-01 09:38:44] [INFO ] Deduced a trap composed of 69 places in 680 ms of which 8 ms to minimize.
[2024-06-01 09:38:45] [INFO ] Deduced a trap composed of 76 places in 1094 ms of which 11 ms to minimize.
[2024-06-01 09:38:46] [INFO ] Deduced a trap composed of 25 places in 663 ms of which 12 ms to minimize.
[2024-06-01 09:38:46] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1390 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 50/1440 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2419/3859 variables, 1440/1708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3859 variables, 54/1762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3859 variables, 4/1766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:39:21] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3859 variables, 1/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3859 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/3859 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3859/3859 variables, and 1767 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90018 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 190/190 constraints, State Equation: 1440/1440 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 95008ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22192 ms.
Support contains 108 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2419/2419 transitions.
Applied a total of 0 rules in 72 ms. Remains 1440 /1440 variables (removed 0) and now considering 2419/2419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1440/1440 places, 2419/2419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2419/2419 transitions.
Applied a total of 0 rules in 61 ms. Remains 1440 /1440 variables (removed 0) and now considering 2419/2419 (removed 0) transitions.
[2024-06-01 09:40:31] [INFO ] Invariant cache hit.
[2024-06-01 09:40:33] [INFO ] Implicit Places using invariants in 1952 ms returned [1, 19, 20, 22, 32, 50, 68, 106, 122, 153, 168, 169, 170, 171, 172, 190, 208, 288, 303, 304, 305, 306, 326, 344, 412, 428, 441, 444, 445, 446, 464, 482, 538, 568, 583, 584, 585, 586, 587, 623, 704, 717, 718, 719, 720, 721, 739, 757, 839, 854, 855, 856, 857, 858, 876, 894, 968, 981, 996, 997, 998, 1000, 1018, 1036, 1117, 1130, 1131, 1132, 1133, 1134, 1170, 1251, 1256, 1267, 1268, 1269, 1270, 1271, 1306, 1308, 1329, 1330, 1331, 1332, 1344, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1398, 1404]
[2024-06-01 09:40:33] [INFO ] Actually due to overlaps returned [1306, 1271, 32, 50, 172, 190, 326, 446, 464, 587, 721, 739, 858, 876, 1000, 1018, 1134, 171, 306, 445, 586, 720, 857, 1133, 1270, 1330, 170, 305, 444, 585, 719, 856, 998, 1132, 1269, 1308, 1329, 1, 169, 288, 304, 428, 568, 584, 704, 718, 839, 855, 981, 997, 1117, 1131, 1251, 1268, 19, 20, 68, 168, 208, 303, 344, 441, 482, 583, 623, 717, 757, 854, 894, 996, 1036, 1130, 1170, 1267, 1332, 1374, 1392, 1404, 22, 153, 1256, 1331, 1344, 1350, 1356, 1362, 1368, 1380, 1386, 1398]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1967 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1350/1440 places, 2419/2419 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 1346 transition count 2309
Reduce places removed 110 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 130 rules applied. Total rules applied 244 place count 1236 transition count 2289
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 264 place count 1216 transition count 2289
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 264 place count 1216 transition count 2228
Deduced a syphon composed of 61 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 387 place count 1154 transition count 2228
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 28 rules applied. Total rules applied 415 place count 1138 transition count 2216
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 428 place count 1126 transition count 2215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 429 place count 1125 transition count 2215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 429 place count 1125 transition count 2214
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 431 place count 1124 transition count 2214
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 442 place count 1113 transition count 2203
Iterating global reduction 6 with 11 rules applied. Total rules applied 453 place count 1113 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 453 place count 1113 transition count 2202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 455 place count 1112 transition count 2202
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 463 place count 1104 transition count 2194
Iterating global reduction 6 with 8 rules applied. Total rules applied 471 place count 1104 transition count 2194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 472 place count 1104 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 473 place count 1103 transition count 2192
Iterating global reduction 7 with 1 rules applied. Total rules applied 474 place count 1103 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 475 place count 1102 transition count 2191
Iterating global reduction 7 with 1 rules applied. Total rules applied 476 place count 1102 transition count 2191
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 610 place count 1035 transition count 2124
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 616 place count 1029 transition count 2118
Iterating global reduction 7 with 6 rules applied. Total rules applied 622 place count 1029 transition count 2118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 627 place count 1029 transition count 2113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 628 place count 1029 transition count 2112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 630 place count 1028 transition count 2111
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 638 place count 1028 transition count 2103
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 652 place count 1020 transition count 2097
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 9 with 29 rules applied. Total rules applied 681 place count 1020 transition count 2068
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 710 place count 991 transition count 2068
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 738 place count 991 transition count 2068
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 739 place count 991 transition count 2068
Applied a total of 739 rules in 1046 ms. Remains 991 /1350 variables (removed 359) and now considering 2068/2419 (removed 351) transitions.
// Phase 1: matrix 2068 rows 991 cols
[2024-06-01 09:40:34] [INFO ] Computed 149 invariants in 27 ms
[2024-06-01 09:40:35] [INFO ] Implicit Places using invariants in 1079 ms returned [101, 104, 106, 112, 164, 182, 189, 192, 195, 196, 201, 202, 279, 285, 288, 294, 301, 308, 309, 363, 386, 392, 395, 397, 398, 405, 458, 479, 488, 494, 495, 500, 501, 554, 583, 586, 588, 595, 600, 601, 653, 687, 696, 701, 702, 755, 773, 779, 782, 784, 785, 790, 791, 844, 865, 874, 880, 881, 975, 979, 982, 985, 988]
[2024-06-01 09:40:35] [INFO ] Actually due to overlaps returned [398, 696, 595, 785, 881, 196, 495, 201, 202, 106, 182, 189, 195, 279, 285, 386, 392, 397, 488, 583, 588, 773, 779, 784, 979, 982, 985, 988, 101, 164, 288, 294, 301, 363, 458, 479, 494, 554, 653, 687, 755, 844, 865, 874, 880, 975]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 945/1440 places, 2068/2419 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 945 transition count 2063
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 940 transition count 2063
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 33 place count 917 transition count 2038
Iterating global reduction 2 with 23 rules applied. Total rules applied 56 place count 917 transition count 2038
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 917 transition count 2036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 912 transition count 2031
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 912 transition count 2031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 910 transition count 2029
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 910 transition count 2029
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 102 place count 895 transition count 2014
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 894 transition count 2012
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 894 transition count 2012
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 126 place count 894 transition count 1990
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 148 place count 872 transition count 1990
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 872 transition count 1985
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 158 place count 867 transition count 1985
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 867 transition count 1985
Applied a total of 159 rules in 251 ms. Remains 867 /945 variables (removed 78) and now considering 1985/2068 (removed 83) transitions.
// Phase 1: matrix 1985 rows 867 cols
[2024-06-01 09:40:36] [INFO ] Computed 103 invariants in 21 ms
[2024-06-01 09:40:36] [INFO ] Implicit Places using invariants in 803 ms returned [106, 269, 270, 355, 435, 436, 525, 526, 621, 622, 694, 695]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 807 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 855/1440 places, 1985/2419 transitions.
Applied a total of 0 rules in 30 ms. Remains 855 /855 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 5250 ms. Remains : 855/1440 places, 1985/2419 transitions.
RANDOM walk for 40000 steps (597 resets) in 463 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 418 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (71 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 95827 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 95827 steps, saw 50429 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1985 rows 855 cols
[2024-06-01 09:40:40] [INFO ] Computed 91 invariants in 21 ms
[2024-06-01 09:40:40] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/298 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 26/324 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 525/849 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/855 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1985/2840 variables, 855/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2840 variables, 11/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2840 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2840 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2840/2840 variables, and 957 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2383 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 855/855 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/298 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 26/324 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/849 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:43] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/855 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:44] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/855 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1985/2840 variables, 855/949 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2840 variables, 11/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2840 variables, 4/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2840/2840 variables, and 964 constraints, problems are : Problem set: 0 solved, 4 unsolved in 100602 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 855/855 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 103077ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22233 ms.
Support contains 42 out of 855 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 855/855 places, 1985/1985 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 855 transition count 1975
Reduce places removed 10 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 845 transition count 1968
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 838 transition count 1968
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 34 place count 838 transition count 1963
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 44 place count 833 transition count 1963
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 832 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 49 place count 828 transition count 1955
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 54 place count 827 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 824 transition count 1952
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 824 transition count 1952
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 4 with 1 rules applied. Total rules applied 61 place count 824 transition count 1951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 823 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 822 transition count 1950
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 822 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 821 transition count 1949
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 821 transition count 1949
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 92 place count 808 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 93 place count 807 transition count 1935
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 807 transition count 1935
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 95 place count 807 transition count 1934
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 807 transition count 1933
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 806 transition count 1932
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 100 place count 806 transition count 1930
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 102 place count 804 transition count 1930
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 105 place count 804 transition count 1930
Applied a total of 105 rules in 342 ms. Remains 804 /855 variables (removed 51) and now considering 1930/1985 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 804/855 places, 1930/1985 transitions.
[2024-06-01 09:42:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 09:42:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 1930 transitions and 7878 arcs took 22 ms.
[2024-06-01 09:42:46] [INFO ] Flatten gal took : 340 ms
Total runtime 416531 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-09a-ReachabilityFireability-2024-01
Could not compute solution for formula : ASLink-PT-09a-ReachabilityFireability-2024-14
Could not compute solution for formula : ASLink-PT-09a-ReachabilityFireability-2023-15

BK_STOP 1717234967068

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-09a-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/654/inv_0_
rfs formula name ASLink-PT-09a-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/654/inv_1_
rfs formula name ASLink-PT-09a-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/654/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-09a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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