fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r122-smll-171624283200148
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DLCround-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
482.147 19764.00 46746.00 248.20 F normal

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.r122-smll-171624283200148.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 DLCround-PT-10b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122-smll-171624283200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 19 18:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 12:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 12:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 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 1716327939000

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DLCround-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:45:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 21:45:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:45:42] [INFO ] Load time of PNML (sax parser for PT used): 742 ms
[2024-05-21 21:45:42] [INFO ] Transformed 3924 places.
[2024-05-21 21:45:42] [INFO ] Transformed 6192 transitions.
[2024-05-21 21:45:42] [INFO ] Found NUPN structural information;
[2024-05-21 21:45:42] [INFO ] Parsed PT model containing 3924 places and 6192 transitions and 17304 arcs in 1231 ms.
Graph (trivial) has 3626 edges and 3924 vertex of which 680 / 3924 are part of one of the 48 SCC in 36 ms
Free SCC test removed 632 places
Structural test allowed to assert that 2445 places are NOT stable. Took 152 ms.
Ensure Unique test removed 658 transitions
Reduce redundant transitions removed 658 transitions.
RANDOM walk for 40000 steps (8 resets) in 6837 ms. (5 steps per ms) remains 257/1479 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 34 ms. (11 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 37 ms. (10 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 28 ms. (13 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 36 ms. (10 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 257/257 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
[2024-05-21 21:45:45] [INFO ] Flow matrix only has 5487 transitions (discarded 47 similar events)
// Phase 1: matrix 5487 rows 3292 cols
[2024-05-21 21:45:46] [INFO ] Computed 213 invariants in 54 ms
[2024-05-21 21:45:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: ((s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s811 (/ 1.0 2.0))
(s1313 (/ 1.0 2.0))
(s1314 (/ 1.0 2.0))
(s1316 (/ 1.0 2.0))
(s1317 (/ 1.0 2.0))
(s1323 (/ 1.0 2.0))
(s1324 (/ 1.0 2.0))
(s1326 (/ 1.0 2.0))
(s1327 (/ 1.0 2.0))
(s1333 (/ 1.0 2.0))
(s1334 (/ 1.0 2.0))
(s1336 (/ 1.0 2.0))
(s1337 (/ 1.0 2.0))
(s1343 (/ 1.0 2.0))
(s1344 (/ 1.0 2.0))
(s1346 (/ 1.0 2.0))
(s1347 (/ 1.0 2.0))
(s1353 (/ 1.0 2.0))
(s1354 (/ 1.0 2.0))
(s1356 (/ 1.0 2.0))
(s1357 (/ 1.0 2.0))
(s1363 (/ 1.0 2.0))
(s1364 (/ 1.0 2.0))
(s1366 (/ 1.0 2.0))
(s1367 (/ 1.0 2.0))
(s1373 (/ 1.0 2.0))
(s1374 (/ 1.0 2.0))
(s1376 (/ 1.0 2.0))
(s1377 (/ 1.0 2.0))
(s1383 (/ 1.0 2.0))
(s1384 (/ 1.0 2.0))
(s1386 (/ 1.0 2.0))
(s1387 (/ 1.0 2.0))
(s1393 (/ 1.0 2.0))
(s1394 (/ 1.0 2.0))
(s1396 (/ 1.0 2.0))
(s1397 (/ 1.0 2.0))
(s1403 (/ 1.0 2.0))
(s1404 (/ 1.0 2.0))
(s1406 (/ 1.0 2.0))
(s1407 (/ 1.0 2.0))
(s1413 (/ 1.0 2.0))
(s1414 (/ 1.0 2.0))
(s1416 (/ 1.0 2.0))
(s1417 (/ 1.0 2.0))
(s1423 (/ 1.0 2.0))
(s1424 (/ 1.0 2.0))
(s1426 (/ 1.0 2.0))
(s1427 (/ 1.0 2.0))
(s1433 (/ 1.0 2.0))
(s1434 (/ 1.0 2.0))
(s1436 (/ 1.0 2.0))
(s1437 (/ 1.0 2.0))
(s1443 (/ 1.0 2.0))
(s1444 (/ 1.0 2.0))
(s1446 (/ 1.0 2.0))
(s1447 (/ 1.0 2.0))
(s1453 (/ 1.0 2.0))
(s1454 (/ 1.0 2.0))
(s1456 (/ 1.0 2.0))
(s1457 (/ 1.0 2.0))
(s1463 (/ 1.0 2.0))
(s1464 (/ 1.0 2.0))
(s1466 (/ 1.0 2.0))
(s1467 (/ 1.0 2.0))
(s1473 (/ 1.0 2.0))
(s1474 (/ 1.0 2.0))
(s1476 (/ 1.0 2.0))
(s1477 (/ 1.0 2.0))
(s1483 (/ 1.0 2.0))
(s1484 (/ 1.0 2.0))
(s1486 (/ 1.0 2.0))
(s1487 (/ 1.0 2.0))
(s1493 (/ 1.0 2.0))
(s1494 (/ 1.0 2.0))
(s1496 (/ 1.0 2.0))
(s1497 (/ 1.0 2.0))
(s1503 (/ 1.0 2.0))
(s1504 (/ 1.0 2.0))
(s1506 (/ 1.0 2.0))
(s1507 (/ 1.0 2.0))
(s1513 (/ 1.0 2.0))
(s1514 (/ 1.0 2.0))
(s1516 (/ 1.0 2.0))
(s1517 (/ 1.0 2.0))
(s1523 (/ 1.0 2.0))
(s1524 (/ 1.0 2.0))
(s1526 (/ 1.0 2.0))
(s1527 (/ 1.0 2.0))
(s1533 (/ 1.0 2.0))
(s1534 (/ 1.0 2.0))
(s1536 (/ 1.0 2.0))
(s1537 (/ 1.0 2.0))
(s1543 (/ 1.0 2.0))
(s1544 (/ 1.0 2.0))
(s1546 (/ 1.0 2.0))
(s1547 (/ 1.0 2.0))
(s1553 (/ 1.0 2.0))
(s1554 (/ 1.0 2.0))
(s1556 (/ 1.0 2.0))
(s1557 (/ 1.0 2.0))
(s1563 (/ 1.0 2.0))
(s1564 (/ 1.0 2.0))
(s1566 (/ 1.0 2.0))
(s1567 (/ 1.0 2.0))
(s1573 (/ 1.0 2.0))
(s1574 (/ 1.0 2.0))
(s1576 (/ 1.0 2.0))
(s1577 (/ 1.0 2.0))
(s1583 (/ 1.0 2.0))
(s1584 (/ 1.0 2.0))
(s1586 (/ 1.0 2.0))
(s1587 (/ 1.0 2.0))
(s1593 (/ 1.0 2.0))
(s1594 (/ 1.0 2.0))
(s1596 (/ 1.0 2.0))
(s1597 (/ 1.0 2.0))
(s1603 (/ 1.0 2.0))
(s1604 (/ 1.0 2.0))
(s1606 (/ 1.0 2.0))
(s1607 (/ 1.0 2.0))
(s1613 (/ 1.0 2.0))
(s1614 (/ 1.0 2.0))
(s1616 (/ 1.0 2.0))
(s1617 (/ 1.0 2.0))
(s1623 (/ 1.0 2.0))
(s1624 (/ 1.0 2.0))
(s1626 (/ 1.0 2.0))
(s1627 (/ 1.0 2.0))
(s1633 (/ 1.0 2.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/8779 variables, and 257 constraints, problems are : Problem set: 0 solved, 257 unsolved in 5250 ms.
Refiners :[Domain max(s): 257/3292 constraints, Positive P Invariants (semi-flows): 0/213 constraints, State Equation: 0/3292 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1121/1378 variables, 68/325 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1378 variables, 1121/1446 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/8779 variables, and 1446 constraints, problems are : Problem set: 0 solved, 257 unsolved in 5016 ms.
Refiners :[Domain max(s): 1378/3292 constraints, Positive P Invariants (semi-flows): 68/213 constraints, State Equation: 0/3292 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 10823ms problems are : Problem set: 0 solved, 257 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 257 out of 3292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3292/3292 places, 5534/5534 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1321 rules applied. Total rules applied 1321 place count 3292 transition count 4213
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1344 rules applied. Total rules applied 2665 place count 2019 transition count 4142
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 2697 place count 1989 transition count 4140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2698 place count 1988 transition count 4140
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 2698 place count 1988 transition count 4133
Deduced a syphon composed of 7 places in 100 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 2712 place count 1981 transition count 4133
Discarding 412 places :
Symmetric choice reduction at 4 with 412 rule applications. Total rules 3124 place count 1569 transition count 3721
Iterating global reduction 4 with 412 rules applied. Total rules applied 3536 place count 1569 transition count 3721
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 3536 place count 1569 transition count 3553
Deduced a syphon composed of 168 places in 29 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 3872 place count 1401 transition count 3553
Discarding 82 places :
Symmetric choice reduction at 4 with 82 rule applications. Total rules 3954 place count 1319 transition count 2429
Iterating global reduction 4 with 82 rules applied. Total rules applied 4036 place count 1319 transition count 2429
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 4066 place count 1319 transition count 2399
Performed 328 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 328 places in 1 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 5 with 656 rules applied. Total rules applied 4722 place count 991 transition count 2060
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4733 place count 991 transition count 2049
Renaming transitions due to excessive name length > 1024 char.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -444
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 4815 place count 950 transition count 2493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4816 place count 950 transition count 2492
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 4836 place count 930 transition count 1938
Iterating global reduction 7 with 20 rules applied. Total rules applied 4856 place count 930 transition count 1938
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4876 place count 930 transition count 1918
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4878 place count 929 transition count 1927
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 8 with 167 rules applied. Total rules applied 5045 place count 929 transition count 1760
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 5056 place count 918 transition count 1606
Iterating global reduction 8 with 11 rules applied. Total rules applied 5067 place count 918 transition count 1606
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 5078 place count 918 transition count 1595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5080 place count 917 transition count 1604
Free-agglomeration rule applied 427 times with reduction of 173 identical transitions.
Iterating global reduction 9 with 427 rules applied. Total rules applied 5507 place count 917 transition count 1004
Reduce places removed 427 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 306 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 309 transitions.
Graph (complete) has 1052 edges and 490 vertex of which 408 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 737 rules applied. Total rules applied 6244 place count 408 transition count 695
Discarding 44 places :
Symmetric choice reduction at 10 with 44 rule applications. Total rules 6288 place count 364 transition count 608
Iterating global reduction 10 with 44 rules applied. Total rules applied 6332 place count 364 transition count 608
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 10 with 36 rules applied. Total rules applied 6368 place count 364 transition count 572
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 6369 place count 364 transition count 572
Applied a total of 6369 rules in 1442 ms. Remains 364 /3292 variables (removed 2928) and now considering 572/5534 (removed 4962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1457 ms. Remains : 364/3292 places, 572/5534 transitions.
RANDOM walk for 34641 steps (0 resets) in 1218 ms. (28 steps per ms) remains 0/257 properties
Able to resolve query StableMarking after proving 1481 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 17060 ms.
ITS solved all properties within timeout

BK_STOP 1716327958764

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DLCround-PT-10b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DLCround-PT-10b, 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 r122-smll-171624283200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10b.tgz
mv DLCround-PT-10b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;