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-171662336100222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RERS17pb114-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336100222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 73M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716709120702

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 07:38:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 07:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:38:43] [INFO ] Load time of PNML (sax parser for PT used): 1969 ms
[2024-05-26 07:38:43] [INFO ] Transformed 1446 places.
[2024-05-26 07:38:44] [INFO ] Transformed 151085 transitions.
[2024-05-26 07:38:44] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2523 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 6297 ms. (6 steps per ms) remains 10/16 properties
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 702 ms. (56 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 10/10 properties
[2024-05-26 07:38:48] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2024-05-26 07:38:48] [INFO ] Computed 35 invariants in 438 ms
[2024-05-26 07:38:54] [INFO ] State equation strengthened by 2342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 135/250 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1196/1446 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 11026ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 528 rules applied. Total rules applied 528 place count 1430 transition count 150573
Applied a total of 528 rules in 2006 ms. Remains 1430 /1446 variables (removed 16) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2029 ms. Remains : 1430/1446 places, 150573/151085 transitions.
RANDOM walk for 40000 steps (8 resets) in 3430 ms. (11 steps per ms) remains 9/10 properties
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
[2024-05-26 07:39:03] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1430 cols
[2024-05-26 07:39:03] [INFO ] Computed 19 invariants in 301 ms
[2024-05-26 07:39:08] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86120/86120 variables, and 1449 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1430/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 07:40:00] [INFO ] Deduced a trap composed of 65 places in 4915 ms of which 15 ms to minimize.
[2024-05-26 07:40:07] [INFO ] Deduced a trap composed of 129 places in 6295 ms of which 4 ms to minimize.
[2024-05-26 07:40:12] [INFO ] Deduced a trap composed of 73 places in 5699 ms of which 1 ms to minimize.
[2024-05-26 07:40:28] [INFO ] Deduced a trap composed of 129 places in 4901 ms of which 1 ms to minimize.
[2024-05-26 07:40:33] [INFO ] Deduced a trap composed of 97 places in 4608 ms of which 1 ms to minimize.
[2024-05-26 07:40:41] [INFO ] Deduced a trap composed of 97 places in 4841 ms of which 4 ms to minimize.
SMT process timed out in 97956ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1391 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1391 ms. Remains : 1430/1430 places, 150573/150573 transitions.
RANDOM walk for 40000 steps (8 resets) in 3077 ms. (12 steps per ms) remains 8/9 properties
FORMULA RERS17pb114-PT-5-ReachabilityCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 8/8 properties
[2024-05-26 07:40:44] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:40:44] [INFO ] Invariant cache hit.
[2024-05-26 07:40:49] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86120/86120 variables, and 1449 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1430/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 07:42:11] [INFO ] Deduced a trap composed of 97 places in 5421 ms of which 7 ms to minimize.
[2024-05-26 07:42:16] [INFO ] Deduced a trap composed of 65 places in 4511 ms of which 2 ms to minimize.
[2024-05-26 07:42:28] [INFO ] Deduced a trap composed of 41 places in 5174 ms of which 2 ms to minimize.
[2024-05-26 07:42:33] [INFO ] Deduced a trap composed of 65 places in 5043 ms of which 2 ms to minimize.
[2024-05-26 07:42:38] [INFO ] Deduced a trap composed of 97 places in 4359 ms of which 1 ms to minimize.
[2024-05-26 07:42:53] [INFO ] Deduced a trap composed of 67 places in 5214 ms of which 1 ms to minimize.
[2024-05-26 07:42:59] [INFO ] Deduced a trap composed of 97 places in 5139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 07:43:20] [INFO ] Deduced a trap composed of 129 places in 4977 ms of which 2 ms to minimize.
SMT process timed out in 155876ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 97 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1126 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1128 ms. Remains : 1430/1430 places, 150573/150573 transitions.
RANDOM walk for 40000 steps (8 resets) in 3152 ms. (12 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 4163 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :0 out of 8
Probabilistic random walk after 4163 steps, saw 3764 distinct states, run finished after 3009 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 07:43:26] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:43:26] [INFO ] Invariant cache hit.
[2024-05-26 07:43:31] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86120/86120 variables, and 1449 constraints, problems are : Problem set: 0 solved, 8 unsolved in 90129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1430/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1318/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 07:45:09] [INFO ] Deduced a trap composed of 97 places in 5431 ms of which 2 ms to minimize.
[2024-05-26 07:45:13] [INFO ] Deduced a trap composed of 65 places in 4361 ms of which 1 ms to minimize.
[2024-05-26 07:45:25] [INFO ] Deduced a trap composed of 41 places in 5114 ms of which 1 ms to minimize.
[2024-05-26 07:45:30] [INFO ] Deduced a trap composed of 65 places in 5083 ms of which 1 ms to minimize.
[2024-05-26 07:45:35] [INFO ] Deduced a trap composed of 97 places in 4359 ms of which 1 ms to minimize.
[2024-05-26 07:45:50] [INFO ] Deduced a trap composed of 67 places in 5185 ms of which 2 ms to minimize.
[2024-05-26 07:45:57] [INFO ] Deduced a trap composed of 97 places in 6437 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-26 07:46:18] [INFO ] Deduced a trap composed of 129 places in 4931 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/86120 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 90110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 185153ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 97 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1340 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1340 ms. Remains : 1430/1430 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1326 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2024-05-26 07:46:34] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:46:34] [INFO ] Invariant cache hit.
[2024-05-26 07:46:43] [INFO ] Implicit Places using invariants in 8692 ms returned []
Implicit Place search using SMT only with invariants took 8700 ms to find 0 implicit places.
Running 150572 sub problems to find dead transitions.
[2024-05-26 07:46:44] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 07:46:44] [INFO ] Invariant cache hit.
[2024-05-26 07:46:49] [INFO ] State equation strengthened by 2341 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb114-PT-5

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: 1446
TRANSITIONS: 151085
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 3.561s, Sys 0.235s]


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


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

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

Process ID: 657
MODEL NAME: /home/mcc/execution/model
1446 places, 151085 transitions.

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

BK_STOP 1716710124546

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb114-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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