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.r188-tall-171640616900513.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-16, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616900513
=====================================================================

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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716476097186

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:54:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:54:58] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-23 14:54:58] [INFO ] Transformed 453 places.
[2024-05-23 14:54:58] [INFO ] Transformed 594 transitions.
[2024-05-23 14:54:58] [INFO ] Found NUPN structural information;
[2024-05-23 14:54:58] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 192 ms.
Graph (trivial) has 535 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 5 ms
Free SCC test removed 32 places
Structural test allowed to assert that 201 places are NOT stable. Took 30 ms.
Ensure Unique test removed 35 transitions
Reduce redundant transitions removed 35 transitions.
RANDOM walk for 40000 steps (402 resets) in 2096 ms. (19 steps per ms) remains 206/252 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 34 ms. (11 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 206/206 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 206/206 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 206/206 properties
[2024-05-23 14:54:59] [INFO ] Flow matrix only has 543 transitions (discarded 16 similar events)
// Phase 1: matrix 543 rows 421 cols
[2024-05-23 14:54:59] [INFO ] Computed 14 invariants in 14 ms
[2024-05-23 14:54:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 61/267 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 61/275 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 154/421 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 154/435 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/964 variables, and 435 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5057 ms.
Refiners :[Domain max(s): 421/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 61/267 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 61/275 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-23 14:55:05] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 18 ms to minimize.
[2024-05-23 14:55:05] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:55:05] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 2 ms to minimize.
[2024-05-23 14:55:05] [INFO ] Deduced a trap composed of 108 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:55:05] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 2 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 107 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:06] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:55:07] [INFO ] Deduced a trap composed of 107 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:07] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:55:07] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:55:07] [INFO ] Deduced a trap composed of 105 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:55:07] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 19/294 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:55:08] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:55:09] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:55:09] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/964 variables, and 300 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5015 ms.
Refiners :[Domain max(s): 267/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/206 constraints, Known Traps: 25/25 constraints]
After SMT, in 10181ms problems are : Problem set: 0 solved, 206 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 559/559 transitions.
Graph (complete) has 820 edges and 421 vertex of which 414 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 414 transition count 421
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 137 rules applied. Total rules applied 269 place count 293 transition count 405
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 277 place count 285 transition count 405
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 277 place count 285 transition count 396
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 295 place count 276 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 297 place count 274 transition count 393
Iterating global reduction 3 with 2 rules applied. Total rules applied 299 place count 274 transition count 393
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 329 place count 259 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 259 transition count 377
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 342 place count 253 transition count 427
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 355 place count 253 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 364 place count 253 transition count 405
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 373 place count 253 transition count 396
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 382 place count 244 transition count 396
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 397 place count 244 transition count 396
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 401 place count 244 transition count 396
Applied a total of 401 rules in 93 ms. Remains 244 /421 variables (removed 177) and now considering 396/559 (removed 163) transitions.
Running 380 sub problems to find dead transitions.
// Phase 1: matrix 396 rows 244 cols
[2024-05-23 14:55:09] [INFO ] Computed 7 invariants in 4 ms
[2024-05-23 14:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 2/244 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Problem TDEAD385 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 4 (OVERLAPS) 396/640 variables, 244/251 constraints. Problems are: Problem set: 5 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 1/252 constraints. Problems are: Problem set: 5 solved, 375 unsolved
[2024-05-23 14:55:16] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-23 14:55:16] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:55:17] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:55:18] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:55:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 2 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 3 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:19] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 3 ms to minimize.
[2024-05-23 14:55:20] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:55:20] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 14/266 constraints. Problems are: Problem set: 6 solved, 374 unsolved
[2024-05-23 14:55:23] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:55:26] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:55:26] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:26] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:55:26] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:55:26] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 6/272 constraints. Problems are: Problem set: 6 solved, 374 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 272 constraints, problems are : Problem set: 6 solved, 374 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 244/244 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 6 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 2/243 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 8/9 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 6/15 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 12/27 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 396/640 variables, 244/271 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 1/272 constraints. Problems are: Problem set: 6 solved, 374 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 374/646 constraints. Problems are: Problem set: 6 solved, 374 unsolved
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:36] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 2 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:55:37] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 4 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:55:38] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:55:40] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-23 14:55:40] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:55:40] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:55:41] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:55:42] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:55:42] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 20/666 constraints. Problems are: Problem set: 6 solved, 374 unsolved
[2024-05-23 14:55:45] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:55:45] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:55:46] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:55:49] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 672 constraints, problems are : Problem set: 6 solved, 374 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 244/244 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 374/380 constraints, Known Traps: 46/46 constraints]
After SMT, in 40162ms problems are : Problem set: 6 solved, 374 unsolved
Search for dead transitions found 6 dead transitions in 40168ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/421 places, 390/559 transitions.
Graph (complete) has 585 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 388
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 241 transition count 388
Applied a total of 9 rules in 21 ms. Remains 241 /244 variables (removed 3) and now considering 388/390 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40305 ms. Remains : 241/421 places, 388/559 transitions.
RANDOM walk for 4000000 steps (391699 resets) in 21806 ms. (183 steps per ms) remains 12/206 properties
BEST_FIRST walk for 4000004 steps (66332 resets) in 2710 ms. (1475 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66303 resets) in 2699 ms. (1481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66479 resets) in 2703 ms. (1479 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66427 resets) in 2683 ms. (1490 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66293 resets) in 2709 ms. (1476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66397 resets) in 2687 ms. (1488 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66301 resets) in 2691 ms. (1485 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66374 resets) in 2665 ms. (1500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (66305 resets) in 4501 ms. (888 steps per ms) remains 9/12 properties
BEST_FIRST walk for 4000003 steps (66282 resets) in 2430 ms. (1645 steps per ms) remains 9/9 properties
// Phase 1: matrix 388 rows 241 cols
[2024-05-23 14:56:04] [INFO ] Computed 7 invariants in 2 ms
[2024-05-23 14:56:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 162/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 304/475 variables, 171/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 123/598 variables, 45/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 30/628 variables, 24/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/629 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/629 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 249 constraints, problems are : Problem set: 0 solved, 9 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 241/241 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 162/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 304/475 variables, 171/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 9/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 123/598 variables, 45/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 30/628 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/629 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/629 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 258 constraints, problems are : Problem set: 0 solved, 9 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 241/241 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 254 ms.
Support contains 9 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 388/388 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 241 transition count 260
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 108 rules applied. Total rules applied 236 place count 146 transition count 247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 240 place count 142 transition count 247
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 240 place count 142 transition count 234
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 266 place count 129 transition count 234
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 315 place count 80 transition count 129
Iterating global reduction 3 with 49 rules applied. Total rules applied 364 place count 80 transition count 129
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 374 place count 70 transition count 119
Iterating global reduction 3 with 10 rules applied. Total rules applied 384 place count 70 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 388 place count 70 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 391 place count 67 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 394 place count 67 transition count 112
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 397 place count 64 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 400 place count 64 transition count 106
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 403 place count 61 transition count 103
Iterating global reduction 4 with 3 rules applied. Total rules applied 406 place count 61 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 409 place count 61 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 419 place count 56 transition count 95
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 435 place count 48 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 437 place count 48 transition count 141
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 438 place count 48 transition count 141
Applied a total of 438 rules in 33 ms. Remains 48 /241 variables (removed 193) and now considering 141/388 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 48/241 places, 141/388 transitions.
RANDOM walk for 2159608 steps (462496 resets) in 17008 ms. (126 steps per ms) remains 0/9 properties
Able to resolve query StableMarking after proving 254 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 75264 ms.
ITS solved all properties within timeout

BK_STOP 1716476173641

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -timeout 180 -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="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-16, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-tall-171640616900513"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;