fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r311-tall-171662336100190
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for RERS17pb114-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16199.292 3600000.00 3784452.00 11512.30 T?TTFFFT?F?TTTT? 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.r311-tall-171662336100190.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 RERS17pb114-PT-1, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336100190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 73M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2023-06
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2023-07
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2023-08
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-12
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2023-13
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-14
FORMULA_NAME RERS17pb114-PT-1-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716703791368

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 06:09:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 06:09:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 06:09:54] [INFO ] Load time of PNML (sax parser for PT used): 2090 ms
[2024-05-26 06:09:54] [INFO ] Transformed 1446 places.
[2024-05-26 06:09:55] [INFO ] Transformed 151085 transitions.
[2024-05-26 06:09:55] [INFO ] Found NUPN structural information;
[2024-05-26 06:09:55] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2645 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6724 ms. (5 steps per ms) remains 6/13 properties
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1020 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 969 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 703 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 535 ms. (74 steps per ms) remains 6/6 properties
[2024-05-26 06:09:59] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2024-05-26 06:10:00] [INFO ] Computed 35 invariants in 510 ms
[2024-05-26 06:10:05] [INFO ] State equation strengthened by 2342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 126/306 variables, 18/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 126/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1140/1446 variables, 17/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1446 variables, 1140/1481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1446 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 11650ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Applied a total of 529 rules in 1816 ms. Remains 1429 /1446 variables (removed 17) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 1429/1446 places, 150573/151085 transitions.
RANDOM walk for 40000 steps (8 resets) in 5069 ms. (7 steps per ms) remains 5/6 properties
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2023-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 781 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 550 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 600 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 5/5 properties
[2024-05-26 06:10:15] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2024-05-26 06:10:16] [INFO ] Computed 18 invariants in 279 ms
[2024-05-26 06:10:21] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1249/1409 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1249/1425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/1429 variables, 2/1427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 20/1447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1429 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86119/86119 variables, and 2876 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45089 ms.
Refiners :[Domain max(s): 1429/1429 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 1429/1429 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1249/1409 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1249/1425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 06:11:17] [INFO ] Deduced a trap composed of 97 places in 10473 ms of which 68 ms to minimize.
[2024-05-26 06:11:28] [INFO ] Deduced a trap composed of 65 places in 11277 ms of which 14 ms to minimize.
[2024-05-26 06:11:39] [INFO ] Deduced a trap composed of 65 places in 10054 ms of which 8 ms to minimize.
[2024-05-26 06:11:48] [INFO ] Deduced a trap composed of 65 places in 9488 ms of which 7 ms to minimize.
[2024-05-26 06:11:58] [INFO ] Deduced a trap composed of 65 places in 9804 ms of which 7 ms to minimize.
SMT process timed out in 102491ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1134 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1134 ms. Remains : 1429/1429 places, 150573/150573 transitions.
RANDOM walk for 40000 steps (8 resets) in 4381 ms. (9 steps per ms) remains 4/5 properties
FORMULA RERS17pb114-PT-1-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 473 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 4/4 properties
[2024-05-26 06:12:02] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 06:12:02] [INFO ] Invariant cache hit.
[2024-05-26 06:12:07] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1277/1409 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1277/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/1429 variables, 2/1427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 20/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1429 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86119/86119 variables, and 2876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75119 ms.
Refiners :[Domain max(s): 1429/1429 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 1429/1429 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1277/1409 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1277/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 06:13:34] [INFO ] Deduced a trap composed of 65 places in 11473 ms of which 9 ms to minimize.
[2024-05-26 06:13:44] [INFO ] Deduced a trap composed of 129 places in 10653 ms of which 8 ms to minimize.
[2024-05-26 06:13:55] [INFO ] Deduced a trap composed of 97 places in 10781 ms of which 8 ms to minimize.
[2024-05-26 06:14:06] [INFO ] Deduced a trap composed of 65 places in 10778 ms of which 7 ms to minimize.
[2024-05-26 06:14:17] [INFO ] Deduced a trap composed of 97 places in 10612 ms of which 7 ms to minimize.
[2024-05-26 06:14:25] [INFO ] Deduced a trap composed of 97 places in 8368 ms of which 6 ms to minimize.
[2024-05-26 06:14:35] [INFO ] Deduced a trap composed of 65 places in 9704 ms of which 7 ms to minimize.
[2024-05-26 06:14:44] [INFO ] Deduced a trap composed of 65 places in 8873 ms of which 6 ms to minimize.
SMT process timed out in 162316ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1189 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1189 ms. Remains : 1429/1429 places, 150573/150573 transitions.
RANDOM walk for 40000 steps (8 resets) in 4108 ms. (9 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 868 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 3636 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :0 out of 4
Probabilistic random walk after 3636 steps, saw 3093 distinct states, run finished after 3010 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 06:14:50] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 06:14:50] [INFO ] Invariant cache hit.
[2024-05-26 06:14:55] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1277/1409 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1277/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/1429 variables, 2/1427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 20/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1429 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86119/86119 variables, and 2876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90123 ms.
Refiners :[Domain max(s): 1429/1429 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 1429/1429 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1277/1409 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1409 variables, 1277/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 06:16:37] [INFO ] Deduced a trap composed of 65 places in 11708 ms of which 8 ms to minimize.
[2024-05-26 06:16:48] [INFO ] Deduced a trap composed of 129 places in 10747 ms of which 8 ms to minimize.
[2024-05-26 06:16:59] [INFO ] Deduced a trap composed of 97 places in 10692 ms of which 7 ms to minimize.
[2024-05-26 06:17:09] [INFO ] Deduced a trap composed of 65 places in 10616 ms of which 8 ms to minimize.
[2024-05-26 06:17:20] [INFO ] Deduced a trap composed of 97 places in 10472 ms of which 8 ms to minimize.
[2024-05-26 06:17:28] [INFO ] Deduced a trap composed of 97 places in 8499 ms of which 6 ms to minimize.
[2024-05-26 06:17:38] [INFO ] Deduced a trap composed of 65 places in 9827 ms of which 8 ms to minimize.
[2024-05-26 06:17:47] [INFO ] Deduced a trap composed of 65 places in 8902 ms of which 6 ms to minimize.
[2024-05-26 06:17:57] [INFO ] Deduced a trap composed of 65 places in 9994 ms of which 7 ms to minimize.
SMT process timed out in 186912ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1074 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1062 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2024-05-26 06:17:59] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 06:17:59] [INFO ] Invariant cache hit.
[2024-05-26 06:18:08] [INFO ] Implicit Places using invariants in 8154 ms returned []
Implicit Place search using SMT only with invariants took 8164 ms to find 0 implicit places.
Running 150572 sub problems to find dead transitions.
[2024-05-26 06:18:09] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 06:18:09] [INFO ] Invariant cache hit.
[2024-05-26 06:18:14] [INFO ] State equation strengthened by 2341 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb114-PT-1

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="RERS17pb114-PT-1"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is RERS17pb114-PT-1, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662336100190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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