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.r003-smll-171620116900063.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 ASLink-PT-04a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:23 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:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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:22 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 436K 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-04a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2023-09
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716259341517

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 02:42:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 02:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:42:24] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2024-05-21 02:42:24] [INFO ] Transformed 1016 places.
[2024-05-21 02:42:24] [INFO ] Transformed 1554 transitions.
[2024-05-21 02:42:24] [INFO ] Found NUPN structural information;
[2024-05-21 02:42:24] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 721 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
RANDOM walk for 40000 steps (286 resets) in 3658 ms. (10 steps per ms) remains 15/16 properties
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (8 resets) in 122 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 114 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 148 ms. (26 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 115238 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 15
Probabilistic random walk after 115238 steps, saw 48601 distinct states, run finished after 3008 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1538 rows 1016 cols
[2024-05-21 02:42:29] [INFO ] Computed 194 invariants in 98 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 284/284 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 146/430 variables, 37/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 146/468 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 21/451 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 21/500 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem ASLink-PT-04a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 547/998 variables, 139/639 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 547/1186 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/998 variables, 0/1186 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 18/1016 variables, 6/1192 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 18/1210 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1016 variables, 0/1210 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2554/2554 variables, and 2226 constraints, problems are : Problem set: 4 solved, 11 unsolved in 5074 ms.
Refiners :[Domain max(s): 1016/1016 constraints, Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1016/1016 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 1/218 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/218 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 149/366 variables, 36/254 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 149/403 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/404 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/404 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 24/390 variables, 10/414 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 24/438 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/438 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem ASLink-PT-04a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 607/997 variables, 139/577 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 607/1184 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-21 02:42:38] [INFO ] Deduced a trap composed of 37 places in 1545 ms of which 156 ms to minimize.
[2024-05-21 02:42:39] [INFO ] Deduced a trap composed of 38 places in 881 ms of which 11 ms to minimize.
[2024-05-21 02:42:40] [INFO ] Deduced a trap composed of 180 places in 785 ms of which 14 ms to minimize.
SMT process timed out in 11222ms, After SMT, problems are : Problem set: 5 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 205 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 14 places
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 995 transition count 1486
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 132 place count 943 transition count 1479
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 139 place count 936 transition count 1479
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 139 place count 936 transition count 1403
Deduced a syphon composed of 76 places in 10 ms
Ensure Unique test removed 24 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 315 place count 836 transition count 1403
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 316 place count 836 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 835 transition count 1402
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 320 place count 832 transition count 1394
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 831 transition count 1394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 5 rules applied. Total rules applied 329 place count 830 transition count 1390
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 331 place count 828 transition count 1390
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 367 place count 810 transition count 1372
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 810 transition count 1368
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 375 place count 806 transition count 1368
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 379 place count 806 transition count 1364
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 383 place count 802 transition count 1364
Applied a total of 383 rules in 703 ms. Remains 802 /1016 variables (removed 214) and now considering 1364/1538 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 802/1016 places, 1364/1538 transitions.
RANDOM walk for 40000 steps (356 resets) in 510 ms. (78 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (82 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 470 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (88 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 481 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (74 resets) in 298 ms. (133 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (80 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (86 resets) in 300 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (82 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (82 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 103985 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 10
Probabilistic random walk after 103985 steps, saw 45810 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1364 rows 802 cols
[2024-05-21 02:42:45] [INFO ] Computed 147 invariants in 52 ms
[2024-05-21 02:42:45] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 105/310 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 34/344 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 457/801 variables, 107/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/802 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1364/2166 variables, 802/949 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2166 variables, 13/962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2166 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2166 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2166/2166 variables, and 962 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6820 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 802/802 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 105/310 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 34/344 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 457/801 variables, 107/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 02:42:54] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 4 ms to minimize.
[2024-05-21 02:42:54] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 5 ms to minimize.
[2024-05-21 02:42:54] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 3 ms to minimize.
[2024-05-21 02:42:55] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 02:42:55] [INFO ] Deduced a trap composed of 71 places in 420 ms of which 6 ms to minimize.
[2024-05-21 02:42:56] [INFO ] Deduced a trap composed of 33 places in 574 ms of which 8 ms to minimize.
[2024-05-21 02:42:56] [INFO ] Deduced a trap composed of 30 places in 568 ms of which 10 ms to minimize.
[2024-05-21 02:42:57] [INFO ] Deduced a trap composed of 135 places in 701 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/802 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 02:42:59] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/802 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 02:43:00] [INFO ] Deduced a trap composed of 152 places in 879 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 02:43:02] [INFO ] Deduced a trap composed of 157 places in 988 ms of which 11 ms to minimize.
[2024-05-21 02:43:03] [INFO ] Deduced a trap composed of 177 places in 921 ms of which 10 ms to minimize.
[2024-05-21 02:43:04] [INFO ] Deduced a trap composed of 157 places in 935 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/802 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-04a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04a-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-04a-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 1364/2166 variables, 802/962 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2166 variables, 13/975 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2166 variables, 2/977 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-21 02:43:28] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2166 variables, 1/978 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2166 variables, 0/978 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2166 variables, 0/978 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2166/2166 variables, and 978 constraints, problems are : Problem set: 8 solved, 2 unsolved in 38291 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 802/802 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 45407ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 6065 ms.
Support contains 102 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1364/1364 transitions.
Ensure Unique test removed 1 places
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 14 rules applied. Total rules applied 14 place count 801 transition count 1351
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 788 transition count 1351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 788 transition count 1339
Deduced a syphon composed of 12 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 58 place count 769 transition count 1339
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 767 transition count 1327
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 767 transition count 1327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 765 transition count 1325
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 765 transition count 1325
Applied a total of 70 rules in 202 ms. Remains 765 /802 variables (removed 37) and now considering 1325/1364 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 765/802 places, 1325/1364 transitions.
RANDOM walk for 40000 steps (413 resets) in 397 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 439 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 405 ms. (98 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 134916 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134916 steps, saw 58736 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1325 rows 765 cols
[2024-05-21 02:43:40] [INFO ] Computed 139 invariants in 34 ms
[2024-05-21 02:43:40] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/168 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/252 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 498/750 variables, 95/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/765 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1325/2090 variables, 765/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2090 variables, 21/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2090 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2090 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2090/2090 variables, and 925 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 765/765 constraints, ReadFeed: 21/21 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/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/168 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/252 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 498/750 variables, 95/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:43:43] [INFO ] Deduced a trap composed of 42 places in 769 ms of which 9 ms to minimize.
[2024-05-21 02:43:44] [INFO ] Deduced a trap composed of 24 places in 630 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 15/765 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1325/2090 variables, 765/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2090 variables, 21/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2090 variables, 2/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2090/2090 variables, and 929 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43985 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 765/765 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 45896ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 14594 ms.
Support contains 102 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1325/1325 transitions.
Applied a total of 0 rules in 35 ms. Remains 765 /765 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 765/765 places, 1325/1325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1325/1325 transitions.
Applied a total of 0 rules in 30 ms. Remains 765 /765 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
[2024-05-21 02:44:41] [INFO ] Invariant cache hit.
[2024-05-21 02:44:42] [INFO ] Implicit Places using invariants in 1100 ms returned [1, 19, 20, 22, 32, 50, 155, 174, 192, 210, 295, 308, 309, 310, 311, 312, 330, 348, 428, 444, 445, 446, 447, 467, 485, 525, 551, 572, 577, 589, 590, 591, 592, 593, 628, 630, 633, 651, 652, 653, 654, 669, 675, 681, 687, 693, 699, 705, 711, 717, 723, 729]
[2024-05-21 02:44:42] [INFO ] Actually due to overlaps returned [628, 593, 50, 174, 192, 312, 330, 467, 633, 32, 311, 447, 592, 652, 310, 446, 591, 630, 651, 1, 295, 309, 428, 445, 572, 590, 19, 20, 210, 308, 348, 444, 485, 589, 654, 699, 717, 729, 22, 155, 577, 653, 669, 675, 681, 687, 693, 705, 711, 723]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1116 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/765 places, 1325/1325 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 713 transition count 1261
Reduce places removed 64 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 70 rules applied. Total rules applied 136 place count 649 transition count 1255
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 643 transition count 1255
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 142 place count 643 transition count 1227
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 199 place count 614 transition count 1227
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 11 rules applied. Total rules applied 210 place count 609 transition count 1221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 216 place count 603 transition count 1221
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 229 place count 590 transition count 1208
Iterating global reduction 5 with 13 rules applied. Total rules applied 242 place count 590 transition count 1208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 243 place count 590 transition count 1207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 243 place count 590 transition count 1206
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 245 place count 589 transition count 1206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 248 place count 586 transition count 1203
Iterating global reduction 6 with 3 rules applied. Total rules applied 251 place count 586 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 585 transition count 1202
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 585 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 584 transition count 1201
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 584 transition count 1201
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 339 place count 542 transition count 1159
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 341 place count 540 transition count 1157
Iterating global reduction 6 with 2 rules applied. Total rules applied 343 place count 540 transition count 1157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 345 place count 540 transition count 1155
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 540 transition count 1153
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 351 place count 538 transition count 1151
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 367 place count 538 transition count 1135
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 383 place count 522 transition count 1135
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 396 place count 522 transition count 1135
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 399 place count 522 transition count 1135
Applied a total of 399 rules in 295 ms. Remains 522 /715 variables (removed 193) and now considering 1135/1325 (removed 190) transitions.
// Phase 1: matrix 1135 rows 522 cols
[2024-05-21 02:44:42] [INFO ] Computed 81 invariants in 19 ms
[2024-05-21 02:44:43] [INFO ] Implicit Places using invariants in 713 ms returned [111, 135, 193, 211, 219, 226, 227, 232, 233, 285, 302, 308, 311, 313, 314, 323, 379, 403, 417, 424, 507, 510, 513, 516, 519]
[2024-05-21 02:44:43] [INFO ] Actually due to overlaps returned [314, 424, 227, 211, 302, 308, 313, 507, 510, 513, 516, 519, 111, 193, 219, 226, 285, 379, 403, 417]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 718 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 502/765 places, 1135/1325 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 502 transition count 1127
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 494 transition count 1127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 24 place count 486 transition count 1116
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 486 transition count 1116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 486 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 484 transition count 1111
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 484 transition count 1111
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 479 transition count 1106
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 479 transition count 1098
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 65 place count 471 transition count 1098
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 471 transition count 1096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 469 transition count 1096
Applied a total of 69 rules in 171 ms. Remains 469 /502 variables (removed 33) and now considering 1096/1135 (removed 39) transitions.
// Phase 1: matrix 1096 rows 469 cols
[2024-05-21 02:44:43] [INFO ] Computed 61 invariants in 11 ms
[2024-05-21 02:44:44] [INFO ] Implicit Places using invariants in 394 ms returned [134, 218, 219, 293]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 397 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 465/765 places, 1096/1325 transitions.
Applied a total of 0 rules in 18 ms. Remains 465 /465 variables (removed 0) and now considering 1096/1096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2747 ms. Remains : 465/765 places, 1096/1325 transitions.
RANDOM walk for 40000 steps (624 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (178 resets) in 565 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 142526 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142526 steps, saw 92710 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 1096 rows 465 cols
[2024-05-21 02:44:47] [INFO ] Computed 57 invariants in 14 ms
[2024-05-21 02:44:47] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 119/221 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 230/454 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/465 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1096/1561 variables, 465/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1561 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1561 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1561 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1561/1561 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 465/465 constraints, ReadFeed: 4/4 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/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 119/221 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 230/454 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:44:48] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/465 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1096/1561 variables, 465/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1561 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1561 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:44:56] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1561 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:45:09] [INFO ] Deduced a trap composed of 34 places in 331 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1561 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1561 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1561 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1561/1561 variables, and 531 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22931 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 465/465 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 23857ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3657 ms.
Support contains 102 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1096/1096 transitions.
Applied a total of 0 rules in 29 ms. Remains 465 /465 variables (removed 0) and now considering 1096/1096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 465/465 places, 1096/1096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1096/1096 transitions.
Applied a total of 0 rules in 17 ms. Remains 465 /465 variables (removed 0) and now considering 1096/1096 (removed 0) transitions.
[2024-05-21 02:45:15] [INFO ] Invariant cache hit.
[2024-05-21 02:45:15] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-21 02:45:15] [INFO ] Invariant cache hit.
[2024-05-21 02:45:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:45:17] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2024-05-21 02:45:17] [INFO ] Redundant transitions in 119 ms returned []
Running 1095 sub problems to find dead transitions.
[2024-05-21 02:45:17] [INFO ] Invariant cache hit.
[2024-05-21 02:45:17] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 2 (OVERLAPS) 1/465 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1561 variables, and 57 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/465 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1095/1095 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1095 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 2 (OVERLAPS) 1/465 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1095 unsolved
[2024-05-21 02:46:01] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-21 02:46:13] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 2 ms to minimize.
[2024-05-21 02:46:14] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 3 ms to minimize.
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
[2024-05-21 02:46:14] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
Problem TDEAD817 is UNSAT
[2024-05-21 02:46:15] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-21 02:46:16] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
Problem TDEAD909 is UNSAT
[2024-05-21 02:46:18] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 4 ms to minimize.
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD968 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/1561 variables, and 64 constraints, problems are : Problem set: 9 solved, 1086 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/465 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1095 constraints, Known Traps: 7/7 constraints]
After SMT, in 60978ms problems are : Problem set: 9 solved, 1086 unsolved
Search for dead transitions found 9 dead transitions in 60996ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/465 places, 1087/1096 transitions.
Applied a total of 0 rules in 18 ms. Remains 465 /465 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-21 02:46:18] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63304 ms. Remains : 465/465 places, 1087/1096 transitions.
RANDOM walk for 40000 steps (655 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (176 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (163 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 191229 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191229 steps, saw 125301 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1087 rows 465 cols
[2024-05-21 02:46:21] [INFO ] Computed 58 invariants in 11 ms
[2024-05-21 02:46:21] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/204 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/207 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 247/454 variables, 35/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/465 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1087/1552 variables, 465/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1552 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1552 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1552 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1552/1552 variables, and 527 constraints, problems are : Problem set: 0 solved, 2 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 465/465 constraints, ReadFeed: 4/4 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/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/204 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/207 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 247/454 variables, 35/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/465 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1087/1552 variables, 465/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1552 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1552 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1552 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:47:01] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1552 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/1552 variables, and 530 constraints, problems are : Problem set: 0 solved, 2 unsolved in 81668 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 465/465 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 82647ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1087/1087 transitions.
Applied a total of 0 rules in 15 ms. Remains 465 /465 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 465/465 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1087/1087 transitions.
Applied a total of 0 rules in 15 ms. Remains 465 /465 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-21 02:47:44] [INFO ] Invariant cache hit.
[2024-05-21 02:47:44] [INFO ] Implicit Places using invariants in 479 ms returned [291]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 495 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/465 places, 1087/1087 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1083
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 460 transition count 1083
Applied a total of 8 rules in 49 ms. Remains 460 /464 variables (removed 4) and now considering 1083/1087 (removed 4) transitions.
// Phase 1: matrix 1083 rows 460 cols
[2024-05-21 02:47:44] [INFO ] Computed 57 invariants in 16 ms
[2024-05-21 02:47:45] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-21 02:47:45] [INFO ] Invariant cache hit.
[2024-05-21 02:47:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:47:47] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/465 places, 1083/1087 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3082 ms. Remains : 460/465 places, 1083/1087 transitions.
RANDOM walk for 40000 steps (607 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (177 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (153 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 180505 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 180505 steps, saw 117585 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-21 02:47:50] [INFO ] Invariant cache hit.
[2024-05-21 02:47:50] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 124/226 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/229 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 220/449 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/460 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1083/1543 variables, 460/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1543 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1543 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1543 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1543/1543 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 460/460 constraints, ReadFeed: 4/4 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/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 124/226 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:47:52] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/229 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:47:52] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 220/449 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/460 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1083/1543 variables, 460/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1543 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1543 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1543 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1543/1543 variables, and 525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66733 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 460/460 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 68181ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2673 ms.
Support contains 102 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1083/1083 transitions.
Applied a total of 0 rules in 17 ms. Remains 460 /460 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 460/460 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1083/1083 transitions.
Applied a total of 0 rules in 14 ms. Remains 460 /460 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2024-05-21 02:49:01] [INFO ] Invariant cache hit.
[2024-05-21 02:49:02] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-21 02:49:02] [INFO ] Invariant cache hit.
[2024-05-21 02:49:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:49:03] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-05-21 02:49:03] [INFO ] Redundant transitions in 24 ms returned []
Running 1082 sub problems to find dead transitions.
[2024-05-21 02:49:03] [INFO ] Invariant cache hit.
[2024-05-21 02:49:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (OVERLAPS) 1/460 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1543 variables, and 57 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/460 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (OVERLAPS) 1/460 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-21 02:49:46] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-21 02:49:58] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 5 ms to minimize.
[2024-05-21 02:50:01] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 02:50:03] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 3 ms to minimize.
Problem TDEAD1012 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
[2024-05-21 02:50:04] [INFO ] Deduced a trap composed of 91 places in 421 ms of which 4 ms to minimize.
SMT process timed out in 60848ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 60860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62681 ms. Remains : 460/460 places, 1083/1083 transitions.
[2024-05-21 02:50:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-21 02:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 460 places, 1083 transitions and 4351 arcs took 17 ms.
[2024-05-21 02:50:04] [INFO ] Flatten gal took : 215 ms
Total runtime 460920 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-04a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 460
TRANSITIONS: 1083
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.008s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.004s]


----------------------------------------------------------------------
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: 777
MODEL NAME: /home/mcc/execution/409/model
460 places, 1083 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 ASLink-PT-04a-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA ASLink-PT-04a-ReachabilityFireability-2023-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716260425038

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04a"
export BK_EXAMINATION="ReachabilityFireability"
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 ASLink-PT-04a, 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 r003-smll-171620116900063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a 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 ;