Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455000158.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J06T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717103789518

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:16:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:16:31] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-30 21:16:31] [INFO ] Transformed 690 places.
[2024-05-30 21:16:31] [INFO ] Transformed 1434 transitions.
[2024-05-30 21:16:31] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 287 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (13 resets) in 2257 ms. (17 steps per ms) remains 18/690 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
[2024-05-30 21:16:32] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-30 21:16:32] [INFO ] Computed 54 invariants in 77 ms
[2024-05-30 21:16:32] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/628 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 59/687 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/688 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1290/1978 variables, 688/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1978 variables, 96/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1978 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1980 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1980 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 840 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5083 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:16:39] [INFO ] Deduced a trap composed of 369 places in 398 ms of which 42 ms to minimize.
[2024-05-30 21:16:39] [INFO ] Deduced a trap composed of 484 places in 383 ms of which 5 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 476 places in 313 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:16:41] [INFO ] Deduced a trap composed of 348 places in 260 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:16:42] [INFO ] Deduced a trap composed of 348 places in 402 ms of which 3 ms to minimize.
[2024-05-30 21:16:42] [INFO ] Deduced a trap composed of 348 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1980 variables, and 21 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 5/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 10310ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 450 place count 472 transition count 1074
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 466 place count 456 transition count 1074
Applied a total of 466 rules in 234 ms. Remains 456 /690 variables (removed 234) and now considering 1074/1306 (removed 232) transitions.
Running 1072 sub problems to find dead transitions.
[2024-05-30 21:16:42] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 456 cols
[2024-05-30 21:16:42] [INFO ] Computed 52 invariants in 25 ms
[2024-05-30 21:16:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 3 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 151 places in 150 ms of which 4 ms to minimize.
[2024-05-30 21:16:54] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-30 21:16:54] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-30 21:16:59] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 4 ms to minimize.
[2024-05-30 21:16:59] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 2 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1514 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-30 21:17:07] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-30 21:17:07] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-30 21:17:08] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-30 21:17:08] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-30 21:17:08] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-30 21:17:08] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:17:09] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:17:15] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1514 variables, and 68 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 19/19 constraints]
After SMT, in 42372ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42656 ms. Remains : 456/690 places, 1074/1306 transitions.
RANDOM walk for 4000000 steps (1738 resets) in 34369 ms. (116 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (74 resets) in 1356 ms. (294 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1348 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (62 resets) in 1347 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1348 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 1509 ms. (264 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1463 ms. (273 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (63 resets) in 1479 ms. (270 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (66 resets) in 1440 ms. (277 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1410 ms. (283 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (66 resets) in 1425 ms. (280 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (62 resets) in 1382 ms. (289 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (80 resets) in 1383 ms. (289 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (72 resets) in 1401 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (65 resets) in 1401 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (72 resets) in 1384 ms. (288 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (63 resets) in 1435 ms. (278 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1458 ms. (274 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1448 ms. (276 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1725680 steps, run timeout after 48001 ms. (steps per millisecond=35 ) properties seen :0 out of 18
Probabilistic random walk after 1725680 steps, saw 989009 distinct states, run finished after 48010 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-30 21:18:30] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-30 21:18:30] [INFO ] Invariant cache hit.
[2024-05-30 21:18:30] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1058/1512 variables, 454/505 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/1514 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1514 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 604 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2306 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:18:34] [INFO ] Deduced a trap composed of 177 places in 288 ms of which 3 ms to minimize.
[2024-05-30 21:18:34] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 2 ms to minimize.
[2024-05-30 21:18:34] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-30 21:18:34] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2024-05-30 21:18:34] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 6 ms to minimize.
[2024-05-30 21:18:35] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:18:35] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:18:37] [INFO ] Deduced a trap composed of 194 places in 321 ms of which 4 ms to minimize.
[2024-05-30 21:18:38] [INFO ] Deduced a trap composed of 199 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:18:38] [INFO ] Deduced a trap composed of 152 places in 235 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1058/1512 variables, 454/520 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1512 variables, 96/616 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/1514 variables, and 634 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 454/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 15/15 constraints]
After SMT, in 47353ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 34 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 456/456 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 31 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-30 21:19:17] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-30 21:19:17] [INFO ] Invariant cache hit.
[2024-05-30 21:19:18] [INFO ] Implicit Places using invariants in 614 ms returned [43, 116, 194, 231, 308, 324, 381, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 627 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/456 places, 1074/1074 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1070
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1070
Applied a total of 8 rules in 77 ms. Remains 444 /448 variables (removed 4) and now considering 1070/1074 (removed 4) transitions.
[2024-05-30 21:19:18] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
// Phase 1: matrix 1054 rows 444 cols
[2024-05-30 21:19:18] [INFO ] Computed 44 invariants in 46 ms
[2024-05-30 21:19:18] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-30 21:19:18] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-30 21:19:18] [INFO ] Invariant cache hit.
[2024-05-30 21:19:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-30 21:19:26] [INFO ] Implicit Places using invariants and state equation in 8004 ms returned []
Implicit Place search using SMT with State Equation took 8645 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/456 places, 1070/1074 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9382 ms. Remains : 444/456 places, 1070/1074 transitions.
RANDOM walk for 4000000 steps (1731 resets) in 32782 ms. (122 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (72 resets) in 1352 ms. (295 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (70 resets) in 1362 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (54 resets) in 1363 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (67 resets) in 1328 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (66 resets) in 1328 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (63 resets) in 1321 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (70 resets) in 1319 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (61 resets) in 1321 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (72 resets) in 1309 ms. (305 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (66 resets) in 1317 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (63 resets) in 1341 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (61 resets) in 1355 ms. (294 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (86 resets) in 1322 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (72 resets) in 1330 ms. (300 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (71 resets) in 1310 ms. (305 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (73 resets) in 1303 ms. (306 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1325 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (66 resets) in 1304 ms. (306 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1399426 steps, run timeout after 42001 ms. (steps per millisecond=33 ) properties seen :0 out of 18
Probabilistic random walk after 1399426 steps, saw 781838 distinct states, run finished after 42003 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-30 21:20:23] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-30 21:20:23] [INFO ] Invariant cache hit.
[2024-05-30 21:20:23] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/442 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1054/1496 variables, 442/485 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1496 variables, 96/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/1498 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1498/1498 variables, and 584 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2354 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 444/444 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 21:20:28] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 4 ms to minimize.
[2024-05-30 21:20:28] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:20:29] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:20:29] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:20:29] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 4 ms to minimize.
[2024-05-30 21:20:29] [INFO ] Deduced a trap composed of 165 places in 298 ms of which 4 ms to minimize.
[2024-05-30 21:20:29] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:20:30] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:20:30] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:20:30] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 3 ms to minimize.
[2024-05-30 21:20:31] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 4 ms to minimize.
[2024-05-30 21:20:31] [INFO ] Deduced a trap composed of 186 places in 220 ms of which 3 ms to minimize.
[2024-05-30 21:20:31] [INFO ] Deduced a trap composed of 189 places in 249 ms of which 3 ms to minimize.
[2024-05-30 21:20:31] [INFO ] Deduced a trap composed of 210 places in 225 ms of which 3 ms to minimize.
[2024-05-30 21:20:31] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/442 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1054/1496 variables, 442/500 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 96/596 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_98 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 30310ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 6798 ms.
Support contains 18 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 34 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 444/444 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 21 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-30 21:21:01] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-30 21:21:01] [INFO ] Invariant cache hit.
[2024-05-30 21:21:01] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-30 21:21:01] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-30 21:21:01] [INFO ] Invariant cache hit.
[2024-05-30 21:21:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-30 21:21:08] [INFO ] Implicit Places using invariants and state equation in 7389 ms returned []
Implicit Place search using SMT with State Equation took 7907 ms to find 0 implicit places.
[2024-05-30 21:21:09] [INFO ] Redundant transitions in 106 ms returned []
Running 1068 sub problems to find dead transitions.
[2024-05-30 21:21:09] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-30 21:21:09] [INFO ] Invariant cache hit.
[2024-05-30 21:21:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
[2024-05-30 21:21:17] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-30 21:21:19] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-05-30 21:21:21] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/444 variables, 7/47 constraints. Problems are: Problem set: 88 solved, 980 unsolved
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-30 21:21:40] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:21:41] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 4 ms to minimize.
[2024-05-30 21:21:41] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
SMT process timed out in 32331ms, After SMT, problems are : Problem set: 88 solved, 980 unsolved
Search for dead transitions found 88 dead transitions in 32349ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 444/444 places, 982/1070 transitions.
Reduce places removed 0 places and 16 transitions.
Graph (complete) has 2846 edges and 444 vertex of which 18 are kept as prefixes of interest. Removing 426 places using SCC suffix rule.4 ms
Discarding 426 places :
Also discarding 950 output transitions
Drop transitions (Output transitions of discarded places.) removed 950 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 16
Reduce places removed 0 places and 16 transitions.
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 1 rules in 19 ms. Remains 18 /444 variables (removed 426) and now considering 0/982 (removed 982) transitions.
[2024-05-30 21:21:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-30 21:21:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-30 21:21:41] [INFO ] Invariant cache hit.
[2024-05-30 21:21:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 18/444 places, 0/1070 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40458 ms. Remains : 18/444 places, 0/1070 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 310744 ms.
ITS solved all properties within timeout

BK_STOP 1717104101554

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-PT-S02J06T08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455000158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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