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.r179-tall-171640602300782.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 HealthRecord-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 HealthRecord-PT-11-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716490976155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:02:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:02:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:02:57] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-23 19:02:57] [INFO ] Transformed 159 places.
[2024-05-23 19:02:57] [INFO ] Transformed 334 transitions.
[2024-05-23 19:02:57] [INFO ] Found NUPN structural information;
[2024-05-23 19:02:57] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2659 resets) in 1965 ms. (20 steps per ms) remains 10/13 properties
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (503 resets) in 426 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (398 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (388 resets) in 734 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (383 resets) in 129 ms. (307 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (380 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (367 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (396 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (378 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (388 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (382 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
[2024-05-23 19:02:58] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-05-23 19:02:58] [INFO ] Computed 18 invariants in 18 ms
[2024-05-23 19:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HealthRecord-PT-11-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 30/123 variables, 10/103 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 30/133 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 36/159 variables, 8/141 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 36/177 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 294/453 variables, 159/336 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/454 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 337 constraints, problems are : Problem set: 1 solved, 8 unsolved in 853 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 37/115 variables, 10/88 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 37/125 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 12 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 6/131 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:00] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 44/159 variables, 8/146 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 44/190 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 4 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 3/213 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 2 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 5/218 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 5/223 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/159 variables, 5/228 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/159 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 294/453 variables, 159/387 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 8/395 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-23 19:03:03] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 1/396 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/453 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 1/454 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/454 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/454 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 397 constraints, problems are : Problem set: 1 solved, 8 unsolved in 4848 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 52/52 constraints]
After SMT, in 5825ms problems are : Problem set: 1 solved, 8 unsolved
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 954 ms.
Support contains 43 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 124 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 671 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 286
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 145 transition count 282
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 143 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 143 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 142 transition count 280
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 69 place count 88 transition count 172
Iterating global reduction 3 with 54 rules applied. Total rules applied 123 place count 88 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 87 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 83 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 83 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 83 transition count 193
Applied a total of 135 rules in 80 ms. Remains 83 /159 variables (removed 76) and now considering 193/307 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 83/159 places, 193/307 transitions.
RANDOM walk for 40000 steps (5220 resets) in 821 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1365 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (858 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 751314 steps, run visited all 2 properties in 956 ms. (steps per millisecond=785 )
Probabilistic random walk after 751314 steps, saw 107506 distinct states, run finished after 959 ms. (steps per millisecond=783 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9838 ms.
ITS solved all properties within timeout

BK_STOP 1716490987157

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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

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="HealthRecord-PT-11"
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 HealthRecord-PT-11, 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 r179-tall-171640602300782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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