Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654352100647.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NoC3x3-PT-6B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100647
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2023-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717243654045

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:07:35] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 12:07:35] [INFO ] Transformed 1544 places.
[2024-06-01 12:07:35] [INFO ] Transformed 2229 transitions.
[2024-06-01 12:07:35] [INFO ] Found NUPN structural information;
[2024-06-01 12:07:35] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (84 resets) in 1279 ms. (31 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 380 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 449 ms. (88 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (10 resets) in 148 ms. (268 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (9 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
// Phase 1: matrix 2229 rows 1544 cols
[2024-06-01 12:07:36] [INFO ] Computed 66 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-6B-ReachabilityFireability-2024-14 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1381/1531 variables, 64/214 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1531 variables, 1381/1595 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1531 variables, 0/1595 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/1544 variables, 2/1597 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 13/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1969 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem NoC3x3-PT-6B-ReachabilityFireability-2023-04 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2023-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1385/1531 variables, 64/210 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1531 variables, 1385/1595 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 185 places in 268 ms of which 31 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1531 variables, 3/1598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 165 places in 251 ms of which 4 ms to minimize.
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 4 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1531 variables, 7/1605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1531 variables, 0/1605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/1544 variables, 2/1607 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 13/1620 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/1620 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3164 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4562 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 6840ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 1495 ms.
Support contains 104 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1544 transition count 2033
Reduce places removed 196 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 209 rules applied. Total rules applied 405 place count 1348 transition count 2020
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 418 place count 1335 transition count 2020
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 418 place count 1335 transition count 1963
Deduced a syphon composed of 57 places in 4 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 532 place count 1278 transition count 1963
Discarding 265 places :
Symmetric choice reduction at 3 with 265 rule applications. Total rules 797 place count 1013 transition count 1698
Iterating global reduction 3 with 265 rules applied. Total rules applied 1062 place count 1013 transition count 1698
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1062 place count 1013 transition count 1670
Deduced a syphon composed of 28 places in 11 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1118 place count 985 transition count 1670
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 1209 place count 894 transition count 1420
Iterating global reduction 3 with 91 rules applied. Total rules applied 1300 place count 894 transition count 1420
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1337 place count 857 transition count 1338
Iterating global reduction 3 with 37 rules applied. Total rules applied 1374 place count 857 transition count 1338
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1385 place count 846 transition count 1316
Iterating global reduction 3 with 11 rules applied. Total rules applied 1396 place count 846 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1403 place count 839 transition count 1296
Iterating global reduction 3 with 7 rules applied. Total rules applied 1410 place count 839 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1411 place count 838 transition count 1294
Iterating global reduction 3 with 1 rules applied. Total rules applied 1412 place count 838 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1413 place count 837 transition count 1292
Iterating global reduction 3 with 1 rules applied. Total rules applied 1414 place count 837 transition count 1292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1418 place count 837 transition count 1288
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 2 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 1664 place count 714 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1666 place count 712 transition count 1150
Iterating global reduction 4 with 2 rules applied. Total rules applied 1668 place count 712 transition count 1150
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1870 place count 611 transition count 1194
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1912 place count 590 transition count 1227
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1932 place count 590 transition count 1207
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1956 place count 590 transition count 1183
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1984 place count 566 transition count 1179
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1986 place count 566 transition count 1177
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1989 place count 566 transition count 1177
Applied a total of 1989 rules in 719 ms. Remains 566 /1544 variables (removed 978) and now considering 1177/2229 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 566/1544 places, 1177/2229 transitions.
RANDOM walk for 40000 steps (190 resets) in 704 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 362 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 214008 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 214008 steps, saw 150071 distinct states, run finished after 3013 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 12:07:49] [INFO ] Flow matrix only has 1167 transitions (discarded 10 similar events)
// Phase 1: matrix 1167 rows 566 cols
[2024-06-01 12:07:49] [INFO ] Computed 66 invariants in 8 ms
[2024-06-01 12:07:49] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 446/550 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/566 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1167/1733 variables, 566/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1733 variables, 49/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1733 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1733 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1733/1733 variables, and 681 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 566/566 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 446/550 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/566 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1167/1733 variables, 566/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1733 variables, 49/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1733 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:07:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:07:53] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1733 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1733 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1733 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1733/1733 variables, and 687 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5284 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 566/566 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 5952ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 859 ms.
Support contains 104 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1177/1177 transitions.
Applied a total of 0 rules in 20 ms. Remains 566 /566 variables (removed 0) and now considering 1177/1177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 566/566 places, 1177/1177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1177/1177 transitions.
Applied a total of 0 rules in 19 ms. Remains 566 /566 variables (removed 0) and now considering 1177/1177 (removed 0) transitions.
[2024-06-01 12:07:56] [INFO ] Flow matrix only has 1167 transitions (discarded 10 similar events)
[2024-06-01 12:07:56] [INFO ] Invariant cache hit.
[2024-06-01 12:07:56] [INFO ] Implicit Places using invariants in 273 ms returned [35, 75, 372, 543]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 283 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/566 places, 1177/1177 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 552 transition count 1167
Applied a total of 20 rules in 24 ms. Remains 552 /562 variables (removed 10) and now considering 1167/1177 (removed 10) transitions.
[2024-06-01 12:07:56] [INFO ] Flow matrix only has 1157 transitions (discarded 10 similar events)
// Phase 1: matrix 1157 rows 552 cols
[2024-06-01 12:07:56] [INFO ] Computed 62 invariants in 8 ms
[2024-06-01 12:07:56] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 12:07:56] [INFO ] Flow matrix only has 1157 transitions (discarded 10 similar events)
[2024-06-01 12:07:56] [INFO ] Invariant cache hit.
[2024-06-01 12:07:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:07:57] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 552/566 places, 1167/1177 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1309 ms. Remains : 552/566 places, 1167/1177 transitions.
RANDOM walk for 40000 steps (202 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 104 ms. (380 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 12:07:57] [INFO ] Flow matrix only has 1157 transitions (discarded 10 similar events)
[2024-06-01 12:07:57] [INFO ] Invariant cache hit.
[2024-06-01 12:07:57] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 450/537 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/552 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1157/1709 variables, 552/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1709 variables, 54/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1709 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1709 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 552/552 constraints, ReadFeed: 54/54 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 450/537 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/552 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1157/1709 variables, 552/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1709 variables, 54/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1709 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:08:04] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1709 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1709 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1709 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 671 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6663 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 552/552 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 7141ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 87 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1167/1167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 552 transition count 1166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 551 transition count 1166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 551 transition count 1164
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 549 transition count 1164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 544 transition count 1152
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 544 transition count 1152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 539 transition count 1147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 536 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 534 transition count 1139
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 534 transition count 1139
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 534 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 533 transition count 1138
Applied a total of 38 rules in 66 ms. Remains 533 /552 variables (removed 19) and now considering 1138/1167 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 533/552 places, 1138/1167 transitions.
RANDOM walk for 40000 steps (202 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367923 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367923 steps, saw 216570 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-01 12:08:08] [INFO ] Flow matrix only has 1128 transitions (discarded 10 similar events)
// Phase 1: matrix 1128 rows 533 cols
[2024-06-01 12:08:08] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 12:08:08] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 431/518 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/533 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1128/1661 variables, 533/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1661 variables, 54/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1661 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1661 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1661/1661 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 533/533 constraints, ReadFeed: 54/54 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 431/518 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/533 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1128/1661 variables, 533/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1661 variables, 54/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1661 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1661 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1661 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1661/1661 variables, and 651 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7662 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 533/533 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 8155ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 470 ms.
Support contains 87 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1138/1138 transitions.
Applied a total of 0 rules in 20 ms. Remains 533 /533 variables (removed 0) and now considering 1138/1138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 533/533 places, 1138/1138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1138/1138 transitions.
Applied a total of 0 rules in 34 ms. Remains 533 /533 variables (removed 0) and now considering 1138/1138 (removed 0) transitions.
[2024-06-01 12:08:16] [INFO ] Flow matrix only has 1128 transitions (discarded 10 similar events)
[2024-06-01 12:08:16] [INFO ] Invariant cache hit.
[2024-06-01 12:08:17] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-06-01 12:08:17] [INFO ] Flow matrix only has 1128 transitions (discarded 10 similar events)
[2024-06-01 12:08:17] [INFO ] Invariant cache hit.
[2024-06-01 12:08:17] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 12:08:17] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2024-06-01 12:08:18] [INFO ] Redundant transitions in 65 ms returned []
Running 1132 sub problems to find dead transitions.
[2024-06-01 12:08:18] [INFO ] Flow matrix only has 1128 transitions (discarded 10 similar events)
[2024-06-01 12:08:18] [INFO ] Invariant cache hit.
[2024-06-01 12:08:18] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 4 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 4 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 4 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 3 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 3 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 3 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 5 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 2 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 95 places in 173 ms of which 2 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 3 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 2 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 6 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 2 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 4 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:08:45] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1661 variables, and 100 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 0/533 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 1132/1132 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 1 (OVERLAPS) 1/533 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 8 ms to minimize.
[2024-06-01 12:08:58] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:01] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 3 ms to minimize.
[2024-06-01 12:09:02] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:09:06] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1132 unsolved
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1661 variables, and 115 constraints, problems are : Problem set: 0 solved, 1132 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, State Equation: 0/533 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 0/1132 constraints, Known Traps: 53/53 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 1132 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62305 ms. Remains : 533/533 places, 1138/1138 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2161 edges and 533 vertex of which 529 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 529 transition count 1128
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 29 place count 520 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 43 place count 520 transition count 1105
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 520 transition count 1105
Applied a total of 52 rules in 58 ms. Remains 520 /533 variables (removed 13) and now considering 1105/1138 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1105 rows 520 cols
[2024-06-01 12:09:19] [INFO ] Computed 58 invariants in 8 ms
[2024-06-01 12:09:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:09:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2024-06-01 12:09:19] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:09:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 12:09:20] [INFO ] After 342ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:09:20] [INFO ] After 659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:09:21] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2049 ms.
[2024-06-01 12:09:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 12:09:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 533 places, 1138 transitions and 4388 arcs took 9 ms.
[2024-06-01 12:09:21] [INFO ] Flatten gal took : 204 ms
Total runtime 106362 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : NoC3x3-PT-6B-ReachabilityFireability-2024-03

BK_STOP 1717243761760

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name NoC3x3-PT-6B-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/787/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="NoC3x3-PT-6B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-6B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352100647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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