About the Execution of LTSMin+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 575.359 | 166835.00 | 259097.00 | 421.60 | TTT?F?F?TT?????T | 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.r480-tall-171624189900734.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 DES-PT-50a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900734
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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 DES-PT-50a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717197221828
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:13:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:13:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:13:43] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-31 23:13:43] [INFO ] Transformed 314 places.
[2024-05-31 23:13:43] [INFO ] Transformed 271 transitions.
[2024-05-31 23:13:43] [INFO ] Found NUPN structural information;
[2024-05-31 23:13:43] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (877 resets) in 2231 ms. (17 steps per ms) remains 11/13 properties
FORMULA DES-PT-50a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (183 resets) in 335 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (179 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (181 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (197 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (178 resets) in 380 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (188 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (167 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (185 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (184 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (180 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (185 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
// Phase 1: matrix 257 rows 314 cols
[2024-05-31 23:13:45] [INFO ] Computed 59 invariants in 27 ms
[2024-05-31 23:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 25/110 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 25/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 32/142 variables, 16/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 133/275 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 133/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 3/278 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem DES-PT-50a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DES-PT-50a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 256/534 variables, 278/615 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 1/616 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/616 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 37/571 variables, 36/652 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 36/688 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/571 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 688 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2985 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 25/107 variables, 18/100 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 25/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 32/139 variables, 16/141 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 32/173 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 4/177 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 136/275 variables, 20/197 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 136/333 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 23:13:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 23 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/278 variables, 1/335 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 3/338 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 256/534 variables, 278/616 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/617 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 5/622 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 23:13:53] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
SMT process timed out in 8143ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 313 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 313 transition count 255
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 313 transition count 255
Applied a total of 6 rules in 106 ms. Remains 313 /314 variables (removed 1) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 313/314 places, 255/257 transitions.
RANDOM walk for 40000 steps (740 resets) in 926 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (147 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (138 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (144 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (142 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (146 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (144 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (131 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (142 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (139 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 770127 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 10
Probabilistic random walk after 770127 steps, saw 111071 distinct states, run finished after 3005 ms. (steps per millisecond=256 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-31 23:13:57] [INFO ] Computed 60 invariants in 8 ms
[2024-05-31 23:13:57] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 25/107 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 32/139 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 137/276 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 3/279 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 255/534 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 34/568 variables, 34/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 377 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 313/313 constraints, ReadFeed: 4/4 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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 25/107 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 32/139 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 137/276 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:13:59] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 3/279 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DES-PT-50a-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DES-PT-50a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 255/534 variables, 279/340 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 4/344 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 5/349 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem DES-PT-50a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DES-PT-50a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 34/568 variables, 34/383 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 3/386 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 23:14:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 1/387 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/568 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 387 constraints, problems are : Problem set: 2 solved, 8 unsolved in 7732 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 313/313 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 9347ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 15114 ms.
Support contains 48 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 313 transition count 254
Applied a total of 1 rules in 14 ms. Remains 313 /313 variables (removed 0) and now considering 254/255 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 313/313 places, 254/255 transitions.
RANDOM walk for 40000 steps (616 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (117 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (112 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (103 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (105 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (106 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (98 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (123 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 613296 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 8
Probabilistic random walk after 613296 steps, saw 88255 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 254 rows 313 cols
[2024-05-31 23:14:24] [INFO ] Computed 61 invariants in 14 ms
[2024-05-31 23:14:24] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/72 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 47/119 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 153/272 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 254/526 variables, 272/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 41/567 variables, 41/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/567 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 378 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/72 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 47/119 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 153/272 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:14:26] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 254/526 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 41/567 variables, 41/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:33] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:14:33] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/567 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:14:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:14:40] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
[2024-05-31 23:14:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:14:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/567 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/567 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 397 constraints, problems are : Problem set: 0 solved, 8 unsolved in 20386 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 11/11 constraints]
After SMT, in 21458ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 19208 ms.
Support contains 48 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 24 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 313/313 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-31 23:15:05] [INFO ] Invariant cache hit.
[2024-05-31 23:15:05] [INFO ] Implicit Places using invariants in 243 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/313 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 278 ms. Remains : 312/313 places, 254/254 transitions.
RANDOM walk for 40000 steps (607 resets) in 393 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (103 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (107 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (117 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (115 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (104 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (111 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (115 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (117 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 737162 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 8
Probabilistic random walk after 737162 steps, saw 105997 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-31 23:15:09] [INFO ] Computed 60 invariants in 5 ms
[2024-05-31 23:15:09] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/72 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 46/118 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 153/271 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 254/525 variables, 271/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 41/566 variables, 41/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 374 constraints, problems are : Problem set: 0 solved, 8 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/72 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 46/118 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 153/271 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 254/525 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 41/566 variables, 41/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:15:16] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/566 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:15:18] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:23] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/566 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:15:24] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/566 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/566 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/566 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 390 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18756 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 19669ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 11481 ms.
Support contains 48 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-31 23:15:40] [INFO ] Invariant cache hit.
[2024-05-31 23:15:40] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 23:15:40] [INFO ] Invariant cache hit.
[2024-05-31 23:15:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:15:41] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-31 23:15:41] [INFO ] Redundant transitions in 10 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-31 23:15:41] [INFO ] Invariant cache hit.
[2024-05-31 23:15:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/566 variables, 312/372 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 0/566 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 374 constraints, problems are : Problem set: 0 solved, 253 unsolved in 13308 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-31 23:15:56] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-31 23:15:57] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:15:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/566 variables, 312/375 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 253/630 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-31 23:16:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:16:14] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:16:23] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 633 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 6/6 constraints]
After SMT, in 43547ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 43550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44118 ms. Remains : 312/312 places, 254/254 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-31 23:16:24] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 23:16:24] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 23:16:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:16:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:16:25] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-31 23:16:25] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 23:16:25] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-05-31 23:16:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 2
[2024-05-31 23:16:26] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 3
[2024-05-31 23:16:27] [INFO ] After 2681ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-31 23:16:28] [INFO ] After 3177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 3362 ms.
[2024-05-31 23:16:28] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 23:16:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 254 transitions and 1250 arcs took 4 ms.
[2024-05-31 23:16:28] [INFO ] Flatten gal took : 68 ms
Total runtime 165079 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 : DES-PT-50a-ReachabilityCardinality-2024-03
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-05
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-07
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-10
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-11
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-12
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-13
Could not compute solution for formula : DES-PT-50a-ReachabilityCardinality-2024-14
BK_STOP 1717197388663
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/676/inv_0_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/676/inv_1_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_2_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/676/inv_3_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_4_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/676/inv_5_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/676/inv_6_
rfs formula name DES-PT-50a-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_7_
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="DES-PT-50a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-50a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189900734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;