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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 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 125K 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-16-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716491505154

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:11:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:11:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:11:46] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-23 19:11:46] [INFO ] Transformed 453 places.
[2024-05-23 19:11:46] [INFO ] Transformed 594 transitions.
[2024-05-23 19:11:46] [INFO ] Found NUPN structural information;
[2024-05-23 19:11:46] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (301 resets) in 1854 ms. (21 steps per ms) remains 14/16 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (52 resets) in 702 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (69 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (69 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 706 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (61 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (62 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (64 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (69 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (86 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (70 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (63 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
// Phase 1: matrix 594 rows 453 cols
[2024-05-23 19:11:48] [INFO ] Computed 14 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 114/329 variables, 8/223 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 114/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 124/453 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 124/467 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1984 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 114/329 variables, 8/223 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 114/337 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 19:11:50] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 22 ms to minimize.
[2024-05-23 19:11:50] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-23 19:11:50] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:11:51] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:11:51] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-05-23 19:11:51] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-05-23 19:11:51] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:11:51] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 8/345 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 19:11:52] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-23 19:11:52] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 2/347 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-00 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 124/453 variables, 6/353 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 124/477 constraints. Problems are: Problem set: 2 solved, 12 unsolved
[2024-05-23 19:11:52] [INFO ] Deduced a trap composed of 99 places in 216 ms of which 3 ms to minimize.
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
Problem HealthRecord-PT-16-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 199 places in 141 ms of which 2 ms to minimize.
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 6/483 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-05-23 19:11:53] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-23 19:11:54] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 2/485 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-05-23 19:11:54] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/486 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 594/1047 variables, 453/939 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1047 variables, 11/950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 950 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5011 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 19/19 constraints]
After SMT, in 7203ms problems are : Problem set: 3 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 142 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 212 edges and 453 vertex of which 18 / 453 are part of one of the 9 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 854 edges and 444 vertex of which 435 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 435 transition count 492
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 115 rules applied. Total rules applied 198 place count 354 transition count 458
Reduce places removed 32 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 2 with 34 rules applied. Total rules applied 232 place count 322 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 321 transition count 456
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 233 place count 321 transition count 449
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 314 transition count 449
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 282 place count 279 transition count 403
Iterating global reduction 4 with 35 rules applied. Total rules applied 317 place count 279 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 318 place count 279 transition count 402
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 321 place count 276 transition count 396
Iterating global reduction 5 with 3 rules applied. Total rules applied 324 place count 276 transition count 396
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 350 place count 263 transition count 383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 352 place count 262 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 357 place count 262 transition count 386
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 373 place count 262 transition count 370
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 389 place count 246 transition count 370
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 397 place count 246 transition count 370
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 400 place count 243 transition count 364
Iterating global reduction 6 with 3 rules applied. Total rules applied 403 place count 243 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 404 place count 243 transition count 363
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 406 place count 243 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 407 place count 242 transition count 362
Iterating global reduction 6 with 1 rules applied. Total rules applied 408 place count 242 transition count 362
Applied a total of 408 rules in 156 ms. Remains 242 /453 variables (removed 211) and now considering 362/594 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 242/453 places, 362/594 transitions.
RANDOM walk for 40000 steps (731 resets) in 844 ms. (47 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (142 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (160 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (157 resets) in 173 ms. (229 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (161 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (138 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (153 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (156 resets) in 34 ms. (1142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 29 ms. (1333 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (171 resets) in 36 ms. (1081 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (157 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
// Phase 1: matrix 362 rows 242 cols
[2024-05-23 19:11:56] [INFO ] Computed 8 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 139/241 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 361/602 variables, 241/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/604 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/604 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 250 constraints, problems are : Problem set: 0 solved, 9 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 242/242 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/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 139/241 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:11:56] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:11:56] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:11:56] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 118 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 361/602 variables, 241/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:11:58] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:11:58] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 19:11:58] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/604 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 273 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 3788ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1300 ms.
Support contains 87 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 362/362 transitions.
Graph (trivial) has 115 edges and 242 vertex of which 6 / 242 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 545 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 236 transition count 334
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 23 rules applied. Total rules applied 45 place count 216 transition count 331
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 215 transition count 327
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 211 transition count 327
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 54 place count 211 transition count 323
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 62 place count 207 transition count 323
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 69 place count 200 transition count 312
Iterating global reduction 4 with 7 rules applied. Total rules applied 76 place count 200 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 200 transition count 311
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 99 place count 189 transition count 300
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 113 place count 182 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 116 place count 182 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 125 place count 182 transition count 298
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 181 transition count 297
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 181 transition count 297
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 131 place count 181 transition count 293
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 135 place count 177 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 136 place count 177 transition count 292
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 137 place count 177 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 138 place count 176 transition count 294
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 176 transition count 294
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 146 place count 176 transition count 294
Applied a total of 146 rules in 54 ms. Remains 176 /242 variables (removed 66) and now considering 294/362 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 176/242 places, 294/362 transitions.
RANDOM walk for 40000 steps (1177 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (233 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (229 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (237 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1384073 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 3
Probabilistic random walk after 1384073 steps, saw 226959 distinct states, run finished after 3004 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 294 rows 176 cols
[2024-05-23 19:12:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 19:12:04] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 294/470 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 2 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 3 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 294/470 variables, 176/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 199 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 109 ms.
Support contains 38 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 294/294 transitions.
Graph (trivial) has 110 edges and 176 vertex of which 6 / 176 are part of one of the 3 SCC in 0 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 436 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 172 transition count 268
Reduce places removed 20 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 29 rules applied. Total rules applied 51 place count 152 transition count 259
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 63 place count 143 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 142 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 142 transition count 255
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 141 transition count 255
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 78 place count 129 transition count 234
Iterating global reduction 4 with 12 rules applied. Total rules applied 90 place count 129 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 129 transition count 233
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 111 place count 119 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 119 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 118 transition count 220
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 118 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 122 place count 114 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 114 transition count 237
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 125 place count 112 transition count 227
Iterating global reduction 7 with 2 rules applied. Total rules applied 127 place count 112 transition count 227
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 128 place count 111 transition count 226
Iterating global reduction 7 with 1 rules applied. Total rules applied 129 place count 111 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 130 place count 111 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 133 place count 111 transition count 222
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 8 with 2 rules applied. Total rules applied 135 place count 110 transition count 221
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 142 place count 110 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 149 place count 103 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 150 place count 103 transition count 214
Applied a total of 150 rules in 43 ms. Remains 103 /176 variables (removed 73) and now considering 214/294 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 103/176 places, 214/294 transitions.
RANDOM walk for 40000 steps (2394 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (490 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2823504 steps, run timeout after 3001 ms. (steps per millisecond=940 ) properties seen :0 out of 1
Probabilistic random walk after 2823504 steps, saw 378214 distinct states, run finished after 3003 ms. (steps per millisecond=940 ) properties seen :0
[2024-05-23 19:12:09] [INFO ] Flow matrix only has 212 transitions (discarded 2 similar events)
// Phase 1: matrix 212 rows 103 cols
[2024-05-23 19:12:09] [INFO ] Computed 6 invariants in 4 ms
[2024-05-23 19:12:09] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/315 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 212/315 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1248 steps, including 58 resets, run visited all 1 properties in 3 ms. (steps per millisecond=416 )
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 23548 ms.
ITS solved all properties within timeout

BK_STOP 1716491529954

--------------------
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-16"
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-16, 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-171640602400823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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