About the Execution of GreatSPN+red for HealthRecord-PT-17
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
427.995 | 13887.00 | 29851.00 | 184.70 | TTTFTTFFTTFTFTTT | normal |
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-171640602400831.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-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400831
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 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 175K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716492084287
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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:21:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:21:25] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-23 19:21:25] [INFO ] Transformed 624 places.
[2024-05-23 19:21:25] [INFO ] Transformed 828 transitions.
[2024-05-23 19:21:25] [INFO ] Found NUPN structural information;
[2024-05-23 19:21:25] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (345 resets) in 1382 ms. (28 steps per ms) remains 10/16 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 111 ms. (357 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 494 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (58 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (57 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (56 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (41 resets) in 61 ms. (645 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
// Phase 1: matrix 828 rows 624 cols
[2024-05-23 19:21:26] [INFO ] Computed 18 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 153/309 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 153/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-17-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-17-ReachabilityFireability-2024-12 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 315/624 variables, 8/327 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 315/642 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 1266 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1485 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem HealthRecord-PT-17-ReachabilityFireability-2024-14 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 168/261 variables, 10/103 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 168/271 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 19:21:28] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 23 ms to minimize.
Problem HealthRecord-PT-17-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-23 19:21:28] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/273 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:28] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:21:28] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 2 ms to minimize.
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 4/277 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 2/279 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/279 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 363/624 variables, 8/287 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 363/650 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 4 ms to minimize.
[2024-05-23 19:21:29] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-05-23 19:21:30] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
[2024-05-23 19:21:30] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-23 19:21:30] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/624 variables, 5/655 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/624 variables, 0/655 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 828/1452 variables, 624/1279 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1452 variables, 4/1283 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:31] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 4 ms to minimize.
[2024-05-23 19:21:31] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1452 variables, 2/1285 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1452 variables, 0/1285 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:32] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-23 19:21:32] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 3 ms to minimize.
[2024-05-23 19:21:32] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 3 ms to minimize.
[2024-05-23 19:21:32] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1452 variables, 4/1289 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 19:21:33] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 1290 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5013 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 20/20 constraints]
After SMT, in 6688ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 540 edges and 624 vertex of which 32 / 624 are part of one of the 16 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1264 edges and 608 vertex of which 593 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 593 transition count 591
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 222 rules applied. Total rules applied 423 place count 394 transition count 568
Reduce places removed 9 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 38 rules applied. Total rules applied 461 place count 385 transition count 539
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 492 place count 356 transition count 537
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 493 place count 355 transition count 537
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 493 place count 355 transition count 528
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 511 place count 346 transition count 528
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 612 place count 245 transition count 404
Iterating global reduction 5 with 101 rules applied. Total rules applied 713 place count 245 transition count 404
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 723 place count 245 transition count 394
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 760 place count 208 transition count 321
Iterating global reduction 6 with 37 rules applied. Total rules applied 797 place count 208 transition count 321
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 802 place count 203 transition count 311
Iterating global reduction 6 with 5 rules applied. Total rules applied 807 place count 203 transition count 311
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 891 place count 161 transition count 266
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 899 place count 161 transition count 258
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 917 place count 152 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 921 place count 152 transition count 332
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 924 place count 152 transition count 329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 925 place count 151 transition count 328
Iterating global reduction 8 with 1 rules applied. Total rules applied 926 place count 151 transition count 328
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 931 place count 151 transition count 323
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 936 place count 146 transition count 323
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 951 place count 146 transition count 323
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 952 place count 145 transition count 321
Iterating global reduction 9 with 1 rules applied. Total rules applied 953 place count 145 transition count 321
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 954 place count 144 transition count 320
Iterating global reduction 9 with 1 rules applied. Total rules applied 955 place count 144 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 956 place count 144 transition count 319
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 957 place count 144 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 958 place count 143 transition count 318
Applied a total of 958 rules in 187 ms. Remains 143 /624 variables (removed 481) and now considering 318/828 (removed 510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 143/624 places, 318/828 transitions.
RANDOM walk for 40000 steps (1694 resets) in 542 ms. (73 steps per ms) remains 3/4 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (314 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (304 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (304 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
[2024-05-23 19:21:33] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
// Phase 1: matrix 313 rows 143 cols
[2024-05-23 19:21:33] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:21:33] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/143 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 313/456 variables, 143/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 143/143 constraints, ReadFeed: 3/3 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/143 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:21:34] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 313/456 variables, 143/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 143/143 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1622ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 524 ms.
Support contains 23 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 318/318 transitions.
Graph (trivial) has 67 edges and 143 vertex of which 6 / 143 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 503 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 139 transition count 305
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 133 transition count 301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 129 transition count 301
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 129 transition count 299
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 127 transition count 299
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 31 place count 122 transition count 290
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 122 transition count 290
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 52 place count 114 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 57 place count 114 transition count 277
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 65 place count 110 transition count 283
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 68 place count 107 transition count 271
Iterating global reduction 4 with 3 rules applied. Total rules applied 71 place count 107 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 107 transition count 270
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 75 place count 104 transition count 263
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 104 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 104 transition count 261
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 91 place count 104 transition count 250
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 103 place count 93 transition count 249
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 107 place count 93 transition count 249
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 108 place count 92 transition count 244
Iterating global reduction 7 with 1 rules applied. Total rules applied 109 place count 92 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 112 place count 92 transition count 241
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 113 place count 91 transition count 240
Iterating global reduction 8 with 1 rules applied. Total rules applied 114 place count 91 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 115 place count 91 transition count 239
Applied a total of 115 rules in 47 ms. Remains 91 /143 variables (removed 52) and now considering 239/318 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 91/143 places, 239/318 transitions.
RANDOM walk for 40000 steps (79 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (22 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (38 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 962543 steps, run visited all 2 properties in 1955 ms. (steps per millisecond=492 )
Probabilistic random walk after 962543 steps, saw 205815 distinct states, run finished after 1959 ms. (steps per millisecond=491 ) properties seen :2
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12690 ms.
ITS solved all properties within timeout
BK_STOP 1716492098174
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-17"
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-17, 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-171640602400831"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-17.tgz
mv HealthRecord-PT-17 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 '
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 ;