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.r518-tajo-171654455700163.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 ltsminxred
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 r518-tajo-171654455700163
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:20:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:20:39] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-06-01 19:20:39] [INFO ] Transformed 844 places.
[2024-06-01 19:20:39] [INFO ] Transformed 1812 transitions.
[2024-06-01 19:20:39] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 272 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (10 resets) in 2377 ms. (16 steps per ms) remains 22/844 properties
BEST_FIRST walk for 4001 steps (8 resets) in 85 ms. (46 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 200 ms. (19 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 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 4004 steps (8 resets) in 31 ms. (125 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 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 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 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 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 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
[2024-06-01 19:20:41] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 19:20:41] [INFO ] Computed 58 invariants in 96 ms
[2024-06-01 19:20:41] [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
At refinement iteration 16 (INCLUDED_ONLY) 0/2476 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 22 unsolved
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 5046 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-06-01 19:20:49] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 30 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:20:50] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 159 places in 401 ms of which 4 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 432 places in 526 ms of which 6 ms to minimize.
SMT process timed out in 10601ms, 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 1 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 5 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 310 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-06-01 19:20:52] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-06-01 19:20:52] [INFO ] Computed 56 invariants in 83 ms
[2024-06-01 19:20:52] [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-06-01 19:21:07] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:21:08] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:21:08] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:21:08] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 5 ms to minimize.
[2024-06-01 19:21:09] [INFO ] Deduced a trap composed of 79 places in 290 ms of which 4 ms to minimize.
[2024-06-01 19:21:09] [INFO ] Deduced a trap composed of 186 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:21:14] [INFO ] Deduced a trap composed of 332 places in 354 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 4.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 9.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 5.0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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-06-01 19:21:29] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:21:35] [INFO ] Deduced a trap composed of 37 places in 345 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 20033 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 43656ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44018 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 4000000 steps (1449 resets) in 41403 ms. (96 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (54 resets) in 1767 ms. (226 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (46 resets) in 1766 ms. (226 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 1804 ms. (221 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 1635 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 1611 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 1611 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (39 resets) in 1592 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (63 resets) in 1646 ms. (242 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 1578 ms. (253 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 1606 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (60 resets) in 1626 ms. (245 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 1633 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (48 resets) in 1640 ms. (243 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (57 resets) in 1593 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (74 resets) in 1599 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (55 resets) in 1594 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 1529 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 1636 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 1636 ms. (244 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1591 ms. (251 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (48 resets) in 1611 ms. (248 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (49 resets) in 1580 ms. (253 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 1852901 steps, run timeout after 63001 ms. (steps per millisecond=29 ) properties seen :0 out of 22
Probabilistic random walk after 1852901 steps, saw 1174456 distinct states, run finished after 63007 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 19:23:00] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 19:23:00] [INFO ] Invariant cache hit.
[2024-06-01 19:23:00] [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 4257 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-06-01 19:23:23] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:23:24] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 5 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-06-01 19:23:26] [INFO ] Deduced a trap composed of 241 places in 334 ms of which 3 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 246 places in 363 ms of which 4 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1892/1894 variables, and 758 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 550/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 11/11 constraints]
After SMT, in 49296ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
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 85 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 86 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 53 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-06-01 19:23:49] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-06-01 19:23:49] [INFO ] Invariant cache hit.
[2024-06-01 19:23:50] [INFO ] Implicit Places using invariants in 683 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 691 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 46 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-06-01 19:23:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-06-01 19:23:50] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 19:23:51] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-06-01 19:23:51] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:23:51] [INFO ] Invariant cache hit.
[2024-06-01 19:23:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:24:04] [INFO ] Implicit Places using invariants and state equation in 13114 ms returned []
Implicit Place search using SMT with State Equation took 13846 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 14637 ms. Remains : 533/552 places, 1353/1362 transitions.
RANDOM walk for 4000000 steps (1436 resets) in 36919 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (51 resets) in 1657 ms. (241 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 1894 ms. (211 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 1427 ms. (280 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (46 resets) in 1459 ms. (273 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1865 ms. (214 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (36 resets) in 1772 ms. (225 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (44 resets) in 1548 ms. (258 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (47 resets) in 1512 ms. (264 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (50 resets) in 1614 ms. (247 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (51 resets) in 1506 ms. (265 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (50 resets) in 1558 ms. (256 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (54 resets) in 1568 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 1526 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 1569 ms. (254 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (54 resets) in 1516 ms. (263 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (44 resets) in 1549 ms. (258 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 1564 ms. (255 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (45 resets) in 1852 ms. (215 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (43 resets) in 1534 ms. (260 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 1517 ms. (263 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (50 resets) in 1531 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (60 resets) in 1564 ms. (255 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 2057319 steps, run timeout after 60001 ms. (steps per millisecond=34 ) properties seen :0 out of 22
Probabilistic random walk after 2057319 steps, saw 1223095 distinct states, run finished after 60002 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 19:25:25] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:25:25] [INFO ] Invariant cache hit.
[2024-06-01 19:25:25] [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) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 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) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:25:31] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:25:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:25:32] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/706 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 17394ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 8119 ms.
Support contains 22 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 42 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 37 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-06-01 19:25:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:25:50] [INFO ] Invariant cache hit.
[2024-06-01 19:25:51] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-01 19:25:51] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:25:51] [INFO ] Invariant cache hit.
[2024-06-01 19:25:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:26:05] [INFO ] Implicit Places using invariants and state equation in 13983 ms returned []
Implicit Place search using SMT with State Equation took 14567 ms to find 0 implicit places.
[2024-06-01 19:26:05] [INFO ] Redundant transitions in 107 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 19:26:05] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:26:05] [INFO ] Invariant cache hit.
[2024-06-01 19:26:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 19:26:18] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:26:18] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 2 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:26:19] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:26:20] [INFO ] Deduced a trap composed of 82 places in 295 ms of which 4 ms to minimize.
[2024-06-01 19:26:22] [INFO ] Deduced a trap composed of 186 places in 260 ms of which 3 ms to minimize.
[2024-06-01 19:26:26] [INFO ] Deduced a trap composed of 332 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:26:30] [INFO ] Deduced a trap composed of 178 places in 328 ms of which 4 ms to minimize.
[2024-06-01 19:26:30] [INFO ] Deduced a trap composed of 188 places in 274 ms of which 3 ms to minimize.
[2024-06-01 19:26:31] [INFO ] Deduced a trap composed of 243 places in 349 ms of which 4 ms to minimize.
[2024-06-01 19:26:31] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:26:32] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-06-01 19:26:59] [INFO ] Deduced a trap composed of 199 places in 332 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63338ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78078 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 400000 steps (131 resets) in 5595 ms. (71 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2024-06-01 19:27:10] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-06-01 19:27:10] [INFO ] Invariant cache hit.
[2024-06-01 19:27:10] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 19:27:10] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-06-01 19:27:12] [INFO ] After 1878ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2024-06-01 19:27:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:27:13] [INFO ] After 586ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2024-06-01 19:27:15] [INFO ] After 2413ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2024-06-01 19:27:15] [INFO ] After 4461ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2024-06-01 19:27:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 19:27:15] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 57 ms returned sat
[2024-06-01 19:27:49] [INFO ] After 34015ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2024-06-01 19:27:53] [INFO ] After 3795ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :19
TRAPS : Iteration 0
[2024-06-01 19:27:55] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-06-01 19:27:56] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:27:57] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:27:58] [INFO ] Deduced a trap composed of 227 places in 358 ms of which 3 ms to minimize.
[2024-06-01 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5401 ms
[2024-06-01 19:28:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 1
[2024-06-01 19:28:07] [INFO ] Deduced a trap composed of 201 places in 383 ms of which 4 ms to minimize.
[2024-06-01 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
TRAPS : Iteration 2
[2024-06-01 19:28:11] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:28:11] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:28:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
TRAPS : Iteration 3
[2024-06-01 19:28:17] [INFO ] After 28581ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
[2024-06-01 19:28:20] [INFO ] After 65613ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 461118 ms.
ITS solved all properties within timeout

BK_STOP 1717270100774

--------------------
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 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="ltsminxred"
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 ltsminxred"
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 r518-tajo-171654455700163"
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 ;