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.r575-smll-171734919700126.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 MedleyA-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717366010954

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:06:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:06:53] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2024-06-02 22:06:53] [INFO ] Transformed 196 places.
[2024-06-02 22:06:53] [INFO ] Transformed 392 transitions.
[2024-06-02 22:06:53] [INFO ] Found NUPN structural information;
[2024-06-02 22:06:53] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3232 ms. (12 steps per ms) remains 13/14 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 729 ms. (54 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 575 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 480 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1637 ms. (24 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
// Phase 1: matrix 390 rows 196 cols
[2024-06-02 22:06:56] [INFO ] Computed 7 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 71/196 variables, 7/132 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 71/203 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 390/586 variables, 196/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 399 constraints, problems are : Problem set: 2 solved, 10 unsolved in 1751 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 90/196 variables, 7/113 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 90/203 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 22:06:59] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 40 ms to minimize.
[2024-06-02 22:06:59] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 4 ms to minimize.
[2024-06-02 22:06:59] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-06-02 22:07:00] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:07:00] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 5/208 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 22:07:00] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:07:00] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/210 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 390/586 variables, 196/406 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 8/414 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 22:07:01] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 1/415 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 22:07:03] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/416 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/416 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 416 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5014 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 9/9 constraints]
After SMT, in 7004ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 91 edges and 196 vertex of which 5 / 196 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 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 0 with 9 rules applied. Total rules applied 10 place count 192 transition count 376
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 183 transition count 374
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 182 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 180 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 26 place count 180 transition count 370
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 178 transition count 370
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 43 place count 165 transition count 348
Iterating global reduction 4 with 13 rules applied. Total rules applied 56 place count 165 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 165 transition count 346
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 163 transition count 346
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 74 place count 156 transition count 339
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 156 transition count 338
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 95 place count 146 transition count 387
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 97 place count 146 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 136 place count 146 transition count 346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 145 transition count 357
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 147 place count 145 transition count 348
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 156 place count 136 transition count 348
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 157 place count 136 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 158 place count 135 transition count 347
Applied a total of 158 rules in 245 ms. Remains 135 /196 variables (removed 61) and now considering 347/390 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 135/196 places, 347/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 763 ms. (52 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 576 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
[2024-06-02 22:07:05] [INFO ] Flow matrix only has 339 transitions (discarded 8 similar events)
// Phase 1: matrix 339 rows 135 cols
[2024-06-02 22:07:05] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:07:05] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:07:05] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:07:05] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-02 22:07:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 339/474 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 56/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 201 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 73/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:07:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/135 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 339/474 variables, 135/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 56/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/474 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 18801 steps, including 510 resets, run visited all 1 properties in 41 ms. (steps per millisecond=458 )
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1068 ms.
All properties solved without resorting to model-checking.
Total runtime 15345 ms.
ITS solved all properties within timeout

BK_STOP 1717366028699

--------------------
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 ReachabilityCardinality -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="MedleyA-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
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 MedleyA-PT-16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;