Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399200279.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V80P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399200279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 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 BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717221844860

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:04:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:04:07] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-06-01 06:04:07] [INFO ] Transformed 188 places.
[2024-06-01 06:04:07] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:04:07] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 154 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (56 resets) in 4906 ms. (8 steps per ms) remains 8/13 properties
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 4211 ms. (9 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 4297 ms. (9 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 483 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (20 resets) in 564 ms. (70 steps per ms) remains 7/8 properties
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 1170 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 527 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (20 resets) in 439 ms. (90 steps per ms) remains 7/7 properties
[2024-06-01 06:04:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 06:04:12] [INFO ] Computed 7 invariants in 33 ms
[2024-06-01 06:04:13] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/188 variables, 3/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/188 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 3/220 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/220 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 220 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 9495ms problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 179 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 560 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 06:04:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:04:23] [INFO ] Computed 5 invariants in 17 ms
[2024-06-01 06:04:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:04:51] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 55465ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56176 ms. Remains : 186/188 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 845 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 5222 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (20 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 563692 steps, run timeout after 6001 ms. (steps per millisecond=93 ) properties seen :1 out of 3
Probabilistic random walk after 563692 steps, saw 153203 distinct states, run finished after 6004 ms. (steps per millisecond=93 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 06:05:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:05:26] [INFO ] Invariant cache hit.
[2024-06-01 06:05:26] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/556 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 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/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/556 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 13469ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 582 ms.
Support contains 179 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 353 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 186/186 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 853 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 3847 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 198771 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 198771 steps, saw 55368 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-06-01 06:05:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:05:45] [INFO ] Invariant cache hit.
[2024-06-01 06:05:45] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/556 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 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/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/556 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 11646ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 569 ms.
Support contains 179 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 179 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 176 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-06-01 06:05:58] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:05:58] [INFO ] Invariant cache hit.
[2024-06-01 06:05:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:05:58] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:05:58] [INFO ] Invariant cache hit.
[2024-06-01 06:05:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:05:58] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 429 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 158 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 763 ms. Remains : 185/186 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 970 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (20 resets) in 5424 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (20 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 352894 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 352894 steps, saw 96408 distinct states, run finished after 6001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 06:06:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-06-01 06:06:07] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 06:06:07] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/184 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 370/554 variables, 184/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12948 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 15036ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1943 ms.
Support contains 179 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 151 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 185/185 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 162 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-06-01 06:06:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:06:24] [INFO ] Invariant cache hit.
[2024-06-01 06:06:24] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 06:06:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:06:24] [INFO ] Invariant cache hit.
[2024-06-01 06:06:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:06:24] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-01 06:06:24] [INFO ] Redundant transitions in 118 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-06-01 06:06:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 06:06:24] [INFO ] Invariant cache hit.
[2024-06-01 06:06:24] [INFO ] State equation strengthened by 22 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-15

BK_STOP 1717222029975

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_0_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_1_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_2_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_3_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/595/inv_4_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_5_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/595/inv_6_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_7_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_8_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_9_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_10_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/595/inv_11_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/595/inv_12_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_13_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/595/inv_14_
rfs formula name BridgeAndVehicles-PT-V80P20N10-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/595/inv_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="BridgeAndVehicles-PT-V80P20N10"
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 BridgeAndVehicles-PT-V80P20N10, 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 r472-tajo-171620399200279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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