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-171640602300783.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300783
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716490996225

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:03:17] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-23 19:03:17] [INFO ] Transformed 159 places.
[2024-05-23 19:03:17] [INFO ] Transformed 334 transitions.
[2024-05-23 19:03:17] [INFO ] Found NUPN structural information;
[2024-05-23 19:03:17] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
RANDOM walk for 40000 steps (2701 resets) in 1932 ms. (20 steps per ms) remains 12/16 properties
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (359 resets) in 345 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (390 resets) in 703 ms. (56 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (395 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (395 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (392 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (380 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (386 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (392 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (242 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (389 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (381 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (393 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
[2024-05-23 19:03:18] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-05-23 19:03:19] [INFO ] Computed 18 invariants in 14 ms
[2024-05-23 19:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 38/127 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 32/159 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 294/453 variables, 159/336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/454 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 337 constraints, problems are : Problem set: 0 solved, 12 unsolved in 963 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: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 38/127 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 12 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:20] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 32/159 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 32/191 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
Problem HealthRecord-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 12/203 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 5 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 14/217 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 3/220 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 294/453 variables, 159/379 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 11/390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 1/454 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/454 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/454 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 391 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5012 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: 11/12 constraints, Known Traps: 43/43 constraints]
After SMT, in 6143ms problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (complete) has 677 edges and 159 vertex of which 151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 151 transition count 294
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 44 place count 113 transition count 218
Iterating global reduction 1 with 38 rules applied. Total rules applied 82 place count 113 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 111 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 111 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 111 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 109 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 109 transition count 210
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 93 place count 109 transition count 210
Applied a total of 93 rules in 44 ms. Remains 109 /159 variables (removed 50) and now considering 210/307 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 109/159 places, 210/307 transitions.
RANDOM walk for 40000 steps (2646 resets) in 577 ms. (69 steps per ms) remains 9/11 properties
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (355 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (394 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (393 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (388 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (389 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (238 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (398 resets) in 34 ms. (1142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (380 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (396 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
// Phase 1: matrix 210 rows 109 cols
[2024-05-23 19:03:25] [INFO ] Computed 10 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/109 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 210/319 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 119 constraints, problems are : Problem set: 0 solved, 9 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/109 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 8 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:03:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 210/319 variables, 109/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:27] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/319 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/319 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/319 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/319 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 173 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 45/45 constraints]
After SMT, in 4942ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 1243 ms.
Support contains 31 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 210/210 transitions.
Graph (trivial) has 67 edges and 109 vertex of which 6 / 109 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 445 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 203
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 104 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 103 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 103 transition count 199
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 10 place count 102 transition count 199
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 39 place count 73 transition count 141
Iterating global reduction 3 with 29 rules applied. Total rules applied 68 place count 73 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 73 place count 73 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 71 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 71 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 70 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 70 transition count 130
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 86 place count 67 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 67 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 66 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 66 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 65 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 65 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 65 transition count 129
Applied a total of 93 rules in 40 ms. Remains 65 /109 variables (removed 44) and now considering 129/210 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 65/109 places, 129/210 transitions.
RANDOM walk for 40000 steps (4110 resets) in 626 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (699 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (822 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2426051 steps, run visited all 2 properties in 2189 ms. (steps per millisecond=1108 )
Probabilistic random walk after 2426051 steps, saw 302604 distinct states, run finished after 2193 ms. (steps per millisecond=1106 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 16935 ms.
ITS solved all properties within timeout

BK_STOP 1716491014371

--------------------
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="HealthRecord-PT-11"
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 HealthRecord-PT-11, 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 r179-tall-171640602300783"
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 [ "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 ;