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-174876825200162.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-7B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825200162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K 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 89K 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 2.0M 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748841680208

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:21:21] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2025-06-02 05:21:21] [INFO ] Transformed 7014 places.
[2025-06-02 05:21:21] [INFO ] Transformed 8833 transitions.
[2025-06-02 05:21:21] [INFO ] Found NUPN structural information;
[2025-06-02 05:21:21] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 456 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7824 edges and 7014 vertex of which 4885 / 7014 are part of one of the 33 SCC in 24 ms
Free SCC test removed 4852 places
Ensure Unique test removed 5920 transitions
Reduce isomorphic transitions removed 5920 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 354 place count 2162 transition count 2560
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 1809 transition count 2560
Performed 934 Post agglomeration using F-continuation condition.Transition count delta: 934
Deduced a syphon composed of 934 places in 6 ms
Reduce places removed 934 places and 0 transitions.
Iterating global reduction 2 with 1868 rules applied. Total rules applied 2575 place count 875 transition count 1626
Applied a total of 2575 rules in 430 ms. Remains 875 /7014 variables (removed 6139) and now considering 1626/8833 (removed 7207) transitions.
[2025-06-02 05:21:22] [INFO ] Flow matrix only has 1424 transitions (discarded 202 similar events)
// Phase 1: matrix 1424 rows 875 cols
[2025-06-02 05:21:22] [INFO ] Computed 66 invariants in 19 ms
[2025-06-02 05:21:23] [INFO ] Implicit Places using invariants in 869 ms returned [13, 89, 195, 271, 399, 556, 650, 728, 831]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 901 ms to find 9 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 866/7014 places, 1626/8833 transitions.
Graph (trivial) has 705 edges and 866 vertex of which 48 / 866 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Applied a total of 1 rules in 15 ms. Remains 842 /866 variables (removed 24) and now considering 1578/1626 (removed 48) transitions.
[2025-06-02 05:21:23] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
// Phase 1: matrix 1376 rows 842 cols
[2025-06-02 05:21:23] [INFO ] Computed 57 invariants in 8 ms
[2025-06-02 05:21:23] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-06-02 05:21:23] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
[2025-06-02 05:21:23] [INFO ] Invariant cache hit.
[2025-06-02 05:21:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-02 05:21:25] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 842/7014 places, 1578/8833 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3372 ms. Remains : 842/7014 places, 1578/8833 transitions.
Discarding 624 transitions out of 1578. Remains 954
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (521 resets) in 4255 ms. (9 steps per ms) remains 78/953 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 8 ms. (444 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 9 ms. (400 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (4 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
[2025-06-02 05:21:26] [INFO ] Flow matrix only has 1376 transitions (discarded 202 similar events)
[2025-06-02 05:21:26] [INFO ] Invariant cache hit.
[2025-06-02 05:21:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 359/453 variables, 31/125 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 359/484 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 389/842 variables, 26/510 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 389/899 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1375/2217 variables, 842/1741 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/2217 variables, 70/1811 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2217/2218 variables, and 1811 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5017 ms.
Refiners :[Domain max(s): 842/842 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 842/842 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 359/453 variables, 31/125 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 359/484 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 389/842 variables, 26/510 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 389/899 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1375/2217 variables, 842/1741 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2217 variables, 70/1811 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2217 variables, 78/1889 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
timeout
(s328 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2217/2218 variables, and 1889 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5012 ms.
Refiners :[Domain max(s): 842/842 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 842/842 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 10118ms problems are : Problem set: 0 solved, 78 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 842/842 places, 1578/1578 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 842 transition count 1545
Discarding 420 places :
Symmetric choice reduction at 1 with 420 rule applications. Total rules 453 place count 422 transition count 1073
Iterating global reduction 1 with 420 rules applied. Total rules applied 873 place count 422 transition count 1073
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 1270 place count 422 transition count 676
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 1274 place count 420 transition count 702
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1276 place count 420 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1278 place count 420 transition count 698
Free-agglomeration rule applied 168 times.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1446 place count 420 transition count 530
Reduce places removed 168 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Graph (complete) has 732 edges and 252 vertex of which 212 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Iterating post reduction 3 with 208 rules applied. Total rules applied 1654 place count 212 transition count 471
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 1685 place count 212 transition count 440
Applied a total of 1685 rules in 194 ms. Remains 212 /842 variables (removed 630) and now considering 440/1578 (removed 1138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 212/842 places, 440/1578 transitions.
RANDOM walk for 4000000 steps (9 resets) in 33146 ms. (120 steps per ms) remains 27/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 984 ms. (406 steps per ms) remains 17/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1048 ms. (381 steps per ms) remains 11/17 properties
BEST_FIRST walk for 400002 steps (8 resets) in 914 ms. (437 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400001 steps (8 resets) in 786 ms. (508 steps per ms) remains 8/10 properties
BEST_FIRST walk for 400003 steps (8 resets) in 629 ms. (634 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400004 steps (8 resets) in 601 ms. (664 steps per ms) remains 6/7 properties
BEST_FIRST walk for 400002 steps (8 resets) in 784 ms. (509 steps per ms) remains 5/6 properties
BEST_FIRST walk for 400002 steps (8 resets) in 549 ms. (727 steps per ms) remains 5/5 properties
[2025-06-02 05:21:49] [INFO ] Flow matrix only has 332 transitions (discarded 108 similar events)
// Phase 1: matrix 332 rows 212 cols
[2025-06-02 05:21:49] [INFO ] Computed 46 invariants in 1 ms
[2025-06-02 05:21:49] [INFO ] State equation strengthened by 182 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 167/212 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 332/544 variables, 212/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 182/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 440 constraints, problems are : Problem set: 0 solved, 5 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 212/212 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 167/212 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 332/544 variables, 212/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 182/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 445 constraints, problems are : Problem set: 0 solved, 5 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 212/212 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 66 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 72 ms.
Able to resolve query QuasiLiveness after proving 954 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 29142 ms.
ITS solved all properties within timeout

BK_STOP 1748841710648

--------------------
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 QuasiLiveness -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-7B"
export BK_EXAMINATION="QuasiLiveness"
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-7B, examination is QuasiLiveness"
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-174876825200162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;