About the Execution of LTSMin+red for ASLink-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 797.552 | 281923.00 | 403986.00 | 760.60 | ?TFTTTTFTTFTFTF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117700031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-02a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 279K 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-02a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717183284277
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:21:27] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2024-05-31 19:21:27] [INFO ] Transformed 626 places.
[2024-05-31 19:21:27] [INFO ] Transformed 1008 transitions.
[2024-05-31 19:21:27] [INFO ] Found NUPN structural information;
[2024-05-31 19:21:27] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 728 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (482 resets) in 3381 ms. (11 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (123 resets) in 942 ms. (42 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (127 resets) in 1425 ms. (28 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (135 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (124 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (119 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (137 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (130 resets) in 290 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (136 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (86 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (123 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (131 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (129 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (112 resets) in 277 ms. (143 steps per ms) remains 13/13 properties
// Phase 1: matrix 998 rows 626 cols
[2024-05-31 19:21:30] [INFO ] Computed 118 invariants in 78 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 111/284 variables, 28/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 111/314 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 336/620 variables, 84/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 336/735 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 6/626 variables, 3/738 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 6/744 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5141 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 111/284 variables, 28/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 111/314 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 336/620 variables, 84/399 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 336/735 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 54 ms to minimize.
[2024-05-31 19:21:38] [INFO ] Deduced a trap composed of 75 places in 445 ms of which 6 ms to minimize.
[2024-05-31 19:21:38] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 5 ms to minimize.
[2024-05-31 19:21:38] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 2 ms to minimize.
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 4 ms to minimize.
Problem ASLink-PT-02a-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 5/740 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/626 variables, 3/743 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 6/749 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/749 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1624/1624 variables, and 1375 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5009 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 11038ms problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 618 transition count 965
Reduce places removed 33 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 38 rules applied. Total rules applied 79 place count 585 transition count 960
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 580 transition count 960
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 84 place count 580 transition count 920
Deduced a syphon composed of 40 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 177 place count 527 transition count 920
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 178 place count 527 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 526 transition count 919
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 182 place count 523 transition count 911
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 522 transition count 911
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 191 place count 521 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 193 place count 519 transition count 907
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 217 place count 507 transition count 895
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 507 transition count 895
Applied a total of 219 rules in 277 ms. Remains 507 /626 variables (removed 119) and now considering 895/998 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 507/626 places, 895/998 transitions.
RANDOM walk for 40000 steps (582 resets) in 945 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (171 resets) in 372 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (187 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (172 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (148 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (176 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (193 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (85 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (181 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (176 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (187 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (131 resets) in 287 ms. (138 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 138904 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :1 out of 11
Probabilistic random walk after 138904 steps, saw 56403 distinct states, run finished after 3012 ms. (steps per millisecond=46 ) properties seen :1
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 895 rows 507 cols
[2024-05-31 19:21:45] [INFO ] Computed 95 invariants in 23 ms
[2024-05-31 19:21:45] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 108/250 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 255/505 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/507 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 895/1402 variables, 507/602 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 7/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1402 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1402/1402 variables, and 609 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3432 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 71/71 constraints, State Equation: 507/507 constraints, ReadFeed: 7/7 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/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 108/250 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 255/505 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 70 places in 291 ms of which 7 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 5 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 4 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-05-31 19:21:51] [INFO ] Deduced a trap composed of 106 places in 249 ms of which 5 ms to minimize.
[2024-05-31 19:21:51] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/507 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 895/1402 variables, 507/608 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 7/615 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1402 variables, 2/617 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1402 variables, 0/617 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1402 variables, 0/617 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1402/1402 variables, and 617 constraints, problems are : Problem set: 8 solved, 2 unsolved in 9176 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 71/71 constraints, State Equation: 507/507 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 12849ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 3194 ms.
Support contains 105 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 895/895 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 507 transition count 891
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 503 transition count 891
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 503 transition count 889
Deduced a syphon composed of 2 places in 10 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 499 transition count 889
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 498 transition count 888
Applied a total of 16 rules in 147 ms. Remains 498 /507 variables (removed 9) and now considering 888/895 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 498/507 places, 888/895 transitions.
RANDOM walk for 40000 steps (589 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (166 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (125 resets) in 403 ms. (99 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 252666 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252666 steps, saw 97957 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 888 rows 498 cols
[2024-05-31 19:22:05] [INFO ] Computed 93 invariants in 27 ms
[2024-05-31 19:22:05] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 77/182 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/210 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 286/496 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/498 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 888/1386 variables, 498/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1386 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1386 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1386 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1386/1386 variables, and 599 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 498/498 constraints, ReadFeed: 8/8 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/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 77/182 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/210 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 286/496 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:22:07] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/498 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 888/1386 variables, 498/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1386 variables, 8/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1386 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1386 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1386 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1386/1386 variables, and 602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8253 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 498/498 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 9745ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2720 ms.
Support contains 105 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 888/888 transitions.
Applied a total of 0 rules in 36 ms. Remains 498 /498 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 498/498 places, 888/888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 888/888 transitions.
Applied a total of 0 rules in 37 ms. Remains 498 /498 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2024-05-31 19:22:17] [INFO ] Invariant cache hit.
[2024-05-31 19:22:18] [INFO ] Implicit Places using invariants in 753 ms returned [1, 19, 23, 70, 121, 142, 157, 172, 173, 174, 175, 176, 194, 212, 277, 287, 302, 307, 324, 325, 326, 363, 366, 384, 385, 387, 388, 401, 407, 413, 419, 425, 431, 437, 443, 455, 461]
[2024-05-31 19:22:18] [INFO ] Actually due to overlaps returned [326, 176, 194, 366, 175, 325, 385, 174, 324, 363, 384, 1, 173, 302, 19, 70, 172, 212, 388, 431, 461, 23, 157, 307, 387, 401, 407, 413, 419, 425, 437, 443, 455]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 771 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/498 places, 888/888 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 461 transition count 871
Reduce places removed 17 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 28 rules applied. Total rules applied 49 place count 444 transition count 860
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 60 place count 433 transition count 860
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 60 place count 433 transition count 846
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 88 place count 419 transition count 846
Discarding 2 places :
Implicit places reduction removed 2 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 3 with 4 rules applied. Total rules applied 92 place count 417 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 415 transition count 844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 94 place count 415 transition count 843
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 96 place count 414 transition count 843
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 107 place count 403 transition count 832
Iterating global reduction 5 with 11 rules applied. Total rules applied 118 place count 403 transition count 832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 403 transition count 831
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 122 place count 400 transition count 828
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 400 transition count 828
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 127 place count 398 transition count 826
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 398 transition count 826
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 169 place count 378 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 181 place count 378 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 193 place count 366 transition count 794
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 202 place count 366 transition count 794
Applied a total of 202 rules in 210 ms. Remains 366 /465 variables (removed 99) and now considering 794/888 (removed 94) transitions.
// Phase 1: matrix 794 rows 366 cols
[2024-05-31 19:22:18] [INFO ] Computed 54 invariants in 11 ms
[2024-05-31 19:22:19] [INFO ] Implicit Places using invariants in 469 ms returned [83, 119, 140, 212, 224, 238, 350, 353, 356, 359, 362]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 473 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 355/498 places, 794/888 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 355 transition count 791
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 352 transition count 791
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 350 transition count 788
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 350 transition count 788
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 350 transition count 787
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 346 transition count 783
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 346 transition count 780
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 25 place count 343 transition count 780
Applied a total of 25 rules in 85 ms. Remains 343 /355 variables (removed 12) and now considering 780/794 (removed 14) transitions.
// Phase 1: matrix 780 rows 343 cols
[2024-05-31 19:22:19] [INFO ] Computed 43 invariants in 10 ms
[2024-05-31 19:22:19] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-31 19:22:19] [INFO ] Invariant cache hit.
[2024-05-31 19:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:22:20] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 343/498 places, 780/888 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3044 ms. Remains : 343/498 places, 780/888 transitions.
RANDOM walk for 40000 steps (688 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (231 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 296260 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296260 steps, saw 147426 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-31 19:22:24] [INFO ] Invariant cache hit.
[2024-05-31 19:22:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 86/191 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 149/340 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/343 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 780/1123 variables, 343/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1123 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1123 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1123 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1123/1123 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 343/343 constraints, ReadFeed: 1/1 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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 86/191 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:22:24] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 2 ms to minimize.
[2024-05-31 19:22:24] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/340 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/343 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 780/1123 variables, 343/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1123 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1123 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1123 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1123 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1123/1123 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20728 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 343/343 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 21357ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1807 ms.
Support contains 105 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 780/780 transitions.
Applied a total of 0 rules in 12 ms. Remains 343 /343 variables (removed 0) and now considering 780/780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 343/343 places, 780/780 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 780/780 transitions.
Applied a total of 0 rules in 12 ms. Remains 343 /343 variables (removed 0) and now considering 780/780 (removed 0) transitions.
[2024-05-31 19:22:47] [INFO ] Invariant cache hit.
[2024-05-31 19:22:47] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 19:22:47] [INFO ] Invariant cache hit.
[2024-05-31 19:22:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:22:48] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-31 19:22:48] [INFO ] Redundant transitions in 83 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-31 19:22:48] [INFO ] Invariant cache hit.
[2024-05-31 19:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/1123 variables, and 43 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-31 19:23:27] [INFO ] Deduced a trap composed of 152 places in 320 ms of which 4 ms to minimize.
[2024-05-31 19:23:32] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
Problem TDEAD584 is UNSAT
[2024-05-31 19:23:35] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-05-31 19:23:35] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 3 ms to minimize.
[2024-05-31 19:23:35] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 3 ms to minimize.
[2024-05-31 19:23:36] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
[2024-05-31 19:23:36] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
Problem TDEAD669 is UNSAT
[2024-05-31 19:23:37] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
Problem TDEAD699 is UNSAT
[2024-05-31 19:23:37] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD776 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 9/52 constraints. Problems are: Problem set: 15 solved, 764 unsolved
[2024-05-31 19:23:45] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 3 ms to minimize.
[2024-05-31 19:23:46] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 2/54 constraints. Problems are: Problem set: 15 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/1123 variables, and 54 constraints, problems are : Problem set: 15 solved, 764 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 11/11 constraints]
After SMT, in 60972ms problems are : Problem set: 15 solved, 764 unsolved
Search for dead transitions found 15 dead transitions in 60993ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 343/343 places, 765/780 transitions.
Graph (complete) has 1837 edges and 343 vertex of which 342 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 342 /343 variables (removed 1) and now considering 765/765 (removed 0) transitions.
// Phase 1: matrix 765 rows 342 cols
[2024-05-31 19:23:49] [INFO ] Computed 45 invariants in 7 ms
[2024-05-31 19:23:50] [INFO ] Implicit Places using invariants in 464 ms returned [29, 338]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 484 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/343 places, 765/780 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 339 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 339 transition count 764
Applied a total of 2 rules in 20 ms. Remains 339 /340 variables (removed 1) and now considering 764/765 (removed 1) transitions.
// Phase 1: matrix 764 rows 339 cols
[2024-05-31 19:23:50] [INFO ] Computed 43 invariants in 7 ms
[2024-05-31 19:23:50] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-31 19:23:50] [INFO ] Invariant cache hit.
[2024-05-31 19:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:23:51] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 339/343 places, 764/780 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 64131 ms. Remains : 339/343 places, 764/780 transitions.
RANDOM walk for 40000 steps (677 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (218 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (167 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 330544 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 330544 steps, saw 164137 distinct states, run finished after 3003 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-31 19:23:54] [INFO ] Invariant cache hit.
[2024-05-31 19:23:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 111/216 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 122/338 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/339 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 764/1103 variables, 339/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1103 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 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/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 111/216 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 122/338 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/339 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 764/1103 variables, 339/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1103 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 388 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24915 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 25582ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 29503 ms.
Support contains 105 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 764/764 transitions.
Applied a total of 0 rules in 10 ms. Remains 339 /339 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 339/339 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 764/764 transitions.
Applied a total of 0 rules in 12 ms. Remains 339 /339 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-31 19:24:49] [INFO ] Invariant cache hit.
[2024-05-31 19:24:50] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-31 19:24:50] [INFO ] Invariant cache hit.
[2024-05-31 19:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:24:51] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2024-05-31 19:24:51] [INFO ] Redundant transitions in 18 ms returned []
Running 763 sub problems to find dead transitions.
[2024-05-31 19:24:51] [INFO ] Invariant cache hit.
[2024-05-31 19:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 763 unsolved
[2024-05-31 19:25:17] [INFO ] Deduced a trap composed of 163 places in 403 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 339/1103 variables, and 44 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/339 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 763 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 763 unsolved
[2024-05-31 19:25:41] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 4 ms to minimize.
[2024-05-31 19:25:41] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 5 ms to minimize.
[2024-05-31 19:25:42] [INFO ] Deduced a trap composed of 42 places in 460 ms of which 4 ms to minimize.
[2024-05-31 19:25:44] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 339/1103 variables, and 48 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/339 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/763 constraints, Known Traps: 5/5 constraints]
After SMT, in 60749ms problems are : Problem set: 0 solved, 763 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62218 ms. Remains : 339/339 places, 764/764 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 339 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 338 transition count 763
Applied a total of 2 rules in 22 ms. Remains 338 /339 variables (removed 1) and now considering 763/764 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 763 rows 338 cols
[2024-05-31 19:25:51] [INFO ] Computed 43 invariants in 10 ms
[2024-05-31 19:25:52] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 19:25:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-31 19:25:52] [INFO ] [Nat]Absence check using 16 positive and 27 generalized place invariants in 24 ms returned sat
[2024-05-31 19:25:58] [INFO ] After 5730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 19:25:58] [INFO ] Deduced a trap composed of 48 places in 342 ms of which 10 ms to minimize.
[2024-05-31 19:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
TRAPS : Iteration 1
[2024-05-31 19:26:03] [INFO ] After 11248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 19:26:05] [INFO ] After 12941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 13233 ms.
[2024-05-31 19:26:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-31 19:26:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 339 places, 764 transitions and 3010 arcs took 16 ms.
[2024-05-31 19:26:05] [INFO ] Flatten gal took : 249 ms
Total runtime 279138 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ASLink-PT-02a-ReachabilityFireability-2024-00
Could not compute solution for formula : ASLink-PT-02a-ReachabilityFireability-2024-15
BK_STOP 1717183566200
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-02a-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/723/inv_0_
rfs formula name ASLink-PT-02a-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/723/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-02a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 '
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 ;