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-171662336400326.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 RERS17pb115-PT-9, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336400326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 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 69M 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 RERS17pb115-PT-9-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-06
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2023-12
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2023-13
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2023-14
FORMULA_NAME RERS17pb115-PT-9-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716722925502

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb115-PT-9
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 11:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 11:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 11:28:49] [INFO ] Load time of PNML (sax parser for PT used): 2311 ms
[2024-05-26 11:28:49] [INFO ] Transformed 1399 places.
[2024-05-26 11:28:49] [INFO ] Transformed 144369 transitions.
[2024-05-26 11:28:49] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2885 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 6276 ms. (6 steps per ms) remains 10/16 properties
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 740 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 658 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 489 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
[2024-05-26 11:28:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2024-05-26 11:28:54] [INFO ] Computed 37 invariants in 495 ms
[2024-05-26 11:29:00] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem RERS17pb115-PT-9-ReachabilityCardinality-2024-02 is UNSAT
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1218/1364 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1364 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 20/1384 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1384 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 15/1399 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 11831ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 145 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1383 transition count 144369
Applied a total of 16 rules in 1844 ms. Remains 1383 /1399 variables (removed 16) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1865 ms. Remains : 1383/1399 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 5288 ms. (7 steps per ms) remains 8/9 properties
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
[2024-05-26 11:29:10] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2024-05-26 11:29:10] [INFO ] Computed 21 invariants in 336 ms
[2024-05-26 11:29:16] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 114/258 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1125/1383 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82621/82621 variables, and 1404 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45073 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1383/1383 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 114/258 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1125/1383 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 11:30:07] [INFO ] Deduced a trap composed of 35 places in 3343 ms of which 10 ms to minimize.
[2024-05-26 11:30:29] [INFO ] Deduced a trap composed of 41 places in 3633 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 11:30:37] [INFO ] Deduced a trap composed of 129 places in 4868 ms of which 2 ms to minimize.
[2024-05-26 11:30:41] [INFO ] Deduced a trap composed of 73 places in 4050 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1383/82621 variables, and 25 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1383 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 97262ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1035 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1035 ms. Remains : 1383/1383 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 3705 ms. (10 steps per ms) remains 7/8 properties
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
[2024-05-26 11:30:50] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 11:30:50] [INFO ] Invariant cache hit.
[2024-05-26 11:30:56] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1383 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82621/82621 variables, and 1404 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1383/1383 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1383 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-26 11:32:17] [INFO ] Deduced a trap composed of 35 places in 3319 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-26 11:32:44] [INFO ] Deduced a trap composed of 129 places in 4498 ms of which 2 ms to minimize.
[2024-05-26 11:32:55] [INFO ] Deduced a trap composed of 73 places in 4965 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1383 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-26 11:33:13] [INFO ] Deduced a trap composed of 97 places in 4387 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1383/82621 variables, and 25 constraints, problems are : Problem set: 0 solved, 7 unsolved in 77284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1383 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 158443ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1382 transition count 144369
Applied a total of 1 rules in 1411 ms. Remains 1382 /1383 variables (removed 1) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1411 ms. Remains : 1382/1383 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 2999 ms. (13 steps per ms) remains 6/7 properties
FORMULA RERS17pb115-PT-9-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
[2024-05-26 11:33:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1382 cols
[2024-05-26 11:33:33] [INFO ] Computed 20 invariants in 368 ms
[2024-05-26 11:33:38] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 63/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1246/1382 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1382 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82620/82620 variables, and 1402 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1382/1382 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 63/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1246/1382 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 11:35:13] [INFO ] Deduced a trap composed of 65 places in 4247 ms of which 3 ms to minimize.
[2024-05-26 11:35:17] [INFO ] Deduced a trap composed of 73 places in 3811 ms of which 5 ms to minimize.
[2024-05-26 11:35:37] [INFO ] Deduced a trap composed of 73 places in 5438 ms of which 3 ms to minimize.
[2024-05-26 11:35:41] [INFO ] Deduced a trap composed of 73 places in 4715 ms of which 1 ms to minimize.
[2024-05-26 11:35:45] [INFO ] Deduced a trap composed of 41 places in 3855 ms of which 1 ms to minimize.
[2024-05-26 11:35:49] [INFO ] Deduced a trap composed of 65 places in 3723 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1382 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1382 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82620/82620 variables, and 1408 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1382/1382 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 185834ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 144369/144369 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1381 transition count 144369
Applied a total of 1 rules in 1366 ms. Remains 1381 /1382 variables (removed 1) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1366 ms. Remains : 1381/1382 places, 144369/144369 transitions.
[2024-05-26 11:36:40] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-26 11:36:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1381 places, 144369 transitions and 577396 arcs took 315 ms.
[2024-05-26 11:36:45] [INFO ] Flatten gal took : 4249 ms
Total runtime 478653 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb115-PT-9

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1381
TRANSITIONS: 144369
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 2.877s, Sys 0.207s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.448s, Sys 0.024s]


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

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

Process ID: 631
MODEL NAME: /home/mcc/execution/412/model
1381 places, 144369 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716723658310

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb115-PT-9"
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 RERS17pb115-PT-9, 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-171662336400326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb115-PT-9.tgz
mv RERS17pb115-PT-9 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 ;