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-171654455000163.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-S02J06T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K 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 1.1M 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 1717103831245

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-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:17:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:17:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:17:12] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-30 21:17:12] [INFO ] Transformed 844 places.
[2024-05-30 21:17:12] [INFO ] Transformed 1812 transitions.
[2024-05-30 21:17:12] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 256 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (9 resets) in 2890 ms. (13 steps per ms) remains 22/844 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 85 ms. (46 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
[2024-05-30 21:17:14] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-30 21:17:14] [INFO ] Computed 58 invariants in 96 ms
[2024-05-30 21:17:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/841 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/842 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1632/2474 variables, 842/899 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2474 variables, 120/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2474 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2476 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2476 variables, 1/1022 constraints. Problems are: Problem set: 0 solved, 22 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 2476/2476 variables, and 1022 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5068 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:17:23] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 39 ms to minimize.
[2024-05-30 21:17:23] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 4 ms to minimize.
[2024-05-30 21:17:24] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 3 ms to minimize.
[2024-05-30 21:17:24] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:17:24] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 10415ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
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 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 296 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-30 21:17:24] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-30 21:17:24] [INFO ] Computed 56 invariants in 44 ms
[2024-05-30 21:17:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-30 21:17:39] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 4 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:17:40] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-30 21:17:41] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:17:41] [INFO ] Deduced a trap composed of 47 places in 362 ms of which 5 ms to minimize.
[2024-05-30 21:17:42] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 4 ms to minimize.
[2024-05-30 21:17:42] [INFO ] Deduced a trap composed of 186 places in 346 ms of which 4 ms to minimize.
[2024-05-30 21:17:47] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 69 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-30 21:18:01] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-05-30 21:18:07] [INFO ] Deduced a trap composed of 37 places in 382 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 71 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 17/17 constraints]
After SMT, in 43485ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43831 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 4000000 steps (1401 resets) in 42187 ms. (94 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 1990 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 1808 ms. (221 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1772 ms. (225 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (46 resets) in 1867 ms. (214 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (64 resets) in 1613 ms. (247 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (45 resets) in 1663 ms. (240 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (57 resets) in 1834 ms. (217 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1672 ms. (239 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 1632 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (45 resets) in 1632 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (60 resets) in 1587 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 1570 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1528 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 1569 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (48 resets) in 1636 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (47 resets) in 1573 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 1591 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (50 resets) in 1568 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41 resets) in 1582 ms. (252 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 2383 ms. (167 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (67 resets) in 2028 ms. (197 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41 resets) in 1573 ms. (254 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 2095209 steps, run timeout after 69001 ms. (steps per millisecond=30 ) properties seen :0 out of 22
Probabilistic random walk after 2095209 steps, saw 1321562 distinct states, run finished after 69017 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-30 21:19:40] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-30 21:19:40] [INFO ] Invariant cache hit.
[2024-05-30 21:19:40] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 11/540 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 10/550 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1342/1892 variables, 550/605 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1892 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 2/1894 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 728 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4976 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:20:05] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 4 ms to minimize.
[2024-05-30 21:20:05] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2024-05-30 21:20:05] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-30 21:20:06] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 11/540 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:20:08] [INFO ] Deduced a trap composed of 241 places in 331 ms of which 3 ms to minimize.
[2024-05-30 21:20:09] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 10/550 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/550 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1342/1892 variables, 550/616 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1892 variables, 120/736 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem smplace_81 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 48802ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 8604 ms.
Support contains 22 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 41 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 36 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-30 21:20:37] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-30 21:20:37] [INFO ] Invariant cache hit.
[2024-05-30 21:20:38] [INFO ] Implicit Places using invariants in 728 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 735 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 67 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-05-30 21:20:38] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-05-30 21:20:38] [INFO ] Computed 46 invariants in 57 ms
[2024-05-30 21:20:39] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-30 21:20:39] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-30 21:20:39] [INFO ] Invariant cache hit.
[2024-05-30 21:20:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 21:20:53] [INFO ] Implicit Places using invariants and state equation in 14191 ms returned []
Implicit Place search using SMT with State Equation took 15010 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15849 ms. Remains : 533/552 places, 1353/1362 transitions.
Total runtime 221217 ms.
ITS solved all properties within timeout

BK_STOP 1717104053802

--------------------
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-S02J06T10"
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-S02J06T10, 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-171654455000163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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