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.r553-tall-171734901300295.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 FireWire-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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 FireWire-PT-16-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717357070163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:37:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:37:51] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 19:37:51] [INFO ] Transformed 254 places.
[2024-06-02 19:37:51] [INFO ] Transformed 368 transitions.
[2024-06-02 19:37:51] [INFO ] Found NUPN structural information;
[2024-06-02 19:37:51] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-16-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (10 resets) in 1454 ms. (27 steps per ms) remains 13/15 properties
FORMULA FireWire-PT-16-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (12 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 458 ms. (87 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (9 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (11 resets) in 355 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (9 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 12/13 properties
FORMULA FireWire-PT-16-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
// Phase 1: matrix 368 rows 254 cols
[2024-06-02 19:37:53] [INFO ] Computed 5 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 104/254 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 104/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 368/622 variables, 254/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/622 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 513 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1028 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FireWire-PT-16-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-16-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-16-ReachabilityFireability-2024-06 is UNSAT
FORMULA FireWire-PT-16-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-16-ReachabilityFireability-2024-14 is UNSAT
FORMULA FireWire-PT-16-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-16-ReachabilityFireability-2024-15 is UNSAT
FORMULA FireWire-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 104/254 variables, 5/155 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 104/259 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 19:37:54] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 15 ms to minimize.
[2024-06-02 19:37:55] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:37:55] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:37:55] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 4/263 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 19:37:55] [INFO ] Deduced a trap composed of 124 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/264 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/264 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 368/622 variables, 254/518 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 8/526 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:37:57] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:37:58] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:37:58] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:37:58] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 6/532 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 0/532 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 532 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5011 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 11/11 constraints]
After SMT, in 6255ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 368/368 transitions.
Graph (complete) has 601 edges and 254 vertex of which 251 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 251 transition count 357
Reduce places removed 11 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 240 transition count 342
Reduce places removed 15 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 17 rules applied. Total rules applied 55 place count 225 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 224 transition count 340
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 56 place count 224 transition count 334
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 68 place count 218 transition count 334
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 91 place count 195 transition count 311
Iterating global reduction 4 with 23 rules applied. Total rules applied 114 place count 195 transition count 311
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 132 place count 186 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 184 transition count 317
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 184 transition count 312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 146 place count 179 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 179 transition count 312
Applied a total of 148 rules in 87 ms. Remains 179 /254 variables (removed 75) and now considering 312/368 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 179/254 places, 312/368 transitions.
RANDOM walk for 40000 steps (10 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (10 resets) in 442 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (10 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (11 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (9 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 78 ms. (506 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-16-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (12 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
// Phase 1: matrix 312 rows 179 cols
[2024-06-02 19:38:00] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 311/483 variables, 172/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/491 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/491 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 184 constraints, problems are : Problem set: 0 solved, 7 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:38:01] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:38:01] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:38:01] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:38:01] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 311/483 variables, 172/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/491 variables, 7/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:38:02] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:38:02] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/491 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 2804ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 5774 ms.
Support contains 106 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 312/312 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 310
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 177 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 176 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 176 transition count 307
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 174 transition count 307
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 14 place count 170 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 170 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 169 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 169 transition count 301
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 169 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 168 transition count 300
Applied a total of 24 rules in 35 ms. Remains 168 /179 variables (removed 11) and now considering 300/312 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 168/179 places, 300/312 transitions.
RANDOM walk for 40000 steps (9 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 117 ms. (338 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 806410 steps, run visited all 7 properties in 1639 ms. (steps per millisecond=492 )
Probabilistic random walk after 806410 steps, saw 184225 distinct states, run finished after 1644 ms. (steps per millisecond=490 ) properties seen :7
FORMULA FireWire-PT-16-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 19829 ms.
ITS solved all properties within timeout

BK_STOP 1717357091202

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-16"
export BK_EXAMINATION="ReachabilityFireability"
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 FireWire-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;