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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16187.312 3600000.00 13244298.00 1243.60 TFFFTF?TFFTFTTFF 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-171662335900119.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 RERS17pb113-PT-1, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335900119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 15M 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 RERS17pb113-PT-1-ReachabilityFireability-2024-00
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-01
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-02
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-03
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-04
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2023-05
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-06
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-07
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2023-08
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-09
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-10
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-11
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-12
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-13
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-14
FORMULA_NAME RERS17pb113-PT-1-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716667554306

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:05:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 20:05:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:05:56] [INFO ] Load time of PNML (sax parser for PT used): 664 ms
[2024-05-25 20:05:56] [INFO ] Transformed 639 places.
[2024-05-25 20:05:56] [INFO ] Transformed 31353 transitions.
[2024-05-25 20:05:56] [INFO ] Found NUPN structural information;
[2024-05-25 20:05:56] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 951 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3325 ms. (12 steps per ms) remains 12/16 properties
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 677 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 11/12 properties
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
[2024-05-25 20:05:58] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-05-25 20:05:59] [INFO ] Computed 25 invariants in 110 ms
[2024-05-25 20:05:59] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-03 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb113-PT-1-ReachabilityFireability-2023-08 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 385/627 variables, 13/255 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 385/640 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/640 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/639 variables, 12/652 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 12/664 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/664 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 1303 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5052 ms.
Refiners :[Domain max(s): 639/639 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 11/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-07 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 432/627 variables, 13/208 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 432/640 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-25 20:06:08] [INFO ] Deduced a trap composed of 65 places in 2778 ms of which 35 ms to minimize.
[2024-05-25 20:06:10] [INFO ] Deduced a trap composed of 41 places in 2532 ms of which 4 ms to minimize.
SMT process timed out in 11793ms, After SMT, problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 354 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 627/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (10 resets) in 1520 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 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
Interrupted probabilistic random walk after 15059 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :0 out of 8
Probabilistic random walk after 15059 steps, saw 10058 distinct states, run finished after 3005 ms. (steps per millisecond=5 ) properties seen :0
[2024-05-25 20:06:15] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2024-05-25 20:06:15] [INFO ] Computed 13 invariants in 85 ms
[2024-05-25 20:06:15] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 451/627 variables, 13/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 451/640 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-11 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-15 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 18326/18953 variables, 627/1267 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18953 variables, 829/2096 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 2096 constraints, problems are : Problem set: 2 solved, 6 unsolved in 45033 ms.
Refiners :[Domain max(s): 627/627 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 8/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 496/627 variables, 13/144 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 496/640 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-25 20:07:03] [INFO ] Deduced a trap composed of 25 places in 2528 ms of which 4 ms to minimize.
[2024-05-25 20:07:05] [INFO ] Deduced a trap composed of 65 places in 2000 ms of which 3 ms to minimize.
[2024-05-25 20:07:07] [INFO ] Deduced a trap composed of 49 places in 1980 ms of which 3 ms to minimize.
[2024-05-25 20:07:09] [INFO ] Deduced a trap composed of 41 places in 1949 ms of which 3 ms to minimize.
[2024-05-25 20:07:11] [INFO ] Deduced a trap composed of 65 places in 2145 ms of which 3 ms to minimize.
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-00 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-25 20:07:14] [INFO ] Deduced a trap composed of 49 places in 2616 ms of which 4 ms to minimize.
[2024-05-25 20:07:16] [INFO ] Deduced a trap composed of 65 places in 2306 ms of which 3 ms to minimize.
[2024-05-25 20:07:18] [INFO ] Deduced a trap composed of 41 places in 2159 ms of which 4 ms to minimize.
[2024-05-25 20:07:20] [INFO ] Deduced a trap composed of 65 places in 1944 ms of which 3 ms to minimize.
[2024-05-25 20:07:22] [INFO ] Deduced a trap composed of 41 places in 1679 ms of which 2 ms to minimize.
[2024-05-25 20:07:24] [INFO ] Deduced a trap composed of 65 places in 2094 ms of which 3 ms to minimize.
[2024-05-25 20:07:27] [INFO ] Deduced a trap composed of 66 places in 2354 ms of which 4 ms to minimize.
[2024-05-25 20:07:29] [INFO ] Deduced a trap composed of 65 places in 2285 ms of which 4 ms to minimize.
[2024-05-25 20:07:31] [INFO ] Deduced a trap composed of 65 places in 2053 ms of which 4 ms to minimize.
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-04 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb113-PT-1-ReachabilityFireability-2023-05 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2023-05 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-25 20:07:33] [INFO ] Deduced a trap composed of 41 places in 2123 ms of which 3 ms to minimize.
[2024-05-25 20:07:34] [INFO ] Deduced a trap composed of 65 places in 1314 ms of which 2 ms to minimize.
[2024-05-25 20:07:35] [INFO ] Deduced a trap composed of 49 places in 911 ms of which 2 ms to minimize.
[2024-05-25 20:07:36] [INFO ] Deduced a trap composed of 41 places in 646 ms of which 1 ms to minimize.
[2024-05-25 20:07:37] [INFO ] Deduced a trap composed of 65 places in 919 ms of which 1 ms to minimize.
[2024-05-25 20:07:38] [INFO ] Deduced a trap composed of 65 places in 1342 ms of which 3 ms to minimize.
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-00 is UNSAT
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-04 is UNSAT
Problem RERS17pb113-PT-1-ReachabilityFireability-2023-05 is UNSAT
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-10 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/660 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-05-25 20:07:40] [INFO ] Deduced a trap composed of 65 places in 1357 ms of which 2 ms to minimize.
[2024-05-25 20:07:41] [INFO ] Deduced a trap composed of 49 places in 1516 ms of which 3 ms to minimize.
[2024-05-25 20:07:42] [INFO ] Deduced a trap composed of 65 places in 1070 ms of which 1 ms to minimize.
[2024-05-25 20:07:43] [INFO ] Deduced a trap composed of 65 places in 897 ms of which 1 ms to minimize.
[2024-05-25 20:07:44] [INFO ] Deduced a trap composed of 65 places in 566 ms of which 0 ms to minimize.
[2024-05-25 20:07:45] [INFO ] Deduced a trap composed of 49 places in 942 ms of which 1 ms to minimize.
Problem RERS17pb113-PT-1-ReachabilityFireability-2024-13 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 6/666 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/666 constraints. Problems are: Problem set: 7 solved, 1 unsolved
SMT process timed out in 90804ms, After SMT, problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 617 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 626/627 places, 31352/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1086 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 15949 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 15949 steps, saw 10638 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
[2024-05-25 20:07:50] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-25 20:07:50] [INFO ] Computed 13 invariants in 62 ms
[2024-05-25 20:07:50] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 524/544 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 524/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18424/18951 variables, and 1099 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16327 ms.
Refiners :[Domain max(s): 544/626 constraints, Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 544/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 524/544 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 524/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 20:08:08] [INFO ] Deduced a trap composed of 40 places in 1244 ms of which 2 ms to minimize.
[2024-05-25 20:08:09] [INFO ] Deduced a trap composed of 64 places in 1774 ms of which 4 ms to minimize.
[2024-05-25 20:08:11] [INFO ] Deduced a trap composed of 48 places in 1555 ms of which 2 ms to minimize.
[2024-05-25 20:08:12] [INFO ] Deduced a trap composed of 64 places in 1287 ms of which 2 ms to minimize.
[2024-05-25 20:08:14] [INFO ] Deduced a trap composed of 64 places in 1974 ms of which 2 ms to minimize.
[2024-05-25 20:08:15] [INFO ] Deduced a trap composed of 64 places in 722 ms of which 2 ms to minimize.
[2024-05-25 20:08:17] [INFO ] Deduced a trap composed of 40 places in 1852 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 7/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18424/18951 variables, and 1106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40707 ms.
Refiners :[Domain max(s): 544/626 constraints, Positive P Invariants (semi-flows): 11/13 constraints, State Equation: 544/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 7/7 constraints]
After SMT, in 57362ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 395 ms.
Support contains 20 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 174 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-25 20:08:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-25 20:08:48] [INFO ] Invariant cache hit.
[2024-05-25 20:08:50] [INFO ] Implicit Places using invariants in 1995 ms returned []
Implicit Place search using SMT only with invariants took 2009 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2024-05-25 20:08:50] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-25 20:08:50] [INFO ] Invariant cache hit.
[2024-05-25 20:08:51] [INFO ] State equation strengthened by 268 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb113-PT-1

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 639
TRANSITIONS: 31353
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 125418
NUPN UNITS: 14
LOADING TIME: 125.812

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.481
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 127.562
OK.
----------------------------------------------------------------------
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: 705
MODEL NAME: /home/mcc/execution/model
639 places, 31353 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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 ReachabilityFireability -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="RERS17pb113-PT-1"
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 RERS17pb113-PT-1, 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-171662335900119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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