fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of GreatSPN+red for RERS17pb115-PT-4

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.331 982308.00 1887007.00 2248.20 ?T?TT??????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.r311-tall-171662336300287.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-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336300287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K 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 71K 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 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-4-ReachabilityFireability-2024-00
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-01
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-02
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-03
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-04
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-05
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-06
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-07
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-08
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-09
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-10
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2023-11
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2023-12
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2023-13
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2023-14
FORMULA_NAME RERS17pb115-PT-4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716718383458

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb115-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 10:13:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 10:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:13:07] [INFO ] Load time of PNML (sax parser for PT used): 2699 ms
[2024-05-26 10:13:07] [INFO ] Transformed 1399 places.
[2024-05-26 10:13:08] [INFO ] Transformed 144369 transitions.
[2024-05-26 10:13:08] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 3473 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 9480 ms. (4 steps per ms) remains 15/16 properties
FORMULA RERS17pb115-PT-4-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 228 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 207 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 211 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 9271 steps, run timeout after 9006 ms. (steps per millisecond=1 ) properties seen :0 out of 15
Probabilistic random walk after 9271 steps, saw 7995 distinct states, run finished after 9011 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 10:13:22] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2024-05-26 10:13:22] [INFO ] Computed 37 invariants in 613 ms
[2024-05-26 10:13:29] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1006/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/1381 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 18/1399 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1399 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 13303ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 371 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 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 1900 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1921 ms. Remains : 1381/1399 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 9892 ms. (4 steps per ms) remains 14/15 properties
FORMULA RERS17pb115-PT-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 568 ms. (70 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 730 ms. (54 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 13011 steps, run timeout after 12003 ms. (steps per millisecond=1 ) properties seen :0 out of 14
Probabilistic random walk after 13011 steps, saw 11169 distinct states, run finished after 12004 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 10:13:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2024-05-26 10:13:54] [INFO ] Computed 19 invariants in 303 ms
[2024-05-26 10:13:59] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1008/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/1381 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82619/82619 variables, and 1400 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45077 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 1381/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 14/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1008/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-26 10:14:52] [INFO ] Deduced a trap composed of 17 places in 3528 ms of which 11 ms to minimize.
[2024-05-26 10:15:01] [INFO ] Deduced a trap composed of 73 places in 3424 ms of which 1 ms to minimize.
[2024-05-26 10:15:11] [INFO ] Deduced a trap composed of 129 places in 4020 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/82619 variables, and 21 constraints, problems are : Problem set: 0 solved, 14 unsolved in 46337 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 10/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 96957ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 369 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1422 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1422 ms. Remains : 1381/1381 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 4090 ms. (9 steps per ms) remains 12/14 properties
FORMULA RERS17pb115-PT-4-ReachabilityFireability-2023-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 12/12 properties
[2024-05-26 10:15:35] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:15:35] [INFO ] Invariant cache hit.
[2024-05-26 10:15:40] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1066/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/1381 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82619/82619 variables, and 1400 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75114 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 1381/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 12/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1066/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-26 10:17:01] [INFO ] Deduced a trap composed of 17 places in 4438 ms of which 1 ms to minimize.
[2024-05-26 10:17:04] [INFO ] Deduced a trap composed of 65 places in 3490 ms of which 1 ms to minimize.
[2024-05-26 10:17:13] [INFO ] Deduced a trap composed of 73 places in 3552 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-26 10:17:46] [INFO ] Deduced a trap composed of 97 places in 3937 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/82619 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75415 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 156238ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 311 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 995 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 995 ms. Remains : 1381/1381 places, 144369/144369 transitions.
RANDOM walk for 40000 steps (8 resets) in 3930 ms. (10 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 464 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 5958 steps, run timeout after 6005 ms. (steps per millisecond=0 ) properties seen :0 out of 12
Probabilistic random walk after 5958 steps, saw 5096 distinct states, run finished after 6005 ms. (steps per millisecond=0 ) properties seen :0
[2024-05-26 10:18:21] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:18:21] [INFO ] Invariant cache hit.
[2024-05-26 10:18:27] [INFO ] State equation strengthened by 2277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1066/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/1381 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82619/82619 variables, and 1400 constraints, problems are : Problem set: 0 solved, 12 unsolved in 90126 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 1381/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 12/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1066/1377 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-26 10:20:02] [INFO ] Deduced a trap composed of 17 places in 4150 ms of which 2 ms to minimize.
[2024-05-26 10:20:06] [INFO ] Deduced a trap composed of 65 places in 3592 ms of which 1 ms to minimize.
[2024-05-26 10:20:15] [INFO ] Deduced a trap composed of 73 places in 3481 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1377 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-26 10:20:47] [INFO ] Deduced a trap composed of 97 places in 4082 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1377 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/82619 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 92788 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/1381 constraints, ReadFeed: 0/2277 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 188967ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 311 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 909 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 916 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2024-05-26 10:21:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:21:32] [INFO ] Invariant cache hit.
[2024-05-26 10:21:40] [INFO ] Implicit Places using invariants in 7767 ms returned []
Implicit Place search using SMT only with invariants took 7782 ms to find 0 implicit places.
Running 144368 sub problems to find dead transitions.
[2024-05-26 10:21:42] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2024-05-26 10:21:42] [INFO ] Invariant cache hit.
[2024-05-26 10:21:48] [INFO ] State equation strengthened by 2277 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb115-PT-4

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 624
MODEL NAME: /home/mcc/execution/model
1399 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 1716719365766

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

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb115-PT-4.tgz
mv RERS17pb115-PT-4 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;