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-171734921200086.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-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 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 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 160K 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717356784860

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:33:07] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-06-02 19:33:07] [INFO ] Transformed 150 places.
[2024-06-02 19:33:07] [INFO ] Transformed 478 transitions.
[2024-06-02 19:33:07] [INFO ] Found NUPN structural information;
[2024-06-02 19:33:07] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (3113 resets) in 3330 ms. (12 steps per ms) remains 8/10 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (545 resets) in 477 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (606 resets) in 730 ms. (54 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (619 resets) in 409 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (548 resets) in 667 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (546 resets) in 1638 ms. (24 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (542 resets) in 138 ms. (287 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (536 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
[2024-06-02 19:33:10] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 19:33:10] [INFO ] Computed 23 invariants in 28 ms
[2024-06-02 19:33:10] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 39/109 variables, 9/79 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 39/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 37/146 variables, 14/132 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 37/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 394/540 variables, 146/315 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 171/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 7/547 variables, 4/490 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 4/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1302 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 53/72 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 53/78 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/81 variables, 3/81 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 9/90 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 65/146 variables, 14/104 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 65/169 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 19:33:12] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 49 ms to minimize.
[2024-06-02 19:33:13] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-02 19:33:13] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 3 ms to minimize.
[2024-06-02 19:33:13] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 2 ms to minimize.
[2024-06-02 19:33:13] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 3 ms to minimize.
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 9/178 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 4 ms to minimize.
[2024-06-02 19:33:14] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-06-02 19:33:15] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 3/181 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 394/540 variables, 146/327 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 171/498 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 3/501 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 19:33:16] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:33:16] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:33:16] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2024-06-02 19:33:17] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 6668ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 115 transition count 418
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 115 transition count 418
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 72 place count 108 transition count 379
Iterating global reduction 0 with 7 rules applied. Total rules applied 79 place count 108 transition count 379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 82 place count 105 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 85 place count 105 transition count 367
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 91 place count 102 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 108 place count 102 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 101 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 100 transition count 380
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 100 transition count 439
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 145 place count 90 transition count 426
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 90 transition count 426
Applied a total of 147 rules in 285 ms. Remains 90 /150 variables (removed 60) and now considering 426/469 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 90/150 places, 426/469 transitions.
RANDOM walk for 40000 steps (4811 resets) in 1385 ms. (28 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (1123 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 360 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1109 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
[2024-06-02 19:33:18] [INFO ] Flow matrix only has 354 transitions (discarded 72 similar events)
// Phase 1: matrix 354 rows 90 cols
[2024-06-02 19:33:18] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 19:33:18] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/53 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/89 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 354/443 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 189/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/444 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/53 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/89 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 354/443 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 189/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/444 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:33:19] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:33:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:33:22] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-02 19:33:22] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/444 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/444 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 309 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 5094ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 172 steps, including 6 resets, run visited all 3 properties in 5 ms. (steps per millisecond=34 )
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 15 ms.
All properties solved without resorting to model-checking.
Total runtime 15970 ms.
ITS solved all properties within timeout

BK_STOP 1717356803445

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

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