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

About the Execution of GreatSPN+red for RERS2020-PT-pb103

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1462646.00 0.00 0.00 FFFFF?F?FTFT???? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662336400351.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 RERS2020-PT-pb103, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336400351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M 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 RERS2020-PT-pb103-ReachabilityFireability-2024-00
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-01
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-02
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-03
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-04
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-05
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-06
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2023-07
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-08
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-09
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-10
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2023-11
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2023-12
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-13
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2024-14
FORMULA_NAME RERS2020-PT-pb103-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716731106168

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 13:45:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 13:45:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:45:08] [INFO ] Load time of PNML (sax parser for PT used): 765 ms
[2024-05-26 13:45:08] [INFO ] Transformed 520 places.
[2024-05-26 13:45:08] [INFO ] Transformed 31658 transitions.
[2024-05-26 13:45:08] [INFO ] Found NUPN structural information;
[2024-05-26 13:45:08] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 990 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
RANDOM walk for 40000 steps (10 resets) in 3791 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 173 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 173 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 35510 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :0 out of 16
Probabilistic random walk after 35510 steps, saw 24352 distinct states, run finished after 3006 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-26 13:45:13] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2024-05-26 13:45:13] [INFO ] Computed 15 invariants in 110 ms
[2024-05-26 13:45:13] [INFO ] State equation strengthened by 1379 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 292/513 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 292/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 7/520 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19193/19194 variables, and 1055 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5068 ms.
Refiners :[Domain max(s): 520/520 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 520/520 constraints, ReadFeed: 0/1379 constraints, PredecessorRefiner: 16/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-09 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 292/513 variables, 8/229 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 292/521 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-26 13:45:21] [INFO ] Deduced a trap composed of 22 places in 2087 ms of which 32 ms to minimize.
[2024-05-26 13:45:23] [INFO ] Deduced a trap composed of 73 places in 2147 ms of which 5 ms to minimize.
[2024-05-26 13:45:26] [INFO ] Deduced a trap composed of 14 places in 2139 ms of which 9 ms to minimize.
SMT process timed out in 12885ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27378
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 1078 place count 512 transition count 27371
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1106 place count 505 transition count 27350
Applied a total of 1106 rules in 541 ms. Remains 505 /520 variables (removed 15) and now considering 27350/28429 (removed 1079) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 554 ms. Remains : 505/520 places, 27350/28429 transitions.
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 31189 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 15
Probabilistic random walk after 31189 steps, saw 22335 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-26 13:45:30] [INFO ] Flow matrix only has 18650 transitions (discarded 8700 similar events)
// Phase 1: matrix 18650 rows 505 cols
[2024-05-26 13:45:30] [INFO ] Computed 8 invariants in 79 ms
[2024-05-26 13:45:30] [INFO ] State equation strengthened by 1371 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 305/505 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 305/513 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-26 13:45:33] [INFO ] Deduced a trap composed of 14 places in 2175 ms of which 3 ms to minimize.
[2024-05-26 13:45:35] [INFO ] Deduced a trap composed of 53 places in 1695 ms of which 3 ms to minimize.
[2024-05-26 13:45:37] [INFO ] Deduced a trap composed of 59 places in 1699 ms of which 2 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-06 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-10 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 3/516 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/516 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 18650/19155 variables, 505/1021 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19155 variables, 1371/2392 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19155 variables, 0/2392 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/19155 variables, 0/2392 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19155/19155 variables, and 2392 constraints, problems are : Problem set: 2 solved, 13 unsolved in 33935 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 505/505 constraints, ReadFeed: 1371/1371 constraints, PredecessorRefiner: 15/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 182/182 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 323/505 variables, 8/190 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 323/513 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 3/516 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-26 13:46:07] [INFO ] Deduced a trap composed of 49 places in 2086 ms of which 3 ms to minimize.
[2024-05-26 13:46:09] [INFO ] Deduced a trap composed of 67 places in 1939 ms of which 4 ms to minimize.
[2024-05-26 13:46:11] [INFO ] Deduced a trap composed of 50 places in 1811 ms of which 3 ms to minimize.
[2024-05-26 13:46:13] [INFO ] Deduced a trap composed of 73 places in 2139 ms of which 3 ms to minimize.
[2024-05-26 13:46:15] [INFO ] Deduced a trap composed of 61 places in 1911 ms of which 3 ms to minimize.
[2024-05-26 13:46:17] [INFO ] Deduced a trap composed of 149 places in 1772 ms of which 3 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-00 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-01 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-26 13:46:19] [INFO ] Deduced a trap composed of 22 places in 1881 ms of which 2 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-02 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-26 13:46:21] [INFO ] Deduced a trap composed of 12 places in 2328 ms of which 4 ms to minimize.
[2024-05-26 13:46:23] [INFO ] Deduced a trap composed of 40 places in 2294 ms of which 4 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-03 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-26 13:46:26] [INFO ] Deduced a trap composed of 65 places in 2081 ms of which 3 ms to minimize.
[2024-05-26 13:46:27] [INFO ] Deduced a trap composed of 96 places in 1869 ms of which 3 ms to minimize.
[2024-05-26 13:46:29] [INFO ] Deduced a trap composed of 102 places in 1395 ms of which 2 ms to minimize.
[2024-05-26 13:46:31] [INFO ] Deduced a trap composed of 33 places in 1965 ms of which 4 ms to minimize.
[2024-05-26 13:46:33] [INFO ] Deduced a trap composed of 85 places in 2127 ms of which 3 ms to minimize.
[2024-05-26 13:46:35] [INFO ] Deduced a trap composed of 25 places in 2191 ms of which 3 ms to minimize.
[2024-05-26 13:46:37] [INFO ] Deduced a trap composed of 51 places in 1839 ms of which 3 ms to minimize.
[2024-05-26 13:46:39] [INFO ] Deduced a trap composed of 63 places in 1708 ms of which 2 ms to minimize.
[2024-05-26 13:46:41] [INFO ] Deduced a trap composed of 58 places in 1761 ms of which 3 ms to minimize.
[2024-05-26 13:46:42] [INFO ] Deduced a trap composed of 77 places in 1869 ms of which 2 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-08 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityFireability-2023-11 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2023-11 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-26 13:46:44] [INFO ] Deduced a trap composed of 67 places in 1798 ms of which 2 ms to minimize.
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-00 is UNSAT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-01 is UNSAT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-02 is UNSAT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-03 is UNSAT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-04 is UNSAT
FORMULA RERS2020-PT-pb103-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS2020-PT-pb103-ReachabilityFireability-2024-08 is UNSAT
Problem RERS2020-PT-pb103-ReachabilityFireability-2023-11 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/536 constraints. Problems are: Problem set: 9 solved, 6 unsolved
[2024-05-26 13:46:46] [INFO ] Deduced a trap composed of 40 places in 1600 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 1/537 constraints. Problems are: Problem set: 9 solved, 6 unsolved
[2024-05-26 13:46:49] [INFO ] Deduced a trap composed of 79 places in 1207 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 1/538 constraints. Problems are: Problem set: 9 solved, 6 unsolved
[2024-05-26 13:46:51] [INFO ] Deduced a trap composed of 134 places in 2089 ms of which 3 ms to minimize.
SMT process timed out in 81043ms, After SMT, problems are : Problem set: 9 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 27350/27350 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 504 transition count 27349
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 504 transition count 27348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 503 transition count 27348
Applied a total of 4 rules in 436 ms. Remains 503 /505 variables (removed 2) and now considering 27348/27350 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 503/505 places, 27348/27350 transitions.
RANDOM walk for 40000 steps (9 resets) in 1272 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 37239 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 6
Probabilistic random walk after 37239 steps, saw 26306 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-26 13:46:55] [INFO ] Flow matrix only has 18648 transitions (discarded 8700 similar events)
// Phase 1: matrix 18648 rows 503 cols
[2024-05-26 13:46:55] [INFO ] Computed 8 invariants in 69 ms
[2024-05-26 13:46:55] [INFO ] State equation strengthened by 1371 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 387/503 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 387/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18648/19151 variables, 503/1014 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19151 variables, 1371/2385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19151 variables, 0/2385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/19151 variables, 0/2385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19151/19151 variables, and 2385 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14861 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 503/503 constraints, ReadFeed: 1371/1371 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 387/503 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 387/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 13:47:12] [INFO ] Deduced a trap composed of 79 places in 1635 ms of which 3 ms to minimize.
[2024-05-26 13:47:14] [INFO ] Deduced a trap composed of 102 places in 1778 ms of which 2 ms to minimize.
[2024-05-26 13:47:16] [INFO ] Deduced a trap composed of 12 places in 1571 ms of which 3 ms to minimize.
[2024-05-26 13:47:18] [INFO ] Deduced a trap composed of 39 places in 1937 ms of which 3 ms to minimize.
[2024-05-26 13:47:19] [INFO ] Deduced a trap composed of 33 places in 1759 ms of which 3 ms to minimize.
[2024-05-26 13:47:22] [INFO ] Deduced a trap composed of 25 places in 2166 ms of which 4 ms to minimize.
[2024-05-26 13:47:24] [INFO ] Deduced a trap composed of 92 places in 1727 ms of which 2 ms to minimize.
[2024-05-26 13:47:25] [INFO ] Deduced a trap composed of 149 places in 1755 ms of which 3 ms to minimize.
[2024-05-26 13:47:27] [INFO ] Deduced a trap composed of 22 places in 1738 ms of which 2 ms to minimize.
[2024-05-26 13:47:29] [INFO ] Deduced a trap composed of 61 places in 1211 ms of which 2 ms to minimize.
[2024-05-26 13:47:30] [INFO ] Deduced a trap composed of 78 places in 1366 ms of which 3 ms to minimize.
[2024-05-26 13:47:31] [INFO ] Deduced a trap composed of 85 places in 1243 ms of which 2 ms to minimize.
[2024-05-26 13:47:33] [INFO ] Deduced a trap composed of 124 places in 1763 ms of which 3 ms to minimize.
[2024-05-26 13:47:34] [INFO ] Deduced a trap composed of 14 places in 1260 ms of which 2 ms to minimize.
[2024-05-26 13:47:35] [INFO ] Deduced a trap composed of 73 places in 849 ms of which 2 ms to minimize.
[2024-05-26 13:47:36] [INFO ] Deduced a trap composed of 69 places in 839 ms of which 1 ms to minimize.
[2024-05-26 13:47:37] [INFO ] Deduced a trap composed of 63 places in 853 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 17/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 13:47:39] [INFO ] Deduced a trap composed of 14 places in 2045 ms of which 4 ms to minimize.
[2024-05-26 13:47:41] [INFO ] Deduced a trap composed of 62 places in 2034 ms of which 2 ms to minimize.
[2024-05-26 13:47:43] [INFO ] Deduced a trap composed of 68 places in 1861 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18648/19151 variables, 503/1034 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19151 variables, 1371/2405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19151 variables, 2/2407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19151/19151 variables, and 2407 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75041 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 503/503 constraints, ReadFeed: 1371/1371 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 90452ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27348/27348 transitions.
Applied a total of 0 rules in 122 ms. Remains 503 /503 variables (removed 0) and now considering 27348/27348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 503/503 places, 27348/27348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27348/27348 transitions.
Applied a total of 0 rules in 98 ms. Remains 503 /503 variables (removed 0) and now considering 27348/27348 (removed 0) transitions.
[2024-05-26 13:48:26] [INFO ] Flow matrix only has 18648 transitions (discarded 8700 similar events)
[2024-05-26 13:48:26] [INFO ] Invariant cache hit.
[2024-05-26 13:48:26] [INFO ] Implicit Places using invariants in 697 ms returned []
Implicit Place search using SMT only with invariants took 709 ms to find 0 implicit places.
Running 27347 sub problems to find dead transitions.
[2024-05-26 13:48:27] [INFO ] Flow matrix only has 18648 transitions (discarded 8700 similar events)
[2024-05-26 13:48:27] [INFO ] Invariant cache hit.
[2024-05-26 13:48:27] [INFO ] State equation strengthened by 1371 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS2020-PT-pb103

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 520
TRANSITIONS: 31658
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 125892
NUPN UNITS: 9
LOADING TIME: 289.742

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.415
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 291.317
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: 746
MODEL NAME: /home/mcc/execution/model
520 places, 31658 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.
Building monolithic NSF...
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716732568814

--------------------
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="RERS2020-PT-pb103"
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 RERS2020-PT-pb103, 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-171662336400351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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