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.r245-tall-171654350300646.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 greatspnxred
Input is NoC3x3-PT-6B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300646
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2023-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716695202231

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:46:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 03:46:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:46:43] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-26 03:46:43] [INFO ] Transformed 1544 places.
[2024-05-26 03:46:43] [INFO ] Transformed 2229 transitions.
[2024-05-26 03:46:43] [INFO ] Found NUPN structural information;
[2024-05-26 03:46:43] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (89 resets) in 1373 ms. (29 steps per ms) remains 3/13 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 374 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 749 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
// Phase 1: matrix 2229 rows 1544 cols
[2024-05-26 03:46:44] [INFO ] Computed 66 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem NoC3x3-PT-6B-ReachabilityCardinality-2023-13 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1284/1379 variables, 52/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 1284/1431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/1431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 165/1544 variables, 14/1445 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 165/1610 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1568 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1214/1282 variables, 44/112 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1282 variables, 1214/1326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-26 03:46:46] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1282 variables, 1/1327 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1282 variables, 0/1327 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 262/1544 variables, 22/1349 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 262/1611 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-26 03:46:47] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 6 ms to minimize.
[2024-05-26 03:46:47] [INFO ] Deduced a trap composed of 213 places in 225 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 2/1613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/1613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2229/3773 variables, 1544/3157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3773 variables, 2/3159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3773 variables, 0/3159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-26 03:46:50] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/3773 variables, 1/3160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3773 variables, 0/3160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3773 variables, 0/3160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3160 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5018 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 6747ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 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 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1544 transition count 2036
Reduce places removed 193 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 202 rules applied. Total rules applied 395 place count 1351 transition count 2027
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 404 place count 1342 transition count 2027
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 404 place count 1342 transition count 1967
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 524 place count 1282 transition count 1967
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 788 place count 1018 transition count 1703
Iterating global reduction 3 with 264 rules applied. Total rules applied 1052 place count 1018 transition count 1703
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1052 place count 1018 transition count 1677
Deduced a syphon composed of 26 places in 10 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1104 place count 992 transition count 1677
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 1198 place count 898 transition count 1394
Iterating global reduction 3 with 94 rules applied. Total rules applied 1292 place count 898 transition count 1394
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1332 place count 858 transition count 1311
Iterating global reduction 3 with 40 rules applied. Total rules applied 1372 place count 858 transition count 1311
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1387 place count 843 transition count 1281
Iterating global reduction 3 with 15 rules applied. Total rules applied 1402 place count 843 transition count 1281
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1411 place count 834 transition count 1262
Iterating global reduction 3 with 9 rules applied. Total rules applied 1420 place count 834 transition count 1262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1423 place count 831 transition count 1256
Iterating global reduction 3 with 3 rules applied. Total rules applied 1426 place count 831 transition count 1256
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1429 place count 828 transition count 1250
Iterating global reduction 3 with 3 rules applied. Total rules applied 1432 place count 828 transition count 1250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1437 place count 828 transition count 1245
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 4 with 304 rules applied. Total rules applied 1741 place count 676 transition count 1093
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1743 place count 674 transition count 1074
Iterating global reduction 4 with 2 rules applied. Total rules applied 1745 place count 674 transition count 1074
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -43
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 1947 place count 573 transition count 1117
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 2001 place count 546 transition count 1130
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 2018 place count 546 transition count 1113
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 2045 place count 546 transition count 1086
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 2080 place count 519 transition count 1078
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2083 place count 519 transition count 1075
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2084 place count 519 transition count 1075
Applied a total of 2084 rules in 682 ms. Remains 519 /1544 variables (removed 1025) and now considering 1075/2229 (removed 1154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 519/1544 places, 1075/2229 transitions.
RANDOM walk for 40000 steps (230 resets) in 823 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 269283 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 269283 steps, saw 147589 distinct states, run finished after 3009 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-26 03:46:55] [INFO ] Flow matrix only has 1070 transitions (discarded 5 similar events)
// Phase 1: matrix 1070 rows 519 cols
[2024-05-26 03:46:55] [INFO ] Computed 66 invariants in 12 ms
[2024-05-26 03:46:55] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/418 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/519 variables, 22/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1070/1589 variables, 519/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1589 variables, 55/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1589 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1589/1589 variables, and 640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 519/519 constraints, ReadFeed: 55/55 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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/418 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:46:56] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 101/519 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1070/1589 variables, 519/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 55/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1589 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1589 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:46:58] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-26 03:46:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1589 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:46:58] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1589 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1589 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1589/1589 variables, and 646 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3522 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 519/519 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4046ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1077 ms.
Support contains 60 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 1075/1075 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 519 transition count 1073
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 517 transition count 1073
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 517 transition count 1072
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 516 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 514 transition count 1065
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 514 transition count 1065
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 513 transition count 1064
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 510 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 509 transition count 1061
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 509 transition count 1061
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 509 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 508 transition count 1052
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 508 transition count 1052
Applied a total of 23 rules in 85 ms. Remains 508 /519 variables (removed 11) and now considering 1052/1075 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 508/519 places, 1052/1075 transitions.
RANDOM walk for 40000 steps (228 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 316305 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 316305 steps, saw 118542 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-05-26 03:47:03] [INFO ] Flow matrix only has 1049 transitions (discarded 3 similar events)
// Phase 1: matrix 1049 rows 508 cols
[2024-05-26 03:47:03] [INFO ] Computed 66 invariants in 17 ms
[2024-05-26 03:47:03] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 341/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/508 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1557 variables, 508/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1557 variables, 55/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1557 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 508/508 constraints, ReadFeed: 55/55 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 341/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/508 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1049/1557 variables, 508/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1557 variables, 55/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1557 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1557/1557 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 508/508 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 198 ms.
Support contains 60 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1052/1052 transitions.
Applied a total of 0 rules in 17 ms. Remains 508 /508 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 508/508 places, 1052/1052 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1052/1052 transitions.
Applied a total of 0 rules in 13 ms. Remains 508 /508 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2024-05-26 03:47:07] [INFO ] Flow matrix only has 1049 transitions (discarded 3 similar events)
[2024-05-26 03:47:07] [INFO ] Invariant cache hit.
[2024-05-26 03:47:07] [INFO ] Implicit Places using invariants in 267 ms returned [19, 57, 115, 157, 231, 338, 394, 435, 486]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 276 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 499/508 places, 1052/1052 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 477 transition count 1030
Applied a total of 44 rules in 22 ms. Remains 477 /499 variables (removed 22) and now considering 1030/1052 (removed 22) transitions.
[2024-05-26 03:47:07] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
// Phase 1: matrix 1027 rows 477 cols
[2024-05-26 03:47:07] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 03:47:08] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 03:47:08] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
[2024-05-26 03:47:08] [INFO ] Invariant cache hit.
[2024-05-26 03:47:08] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 03:47:08] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 477/508 places, 1030/1052 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1171 ms. Remains : 477/508 places, 1030/1052 transitions.
RANDOM walk for 40000 steps (243 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355189 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355189 steps, saw 122945 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-26 03:47:11] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
[2024-05-26 03:47:11] [INFO ] Invariant cache hit.
[2024-05-26 03:47:11] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 320/380 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/477 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1504 variables, 477/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1504 variables, 59/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1504 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1504 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1504/1504 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 477/477 constraints, ReadFeed: 59/59 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 320/380 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/477 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1504 variables, 477/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1504 variables, 59/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1504 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1504 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1504 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1504/1504 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 477/477 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 60 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 1030/1030 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 477/477 places, 1030/1030 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 1030/1030 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
[2024-05-26 03:47:14] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
[2024-05-26 03:47:14] [INFO ] Invariant cache hit.
[2024-05-26 03:47:14] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-26 03:47:14] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
[2024-05-26 03:47:14] [INFO ] Invariant cache hit.
[2024-05-26 03:47:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 03:47:15] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-05-26 03:47:15] [INFO ] Redundant transitions in 56 ms returned []
Running 1026 sub problems to find dead transitions.
[2024-05-26 03:47:15] [INFO ] Flow matrix only has 1027 transitions (discarded 3 similar events)
[2024-05-26 03:47:15] [INFO ] Invariant cache hit.
[2024-05-26 03:47:15] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/477 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-26 03:47:30] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-26 03:47:31] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-26 03:47:32] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 4 ms to minimize.
[2024-05-26 03:47:32] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-26 03:47:32] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2024-05-26 03:47:32] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-26 03:47:32] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-26 03:47:35] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-26 03:47:36] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-26 03:47:36] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-26 03:47:43] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2024-05-26 03:47:44] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/1504 variables, and 79 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/477 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/477 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 22/79 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 4 (OVERLAPS) 1027/1504 variables, 477/556 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1504 variables, 59/615 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1504 variables, 1026/1641 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1504 variables, and 1641 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 477/477 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 22/22 constraints]
After SMT, in 60599ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61557 ms. Remains : 477/477 places, 1030/1030 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 477 transition count 1027
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 20 place count 477 transition count 1010
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 477 transition count 1010
Applied a total of 25 rules in 31 ms. Remains 477 /477 variables (removed 0) and now considering 1010/1030 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1010 rows 477 cols
[2024-05-26 03:48:16] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:48:16] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:48:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2024-05-26 03:48:16] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 03:48:16] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:48:17] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 876 ms.
[2024-05-26 03:48:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-26 03:48:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 477 places, 1030 transitions and 4092 arcs took 11 ms.
[2024-05-26 03:48:17] [INFO ] Flatten gal took : 110 ms
Total runtime 94210 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-6B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 477
TRANSITIONS: 1030
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.007s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 701
MODEL NAME: /home/mcc/execution/411/model
477 places, 1030 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716696263275

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="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 NoC3x3-PT-6B, 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 r245-tall-171654350300646"
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 [ "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 ;