Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r154-tall-174876825100113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is NoC3x3-PT-2B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825100113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 548K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748841549084

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:19:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 05:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:10] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-02 05:19:10] [INFO ] Transformed 2003 places.
[2025-06-02 05:19:10] [INFO ] Transformed 2292 transitions.
[2025-06-02 05:19:10] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:10] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 275 ms.
Graph (trivial) has 1634 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 9 ms
Free SCC test removed 63 places
Structural test allowed to assert that 332 places are NOT stable. Took 39 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (104 resets) in 4414 ms. (9 steps per ms) remains 218/1671 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 218/218 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 23 ms. (16 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 41 ms. (9 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 24 ms. (16 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 218/218 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 218/218 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 218/218 properties
[2025-06-02 05:19:12] [INFO ] Flow matrix only has 2221 transitions (discarded 8 similar events)
// Phase 1: matrix 2221 rows 1940 cols
[2025-06-02 05:19:12] [INFO ] Computed 66 invariants in 35 ms
[2025-06-02 05:19:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 908/1126 variables, 29/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 908/1155 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1126/4161 variables, and 1155 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5068 ms.
Refiners :[Domain max(s): 1126/1940 constraints, Positive P Invariants (semi-flows): 29/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 908/1126 variables, 29/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 908/1155 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 50 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 6 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 5 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 4 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 113 places in 96 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 132 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/4161 variables, and 1172 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5029 ms.
Refiners :[Domain max(s): 1126/1940 constraints, Positive P Invariants (semi-flows): 29/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/218 constraints, Known Traps: 17/17 constraints]
After SMT, in 10348ms problems are : Problem set: 0 solved, 218 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 218 out of 1940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1940/1940 places, 2229/2229 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 354 rules applied. Total rules applied 354 place count 1933 transition count 1882
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 692 place count 1595 transition count 1882
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 692 place count 1595 transition count 1858
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 740 place count 1571 transition count 1858
Discarding 272 places :
Symmetric choice reduction at 2 with 272 rule applications. Total rules 1012 place count 1299 transition count 1586
Iterating global reduction 2 with 272 rules applied. Total rules applied 1284 place count 1299 transition count 1586
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 1284 place count 1299 transition count 1571
Deduced a syphon composed of 15 places in 10 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 1314 place count 1284 transition count 1571
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 1409 place count 1189 transition count 1476
Iterating global reduction 2 with 95 rules applied. Total rules applied 1504 place count 1189 transition count 1476
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1597 place count 1096 transition count 1374
Iterating global reduction 2 with 93 rules applied. Total rules applied 1690 place count 1096 transition count 1374
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1712 place count 1074 transition count 1331
Iterating global reduction 2 with 22 rules applied. Total rules applied 1734 place count 1074 transition count 1331
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 11 rules applied. Total rules applied 1745 place count 1073 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1746 place count 1072 transition count 1321
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1759 place count 1059 transition count 1308
Iterating global reduction 4 with 13 rules applied. Total rules applied 1772 place count 1059 transition count 1308
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1777 place count 1054 transition count 1298
Iterating global reduction 4 with 5 rules applied. Total rules applied 1782 place count 1054 transition count 1298
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1787 place count 1049 transition count 1293
Iterating global reduction 4 with 5 rules applied. Total rules applied 1792 place count 1049 transition count 1293
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 7 rules applied. Total rules applied 1799 place count 1048 transition count 1287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1800 place count 1047 transition count 1287
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 6 with 596 rules applied. Total rules applied 2396 place count 749 transition count 989
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2406 place count 739 transition count 979
Iterating global reduction 6 with 10 rules applied. Total rules applied 2416 place count 739 transition count 979
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2420 place count 735 transition count 971
Iterating global reduction 6 with 4 rules applied. Total rules applied 2424 place count 735 transition count 971
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2425 place count 734 transition count 966
Iterating global reduction 6 with 1 rules applied. Total rules applied 2426 place count 734 transition count 966
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -151
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2482 place count 706 transition count 1117
Free-agglomeration rule applied 39 times.
Iterating global reduction 6 with 39 rules applied. Total rules applied 2521 place count 706 transition count 1078
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 49 rules applied. Total rules applied 2570 place count 667 transition count 1068
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2571 place count 667 transition count 1067
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2574 place count 667 transition count 1064
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2577 place count 664 transition count 1064
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 2593 place count 664 transition count 1064
Partial Post-agglomeration rule applied 15 times.
Drop transitions (Partial Post agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 2608 place count 664 transition count 1064
Applied a total of 2608 rules in 833 ms. Remains 664 /1940 variables (removed 1276) and now considering 1064/2229 (removed 1165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 664/1940 places, 1064/2229 transitions.
RANDOM walk for 4000000 steps (54769 resets) in 28619 ms. (139 steps per ms) remains 3/218 properties
BEST_FIRST walk for 4000004 steps (3101 resets) in 5236 ms. (763 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3104 resets) in 5172 ms. (773 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3082 resets) in 5204 ms. (768 steps per ms) remains 3/3 properties
[2025-06-02 05:19:35] [INFO ] Flow matrix only has 1062 transitions (discarded 2 similar events)
// Phase 1: matrix 1062 rows 664 cols
[2025-06-02 05:19:35] [INFO ] Computed 59 invariants in 12 ms
[2025-06-02 05:19:35] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 599/632 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1052/1684 variables, 632/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1684 variables, 74/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1684 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/1726 variables, 32/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1726 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1726 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1726 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1726/1726 variables, and 805 constraints, problems are : Problem set: 0 solved, 3 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 664/664 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 599/632 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 2 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1052/1684 variables, 632/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1684 variables, 74/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1684 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1684 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem smplace_144 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 3298ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1064/1064 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 662 transition count 997
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 595 transition count 997
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 136 place count 595 transition count 982
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 166 place count 580 transition count 982
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 202 place count 544 transition count 942
Iterating global reduction 2 with 36 rules applied. Total rules applied 238 place count 544 transition count 942
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 238 place count 544 transition count 940
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 542 transition count 940
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 258 place count 526 transition count 917
Iterating global reduction 2 with 16 rules applied. Total rules applied 274 place count 526 transition count 917
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 282 place count 518 transition count 901
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 518 transition count 901
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 294 place count 518 transition count 897
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 299 place count 513 transition count 890
Iterating global reduction 3 with 5 rules applied. Total rules applied 304 place count 513 transition count 890
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 311 place count 513 transition count 883
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 433 place count 452 transition count 822
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 478 place count 407 transition count 635
Iterating global reduction 4 with 45 rules applied. Total rules applied 523 place count 407 transition count 635
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 525 place count 407 transition count 633
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 534 place count 398 transition count 615
Iterating global reduction 5 with 9 rules applied. Total rules applied 543 place count 398 transition count 615
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 549 place count 398 transition count 609
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 553 place count 394 transition count 601
Iterating global reduction 6 with 4 rules applied. Total rules applied 557 place count 394 transition count 601
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 562 place count 394 transition count 596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 566 place count 392 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 567 place count 391 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 568 place count 391 transition count 592
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 571 place count 391 transition count 589
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 574 place count 388 transition count 589
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 578 place count 388 transition count 589
Applied a total of 578 rules in 273 ms. Remains 388 /664 variables (removed 276) and now considering 589/1064 (removed 475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 388/664 places, 589/1064 transitions.
Total runtime 28575 ms.
ITS solved all properties within timeout

BK_STOP 1748841579380

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-2B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is NoC3x3-PT-2B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825100113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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