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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717361414671

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:50:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:50:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:50:17] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-02 20:50:17] [INFO ] Transformed 252 places.
[2024-06-02 20:50:17] [INFO ] Transformed 543 transitions.
[2024-06-02 20:50:17] [INFO ] Found NUPN structural information;
[2024-06-02 20:50:17] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1533 resets) in 4295 ms. (9 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (354 resets) in 486 ms. (82 steps per ms) remains 11/12 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (437 resets) in 1617 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (355 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (353 resets) in 1377 ms. (29 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (353 resets) in 448 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (352 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (345 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (355 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (366 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (352 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (366 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
// Phase 1: matrix 541 rows 252 cols
[2024-06-02 20:50:20] [INFO ] Computed 7 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-18-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 121/252 variables, 7/138 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 121/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1760 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem MedleyA-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 154/252 variables, 7/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 154/259 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 20:50:23] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 40 ms to minimize.
[2024-06-02 20:50:23] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 5 ms to minimize.
[2024-06-02 20:50:24] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 4 ms to minimize.
[2024-06-02 20:50:24] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 11 ms to minimize.
[2024-06-02 20:50:24] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 3 ms to minimize.
[2024-06-02 20:50:24] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 5 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 4 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 17 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 4 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 5 ms to minimize.
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 47 places in 335 ms of which 5 ms to minimize.
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:50:27] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-06-02 20:50:27] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:50:27] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:50:27] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
SMT process timed out in 7273ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 205 edges and 252 vertex of which 5 / 252 are part of one of the 1 SCC in 6 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 248 transition count 505
Reduce places removed 31 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 41 rules applied. Total rules applied 73 place count 217 transition count 495
Reduce places removed 10 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 2 with 12 rules applied. Total rules applied 85 place count 207 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 206 transition count 493
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 86 place count 206 transition count 488
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 201 transition count 488
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 125 place count 172 transition count 437
Iterating global reduction 4 with 29 rules applied. Total rules applied 154 place count 172 transition count 437
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 4 with 2 rules applied. Total rules applied 156 place count 172 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 171 transition count 435
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 157 place count 171 transition count 432
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 163 place count 168 transition count 432
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 165 place count 166 transition count 414
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 166 transition count 414
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 165 transition count 412
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 165 transition count 412
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 201 place count 149 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 203 place count 149 transition count 394
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 235 place count 133 transition count 453
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 238 place count 133 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 261 place count 133 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 267 place count 130 transition count 424
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 286 place count 130 transition count 405
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 307 place count 111 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 313 place count 111 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 314 place count 110 transition count 396
Applied a total of 314 rules in 396 ms. Remains 110 /252 variables (removed 142) and now considering 396/541 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 110/252 places, 396/541 transitions.
RANDOM walk for 40000 steps (3766 resets) in 1090 ms. (36 steps per ms) remains 3/9 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (1250 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1160 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1316 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2024-06-02 20:50:28] [INFO ] Flow matrix only has 388 transitions (discarded 8 similar events)
// Phase 1: matrix 388 rows 110 cols
[2024-06-02 20:50:28] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:50:28] [INFO ] State equation strengthened by 151 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/108 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:50:29] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:50:29] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:50:29] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 388/496 variables, 108/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 151/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/498 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 271 constraints, problems are : Problem set: 0 solved, 3 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/108 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:50:29] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 388/496 variables, 108/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 151/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:50:31] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:50:31] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:50:31] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:50:31] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:50:34] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 10/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:50:34] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:50:34] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:50:41] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/498 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25949 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 108/110 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 26734ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9061 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 396/396 transitions.
Graph (trivial) has 102 edges and 110 vertex of which 4 / 110 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 107 transition count 386
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 386
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 101 transition count 381
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 96 transition count 381
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 33 place count 86 transition count 351
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 86 transition count 351
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 2 with 1 rules applied. Total rules applied 44 place count 86 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 85 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 46 place count 85 transition count 347
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 83 transition count 347
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 72 place count 72 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 72 transition count 335
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 93 place count 62 transition count 378
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 109 place count 62 transition count 362
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 110 place count 61 transition count 358
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 61 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 113 place count 60 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 134 place count 60 transition count 356
Free-agglomeration rule applied 13 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 13 rules applied. Total rules applied 147 place count 60 transition count 341
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 192 place count 47 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 194 place count 46 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 222 place count 46 transition count 292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 224 place count 46 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 226 place count 44 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 227 place count 43 transition count 319
Applied a total of 227 rules in 106 ms. Remains 43 /110 variables (removed 67) and now considering 319/396 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 43/110 places, 319/396 transitions.
RANDOM walk for 709 steps (51 resets) in 31 ms. (22 steps per ms) remains 0/2 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 47802 ms.
ITS solved all properties within timeout

BK_STOP 1717361464838

--------------------
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-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-18, 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 r579-smll-171734921300142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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