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

--------------------
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 1716325918102

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:11:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 21:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:11:59] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 21:11:59] [INFO ] Transformed 314 places.
[2024-05-21 21:11:59] [INFO ] Transformed 271 transitions.
[2024-05-21 21:11:59] [INFO ] Found NUPN structural information;
[2024-05-21 21:11:59] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 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 (866 resets) in 2165 ms. (18 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 40002 steps (178 resets) in 581 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (188 resets) in 310 ms. (128 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (185 resets) in 321 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (179 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (189 resets) in 136 ms. (292 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (190 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (180 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (170 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (178 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (187 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
// Phase 1: matrix 257 rows 314 cols
[2024-05-21 21:12:01] [INFO ] Computed 59 invariants in 27 ms
[2024-05-21 21:12:01] [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 3086 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-21 21:12:04] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 12 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/571 variables, and 622 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5015 ms.
Refiners :[Domain max(s): 278/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 8219ms 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 78 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 95 ms. Remains : 313/314 places, 255/257 transitions.
RANDOM walk for 40000 steps (702 resets) in 581 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (144 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (146 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (152 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (131 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (137 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (149 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (132 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (142 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 612763 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 10
Probabilistic random walk after 612763 steps, saw 89114 distinct states, run finished after 3005 ms. (steps per millisecond=203 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-21 21:12:12] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 21:12:12] [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 1424 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-21 21:12:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 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-21 21:12:17] [INFO ] Deduced a trap composed of 16 places in 43 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 7437 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 8900ms problems are : Problem set: 2 solved, 8 unsolved
Parikh walk visited 0 properties in 25317 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 18 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 18 ms. Remains : 313/313 places, 254/255 transitions.
RANDOM walk for 40000 steps (606 resets) in 220 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (112 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (128 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (100 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (108 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (116 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (106 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (116 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 690648 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 8
Probabilistic random walk after 690648 steps, saw 99133 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
// Phase 1: matrix 254 rows 313 cols
[2024-05-21 21:12:50] [INFO ] Computed 61 invariants in 10 ms
[2024-05-21 21:12:50] [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 1037 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-21 21:12:51] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:12:51] [INFO ] Deduced a trap composed of 13 places in 48 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-21 21:12:52] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 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-21 21:12:54] [INFO ] Deduced a trap composed of 23 places in 47 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-21 21:12:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:12:58] [INFO ] Deduced a trap composed of 14 places in 44 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-21 21:13:01] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 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-21 21:13:05] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
[2024-05-21 21:13:06] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:13:06] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:13:06] [INFO ] Deduced a trap composed of 21 places in 47 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 20304 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 21377ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 17981 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 13 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 13 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 11 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-21 21:13:29] [INFO ] Invariant cache hit.
[2024-05-21 21:13:30] [INFO ] Implicit Places using invariants in 223 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 249 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 11 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 271 ms. Remains : 312/313 places, 254/254 transitions.
RANDOM walk for 40000 steps (605 resets) in 465 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (115 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (110 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (125 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (106 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (114 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 657163 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 8
Probabilistic random walk after 657163 steps, saw 94648 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 21:13:33] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 21:13:33] [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 981 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-21 21:13:34] [INFO ] Deduced a trap composed of 12 places in 66 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-21 21:13:36] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 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-21 21:13:40] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/566 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 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-21 21:13:47] [INFO ] Deduced a trap composed of 17 places in 87 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-21 21:13:48] [INFO ] Deduced a trap composed of 10 places in 72 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 18382 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 19392ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 18952 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 12 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 15 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 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-21 21:14:11] [INFO ] Invariant cache hit.
[2024-05-21 21:14:12] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 21:14:12] [INFO ] Invariant cache hit.
[2024-05-21 21:14:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:14:12] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-21 21:14:12] [INFO ] Redundant transitions in 16 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-21 21:14:12] [INFO ] Invariant cache hit.
[2024-05-21 21:14:12] [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 13481 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-21 21:14:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:14:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:14:29] [INFO ] Deduced a trap composed of 9 places in 30 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-21 21:14:45] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-21 21:14:46] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-21 21:14:55] [INFO ] Deduced a trap composed of 18 places in 57 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 30017 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 43735ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 43739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44338 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 15 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-21 21:14:56] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 21:14:56] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 21:14:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 21:14:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 21:14:57] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-21 21:14:57] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 5 ms to minimize.
[2024-05-21 21:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-21 21:14:57] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
TRAPS : Iteration 1
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 17 places in 685 ms of which 2 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 732 ms
TRAPS : Iteration 2
[2024-05-21 21:14:59] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
TRAPS : Iteration 3
[2024-05-21 21:15:00] [INFO ] After 3381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-21 21:15:00] [INFO ] After 4058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 4235 ms.
[2024-05-21 21:15:00] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 17 ms.
[2024-05-21 21:15:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 254 transitions and 1250 arcs took 17 ms.
[2024-05-21 21:15:00] [INFO ] Flatten gal took : 111 ms
Total runtime 181638 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-50a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 312
TRANSITIONS: 254
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 696
MODEL NAME: /home/mcc/execution/411/model
312 places, 254 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50a-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-12 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-13 CANNOT_COMPUTE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716326924361

--------------------
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
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r091-tall-171624188300734"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;