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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 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 72K 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-14-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-14-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716491271108

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:07:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:07:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:07:52] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-23 19:07:52] [INFO ] Transformed 162 places.
[2024-05-23 19:07:52] [INFO ] Transformed 347 transitions.
[2024-05-23 19:07:52] [INFO ] Found NUPN structural information;
[2024-05-23 19:07:52] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
RANDOM walk for 40000 steps (3374 resets) in 2275 ms. (17 steps per ms) remains 10/16 properties
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (392 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (397 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (394 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (386 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (416 resets) in 329 ms. (121 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (384 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (390 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (386 resets) in 31 ms. (1250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (406 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (396 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
[2024-05-23 19:07:53] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
// Phase 1: matrix 306 rows 162 cols
[2024-05-23 19:07:53] [INFO ] Computed 18 invariants in 17 ms
[2024-05-23 19:07:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-14-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-14-ReachabilityFireability-2024-15 is UNSAT
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 30/126 variables, 10/106 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 30/136 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 36/162 variables, 8/144 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 36/180 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 305/467 variables, 162/342 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/468 variables, 1/343 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/468 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 343 constraints, problems are : Problem set: 2 solved, 8 unsolved in 939 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem HealthRecord-PT-14-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 39/118 variables, 10/89 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 39/128 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 12 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 13 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/133 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/136 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/136 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 44/162 variables, 8/144 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 44/188 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
Problem HealthRecord-PT-14-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 14 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 7 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 10/198 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 11/209 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 3/212 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/212 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 305/467 variables, 162/374 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 6/380 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 1/381 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 0/381 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/468 variables, 1/382 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 0/382 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/468 variables, 4/386 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/468 variables, 8/394 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/468 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 394 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5005 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 45/45 constraints]
After SMT, in 6102ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 318/318 transitions.
Graph (trivial) has 40 edges and 162 vertex of which 4 / 162 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 694 edges and 160 vertex of which 151 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 300
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 150 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 149 transition count 298
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 67 place count 89 transition count 178
Iterating global reduction 3 with 60 rules applied. Total rules applied 127 place count 89 transition count 178
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 85 transition count 170
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 85 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 140 place count 85 transition count 165
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 4 with 2 rules applied. Total rules applied 142 place count 84 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 84 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 84 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 144 place count 84 transition count 161
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 146 place count 83 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 83 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 82 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 82 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 82 transition count 160
Applied a total of 150 rules in 70 ms. Remains 82 /162 variables (removed 80) and now considering 160/318 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 82/162 places, 160/318 transitions.
RANDOM walk for 40000 steps (3405 resets) in 710 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (437 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (413 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (411 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (415 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (422 resets) in 69 ms. (571 steps per ms) remains 5/6 properties
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (424 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
[2024-05-23 19:08:00] [INFO ] Flow matrix only has 159 transitions (discarded 1 similar events)
// Phase 1: matrix 159 rows 82 cols
[2024-05-23 19:08:00] [INFO ] Computed 9 invariants in 3 ms
[2024-05-23 19:08:00] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 159/241 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 94 constraints, problems are : Problem set: 0 solved, 5 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 82/82 constraints, ReadFeed: 3/3 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 159/241 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/241 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/241 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 82/82 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1020ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 152 ms.
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 160/160 transitions.
Graph (trivial) has 88 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 330 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 80 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 79 transition count 156
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 29 place count 55 transition count 108
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 55 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 55 transition count 107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 51 transition count 98
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 51 transition count 98
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 48 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 47 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 76 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 80 place count 45 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 90 place count 40 transition count 114
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 95 place count 40 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 100 place count 35 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 35 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 34 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 105 place count 34 transition count 205
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 119 place count 34 transition count 205
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 34 transition count 205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 121 place count 33 transition count 203
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 33 transition count 203
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 124 place count 31 transition count 199
Iterating global reduction 7 with 2 rules applied. Total rules applied 126 place count 31 transition count 199
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 156 place count 31 transition count 169
Applied a total of 156 rules in 59 ms. Remains 31 /82 variables (removed 51) and now considering 169/160 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 31/82 places, 169/160 transitions.
RANDOM walk for 27707 steps (2768 resets) in 737 ms. (37 steps per ms) remains 0/2 properties
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9798 ms.
ITS solved all properties within timeout

BK_STOP 1716491282171

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

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