fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734901100199
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
371.447 10534.00 25780.00 131.60 TTTFTTTTFTTTTTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353881117

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:44:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:44:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:44:42] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:44:42] [INFO ] Transformed 113 places.
[2024-06-02 18:44:42] [INFO ] Transformed 364 transitions.
[2024-06-02 18:44:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:44:42] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (2202 resets) in 2238 ms. (17 steps per ms) remains 12/15 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 418 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (933 resets) in 332 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (621 resets) in 540 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (16 resets) in 440 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1099 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (19 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1090 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1515 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (550 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (216 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
[2024-06-02 18:44:44] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 18:44:44] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 18:44:44] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FireWire-PT-04-ReachabilityFireability-2024-03 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 29/112 variables, 8/91 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 29/120 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 275/387 variables, 112/232 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/271 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 274 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1402 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem FireWire-PT-04-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-04-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-04-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 34/112 variables, 8/86 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 34/120 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-02 18:44:45] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 18 ms to minimize.
[2024-06-02 18:44:46] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/122 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 275/387 variables, 112/234 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 39/273 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/279 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/280 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/281 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 3/284 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/389 variables, 1/285 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 285 constraints, problems are : Problem set: 3 solved, 9 unsolved in 2138 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 3788ms problems are : Problem set: 3 solved, 9 unsolved
FORMULA FireWire-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 2652 ms.
Support contains 23 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 112 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 111 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 110 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 110 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 107 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 107 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 107 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 107 transition count 294
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 33 place count 106 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 105 transition count 292
Applied a total of 34 rules in 101 ms. Remains 105 /113 variables (removed 8) and now considering 292/308 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 105/113 places, 292/308 transitions.
RANDOM walk for 40000 steps (2511 resets) in 262 ms. (152 steps per ms) remains 3/4 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1500 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (255 resets) in 77 ms. (512 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 18:44:50] [INFO ] Flow matrix only has 264 transitions (discarded 28 similar events)
// Phase 1: matrix 264 rows 105 cols
[2024-06-02 18:44:50] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:44:50] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 263/361 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/368 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 263/361 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:44:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/368 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/369 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 156 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 292/292 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/105 places, 292/292 transitions.
RANDOM walk for 40000 steps (2544 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1465 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1776 steps, run visited all 2 properties in 20 ms. (steps per millisecond=88 )
Probabilistic random walk after 1776 steps, saw 1004 distinct states, run finished after 23 ms. (steps per millisecond=77 ) properties seen :2
FORMULA FireWire-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-04-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9384 ms.
ITS solved all properties within timeout

BK_STOP 1717353891651

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

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