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.r496-tall-171640604300823.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 ltsminxred
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 r496-tall-171640604300823
=====================================================================

--------------------
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 1717201811034

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:30:12] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 00:30:12] [INFO ] Transformed 453 places.
[2024-06-01 00:30:12] [INFO ] Transformed 594 transitions.
[2024-06-01 00:30:12] [INFO ] Found NUPN structural information;
[2024-06-01 00:30:12] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 182 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 (330 resets) in 2025 ms. (19 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 (54 resets) in 417 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (68 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (84 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (66 resets) in 560 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (67 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (67 resets) in 113 ms. (350 steps per ms) remains 13/14 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (66 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 40 ms. (975 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (67 resets) in 34 ms. (1142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (86 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (79 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (63 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
// Phase 1: matrix 594 rows 453 cols
[2024-06-01 00:30:13] [INFO ] Computed 14 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 119/321 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 119/329 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 132/453 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 132/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2220 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: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 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) 119/321 variables, 8/210 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 119/329 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 22 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 2 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 3/332 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 00:30:17] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 3 ms to minimize.
[2024-06-01 00:30:17] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 2/334 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 00:30:17] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:30:17] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 2/336 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-00 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 132/453 variables, 6/342 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 132/474 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
Problem HealthRecord-PT-16-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 3 ms to minimize.
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 7/481 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/483 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 1/484 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 00:30:20] [INFO ] Deduced a trap composed of 160 places in 111 ms of which 2 ms to minimize.
[2024-06-01 00:30:20] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 2/486 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 594/1047 variables, 453/939 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 10/949 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 949 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5014 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: 10/13 constraints, Known Traps: 19/19 constraints]
After SMT, in 7385ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 232 edges and 453 vertex of which 22 / 453 are part of one of the 11 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 850 edges and 442 vertex of which 432 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 432 transition count 478
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 97 rules applied. Total rules applied 190 place count 341 transition count 472
Reduce places removed 2 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 31 rules applied. Total rules applied 221 place count 339 transition count 443
Reduce places removed 29 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 3 with 31 rules applied. Total rules applied 252 place count 310 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 253 place count 309 transition count 441
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 253 place count 309 transition count 433
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 269 place count 301 transition count 433
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 304 place count 266 transition count 387
Iterating global reduction 5 with 35 rules applied. Total rules applied 339 place count 266 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 340 place count 266 transition count 386
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 344 place count 262 transition count 378
Iterating global reduction 6 with 4 rules applied. Total rules applied 348 place count 262 transition count 378
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 376 place count 248 transition count 364
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 380 place count 246 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 388 place count 246 transition count 367
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 6 with 2 rules applied. Total rules applied 390 place count 245 transition count 366
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 405 place count 245 transition count 351
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 420 place count 230 transition count 351
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 421 place count 230 transition count 350
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 429 place count 230 transition count 350
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 432 place count 227 transition count 344
Iterating global reduction 7 with 3 rules applied. Total rules applied 435 place count 227 transition count 344
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 436 place count 227 transition count 343
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 227 transition count 343
Applied a total of 437 rules in 202 ms. Remains 227 /453 variables (removed 226) and now considering 343/594 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 227/453 places, 343/594 transitions.
RANDOM walk for 40000 steps (899 resets) in 340 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (187 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (186 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (185 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (178 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (187 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (183 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (158 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (185 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (198 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (194 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 1054556 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :5 out of 10
Probabilistic random walk after 1054556 steps, saw 188694 distinct states, run finished after 3016 ms. (steps per millisecond=349 ) properties seen :5
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 343 rows 227 cols
[2024-06-01 00:30:24] [INFO ] Computed 7 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 158/226 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/568 variables, 226/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/570 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 234 constraints, problems are : Problem set: 0 solved, 5 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 158/226 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 342/568 variables, 226/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/570 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/570 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 247 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 2036ms problems are : Problem set: 0 solved, 5 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-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 340 ms.
Support contains 18 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 343/343 transitions.
Graph (trivial) has 234 edges and 227 vertex of which 16 / 227 are part of one of the 6 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 501 edges and 217 vertex of which 193 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 193 transition count 187
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 52 rules applied. Total rules applied 176 place count 146 transition count 182
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 179 place count 145 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 182 place count 143 transition count 179
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 182 place count 143 transition count 166
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 208 place count 130 transition count 166
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 244 place count 94 transition count 130
Iterating global reduction 4 with 36 rules applied. Total rules applied 280 place count 94 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 280 place count 94 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 286 place count 91 transition count 127
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 293 place count 84 transition count 118
Iterating global reduction 4 with 7 rules applied. Total rules applied 300 place count 84 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 301 place count 83 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 83 transition count 117
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 4 with 20 rules applied. Total rules applied 322 place count 73 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 324 place count 71 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 326 place count 71 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 327 place count 70 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 70 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 329 place count 69 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 69 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 331 place count 68 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 68 transition count 99
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 65 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 341 place count 65 transition count 110
Free-agglomeration rule applied 9 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 350 place count 65 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 359 place count 56 transition count 100
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 360 place count 56 transition count 100
Applied a total of 360 rules in 35 ms. Remains 56 /227 variables (removed 171) and now considering 100/343 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 56/227 places, 100/343 transitions.
RANDOM walk for 40000 steps (27 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (13 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 584 steps, run visited all 1 properties in 5 ms. (steps per millisecond=116 )
Probabilistic random walk after 584 steps, saw 285 distinct states, run finished after 7 ms. (steps per millisecond=83 ) properties seen :1
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 15419 ms.
ITS solved all properties within timeout

BK_STOP 1717201827578

--------------------
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="ltsminxred"
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 ltsminxred"
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 r496-tall-171640604300823"
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 ;