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.r289-tajo-171654445400222.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-S02J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 862K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716859215048

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 01:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:20:16] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-28 01:20:16] [INFO ] Transformed 476 places.
[2024-05-28 01:20:16] [INFO ] Transformed 920 transitions.
[2024-05-28 01:20:16] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (15 resets) in 2148 ms. (18 steps per ms) remains 13/16 properties
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 538 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (9 resets) in 511 ms. (78 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (13 resets) in 542 ms. (73 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (11 resets) in 341 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 608 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 297 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 1004 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (10 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
[2024-05-28 01:20:19] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 01:20:19] [INFO ] Computed 46 invariants in 39 ms
[2024-05-28 01:20:19] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 51/394 variables, 7/19 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/20 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 82/476 variables, 26/46 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 812/1288 variables, 476/522 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 72/594 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 11 solved, 2 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/224 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/6 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/227 variables, 2/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 239/466 variables, 34/42 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-28 01:20:21] [INFO ] Deduced a trap composed of 243 places in 275 ms of which 35 ms to minimize.
[2024-05-28 01:20:22] [INFO ] Deduced a trap composed of 107 places in 270 ms of which 4 ms to minimize.
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/44 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/44 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/468 variables, 2/46 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/46 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/474 variables, 1/47 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 01:20:22] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-28 01:20:22] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 2/49 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/49 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1286/1288 variables, and 523 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2807 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 474/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 4851ms problems are : Problem set: 12 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 474 transition count 788
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 80 place count 438 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 432 transition count 782
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 86 place count 432 transition count 776
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 426 transition count 776
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 134 place count 408 transition count 758
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 152 place count 408 transition count 740
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 170 place count 390 transition count 740
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 176 place count 390 transition count 740
Applied a total of 176 rules in 249 ms. Remains 390 /476 variables (removed 86) and now considering 740/824 (removed 84) transitions.
Running 738 sub problems to find dead transitions.
[2024-05-28 01:20:24] [INFO ] Flow matrix only has 728 transitions (discarded 12 similar events)
// Phase 1: matrix 728 rows 390 cols
[2024-05-28 01:20:24] [INFO ] Computed 44 invariants in 18 ms
[2024-05-28 01:20:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-05-28 01:20:29] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:20:30] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 2 ms to minimize.
[2024-05-28 01:20:30] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:20:30] [INFO ] Deduced a trap composed of 194 places in 349 ms of which 4 ms to minimize.
[2024-05-28 01:20:30] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 2 ms to minimize.
[2024-05-28 01:20:31] [INFO ] Deduced a trap composed of 199 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:20:31] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-05-28 01:20:31] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2024-05-28 01:20:31] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-05-28 01:20:31] [INFO ] Deduced a trap composed of 52 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:20:32] [INFO ] Deduced a trap composed of 183 places in 135 ms of which 2 ms to minimize.
[2024-05-28 01:20:32] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 3 ms to minimize.
[2024-05-28 01:20:32] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-28 01:20:33] [INFO ] Deduced a trap composed of 191 places in 137 ms of which 3 ms to minimize.
[2024-05-28 01:20:33] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 2 ms to minimize.
[2024-05-28 01:20:34] [INFO ] Deduced a trap composed of 222 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:20:34] [INFO ] Deduced a trap composed of 193 places in 127 ms of which 2 ms to minimize.
[2024-05-28 01:20:34] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
[2024-05-28 01:20:34] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:20:35] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-05-28 01:20:37] [INFO ] Deduced a trap composed of 193 places in 164 ms of which 3 ms to minimize.
[2024-05-28 01:20:38] [INFO ] Deduced a trap composed of 240 places in 148 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1118 variables, and 63 constraints, problems are : Problem set: 0 solved, 738 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-05-28 01:20:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:20:51] [INFO ] Deduced a trap composed of 193 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:20:51] [INFO ] Deduced a trap composed of 188 places in 169 ms of which 3 ms to minimize.
[2024-05-28 01:20:52] [INFO ] Deduced a trap composed of 202 places in 170 ms of which 2 ms to minimize.
[2024-05-28 01:20:53] [INFO ] Deduced a trap composed of 193 places in 146 ms of which 3 ms to minimize.
[2024-05-28 01:20:53] [INFO ] Deduced a trap composed of 193 places in 151 ms of which 3 ms to minimize.
[2024-05-28 01:20:53] [INFO ] Deduced a trap composed of 193 places in 139 ms of which 3 ms to minimize.
[2024-05-28 01:21:00] [INFO ] Deduced a trap composed of 201 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1118 variables, and 71 constraints, problems are : Problem set: 0 solved, 738 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/738 constraints, Known Traps: 30/30 constraints]
After SMT, in 41252ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 41264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41530 ms. Remains : 390/476 places, 740/824 transitions.
RANDOM walk for 40000 steps (22 resets) in 447 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (12 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 212844 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 212844 steps, saw 114461 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-28 01:21:08] [INFO ] Flow matrix only has 728 transitions (discarded 12 similar events)
[2024-05-28 01:21:08] [INFO ] Invariant cache hit.
[2024-05-28 01:21:08] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/294 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/386 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/388 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 728/1116 variables, 388/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1116 variables, 72/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1118 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1118 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1118 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1118 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 390/390 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/294 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/386 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:21:10] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 6 ms to minimize.
[2024-05-28 01:21:10] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-28 01:21:10] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:21:10] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/388 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 728/1116 variables, 388/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 72/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:21:11] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 3 ms to minimize.
[2024-05-28 01:21:12] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1118 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1118 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1118 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1118 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 390/390 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 216 ms.
Support contains 70 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 740/740 transitions.
Applied a total of 0 rules in 18 ms. Remains 390 /390 variables (removed 0) and now considering 740/740 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 390/390 places, 740/740 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 740/740 transitions.
Applied a total of 0 rules in 18 ms. Remains 390 /390 variables (removed 0) and now considering 740/740 (removed 0) transitions.
[2024-05-28 01:21:14] [INFO ] Flow matrix only has 728 transitions (discarded 12 similar events)
[2024-05-28 01:21:14] [INFO ] Invariant cache hit.
[2024-05-28 01:21:14] [INFO ] Implicit Places using invariants in 505 ms returned [95, 190, 218, 221, 345, 356]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 510 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 384/390 places, 740/740 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 380 transition count 736
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 380 transition count 736
Applied a total of 8 rules in 28 ms. Remains 380 /384 variables (removed 4) and now considering 736/740 (removed 4) transitions.
[2024-05-28 01:21:14] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
// Phase 1: matrix 724 rows 380 cols
[2024-05-28 01:21:14] [INFO ] Computed 38 invariants in 14 ms
[2024-05-28 01:21:15] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-28 01:21:15] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
[2024-05-28 01:21:15] [INFO ] Invariant cache hit.
[2024-05-28 01:21:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:21:18] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 380/390 places, 736/740 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3866 ms. Remains : 380/390 places, 736/740 transitions.
RANDOM walk for 40000 steps (24 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (11 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 208349 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 208349 steps, saw 110177 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-28 01:21:21] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
[2024-05-28 01:21:21] [INFO ] Invariant cache hit.
[2024-05-28 01:21:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 198/268 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/276 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/375 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/378 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 724/1102 variables, 378/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1102 variables, 72/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1102 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1104 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1104 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1104 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1104 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 380/380 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 198/268 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/276 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/375 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:21:22] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-28 01:21:22] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:21:22] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:21:22] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/378 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 724/1102 variables, 378/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1102 variables, 72/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1102 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1102 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1104 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1104 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6437 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 380/380 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 7133ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 70 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 736/736 transitions.
Applied a total of 0 rules in 21 ms. Remains 380 /380 variables (removed 0) and now considering 736/736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 380/380 places, 736/736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 736/736 transitions.
Applied a total of 0 rules in 18 ms. Remains 380 /380 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2024-05-28 01:21:28] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
[2024-05-28 01:21:28] [INFO ] Invariant cache hit.
[2024-05-28 01:21:28] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 01:21:28] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
[2024-05-28 01:21:29] [INFO ] Invariant cache hit.
[2024-05-28 01:21:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:21:32] [INFO ] Implicit Places using invariants and state equation in 3204 ms returned []
Implicit Place search using SMT with State Equation took 3600 ms to find 0 implicit places.
[2024-05-28 01:21:32] [INFO ] Redundant transitions in 48 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-28 01:21:32] [INFO ] Flow matrix only has 724 transitions (discarded 12 similar events)
[2024-05-28 01:21:32] [INFO ] Invariant cache hit.
[2024-05-28 01:21:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-28 01:21:37] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 199 places in 176 ms of which 3 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:21:38] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-05-28 01:21:39] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:21:39] [INFO ] Deduced a trap composed of 179 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:21:39] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:21:39] [INFO ] Deduced a trap composed of 181 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:21:40] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:21:40] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 4 ms to minimize.
[2024-05-28 01:21:40] [INFO ] Deduced a trap composed of 232 places in 189 ms of which 3 ms to minimize.
[2024-05-28 01:21:41] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:21:41] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:21:41] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:21:42] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-28 01:21:43] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:21:44] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-28 01:21:45] [INFO ] Deduced a trap composed of 222 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:21:46] [INFO ] Deduced a trap composed of 252 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:21:46] [INFO ] Deduced a trap composed of 202 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:21:47] [INFO ] Deduced a trap composed of 193 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/380 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 668 unsolved
[2024-05-28 01:22:01] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:22:01] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 2 ms to minimize.
[2024-05-28 01:22:01] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 3 ms to minimize.
[2024-05-28 01:22:02] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1104 variables, and 66 constraints, problems are : Problem set: 66 solved, 668 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 66 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 20/36 constraints. Problems are: Problem set: 66 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 24/60 constraints. Problems are: Problem set: 66 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/60 constraints. Problems are: Problem set: 66 solved, 668 unsolved
At refinement iteration 4 (OVERLAPS) 2/380 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 668 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 4/66 constraints. Problems are: Problem set: 66 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1104 variables, and 66 constraints, problems are : Problem set: 66 solved, 668 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/734 constraints, Known Traps: 28/28 constraints]
After SMT, in 60910ms problems are : Problem set: 66 solved, 668 unsolved
Search for dead transitions found 66 dead transitions in 60920ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 380/380 places, 670/736 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 378 transition count 658
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 372 transition count 646
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 8 rules in 18 ms. Remains 372 /380 variables (removed 8) and now considering 646/670 (removed 24) transitions.
[2024-05-28 01:22:33] [INFO ] Flow matrix only has 634 transitions (discarded 12 similar events)
// Phase 1: matrix 634 rows 372 cols
[2024-05-28 01:22:33] [INFO ] Computed 44 invariants in 10 ms
[2024-05-28 01:22:33] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-28 01:22:33] [INFO ] Flow matrix only has 634 transitions (discarded 12 similar events)
[2024-05-28 01:22:33] [INFO ] Invariant cache hit.
[2024-05-28 01:22:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:22:36] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 372/380 places, 646/736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67706 ms. Remains : 372/380 places, 646/736 transitions.
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
RANDOM walk for 40000 steps (25 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 253515 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 253515 steps, saw 132945 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 01:22:39] [INFO ] Flow matrix only has 634 transitions (discarded 12 similar events)
// Phase 1: matrix 634 rows 366 cols
[2024-05-28 01:22:39] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 01:22:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 64/1000 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 0/22 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 143211 ms.
ITS solved all properties within timeout

BK_STOP 1716859359579

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-S02J04T06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S02J04T06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445400222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;