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.r524-tall-171679080300439.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 SafeBus-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080300439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 28K Apr 12 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 12 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 961K Apr 12 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 12 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Apr 12 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 488K Apr 12 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 378K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 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 SafeBus-PT-15-ReachabilityFireability-2024-00
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717227749077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:42:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:42:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:42:30] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-06-01 07:42:30] [INFO ] Transformed 621 places.
[2024-06-01 07:42:30] [INFO ] Transformed 4771 transitions.
[2024-06-01 07:42:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:42:30] [INFO ] Parsed PT model containing 621 places and 4771 transitions and 34549 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 15 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 3362 ms. (11 steps per ms) remains 4/16 properties
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 6859 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 975 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
[2024-06-01 07:42:34] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-06-01 07:42:34] [INFO ] Computed 65 invariants in 60 ms
[2024-06-01 07:42:34] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 606/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 32/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-08 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 33/671 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/671 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1412/2018 variables, 606/1277 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2018 variables, 241/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2018 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2018 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2018/2018 variables, and 1518 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2488 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 606/606 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 606/606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-02 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 32/638 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-10 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 33/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1412/2018 variables, 606/1277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2018/2018 variables, and 1518 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2158 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 606/606 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 9523ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 606 transition count 4758
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 593 transition count 4758
Applied a total of 26 rules in 2599 ms. Remains 593 /606 variables (removed 13) and now considering 4758/4771 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2614 ms. Remains : 593/606 places, 4758/4771 transitions.
RANDOM walk for 40000 steps (8 resets) in 825 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 116945 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 116945 steps, saw 72707 distinct states, run finished after 3009 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 07:42:50] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
// Phase 1: matrix 1399 rows 593 cols
[2024-06-01 07:42:50] [INFO ] Computed 65 invariants in 38 ms
[2024-06-01 07:42:50] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 340/368 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 340/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/531 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 163/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/536 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 55/591 variables, 30/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 55/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1398/1989 variables, 591/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1989 variables, 240/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1989 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1992 variables, 2/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1992 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1992 variables, 1/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1992 variables, 1/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1992 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1992 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1992/1992 variables, and 1492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 593/593 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 340/368 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 340/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/531 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 163/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/536 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 55/591 variables, 30/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 55/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 101 places in 478 ms of which 31 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 100 places in 406 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1398/1989 variables, 591/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1989 variables, 240/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1989 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/1992 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1992 variables, 2/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1992 variables, 1/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1992 variables, 1/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1992 variables, 1/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1992 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1992 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1992/1992 variables, and 1495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5340 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 593/593 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 6269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2994 ms.
Support contains 28 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1131 ms. Remains 593 /593 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 593/593 places, 4758/4758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1069 ms. Remains 593 /593 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
[2024-06-01 07:43:01] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-06-01 07:43:01] [INFO ] Invariant cache hit.
[2024-06-01 07:43:06] [INFO ] Implicit Places using invariants in 4528 ms returned [546, 547, 548, 549, 550, 552, 553, 554, 555, 556, 557, 559, 560]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 4547 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1168 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6787 ms. Remains : 580/593 places, 4758/4758 transitions.
RANDOM walk for 40000 steps (8 resets) in 879 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 132708 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 132708 steps, saw 82355 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 07:43:10] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
// Phase 1: matrix 1399 rows 580 cols
[2024-06-01 07:43:10] [INFO ] Computed 52 invariants in 18 ms
[2024-06-01 07:43:10] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 314/342 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 314/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/494 variables, 32/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 152/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/578 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 84/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1398/1976 variables, 578/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1976 variables, 240/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1976 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1979 variables, 2/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1979 variables, 2/1451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1979 variables, 1/1452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1979 variables, 1/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1979 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1979 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1979/1979 variables, and 1453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 580/580 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 314/342 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 314/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/494 variables, 32/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 152/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/578 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 84/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 74 places in 602 ms of which 4 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 74 places in 591 ms of which 3 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 74 places in 609 ms of which 4 ms to minimize.
[2024-06-01 07:43:14] [INFO ] Deduced a trap composed of 74 places in 599 ms of which 3 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 74 places in 619 ms of which 4 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 61 places in 596 ms of which 4 ms to minimize.
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 74 places in 577 ms of which 3 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 74 places in 553 ms of which 4 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 74 places in 554 ms of which 4 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 74 places in 556 ms of which 4 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 74 places in 599 ms of which 3 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 61 places in 609 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 12/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1398/1976 variables, 578/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1976 variables, 240/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1976 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1979 variables, 2/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1979 variables, 2/1463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1979 variables, 1/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1979 variables, 1/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1979 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:22] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1979 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1979 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1979 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1979/1979 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11222 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 580/580 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 12337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 329 ms.
Support contains 28 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 4758/4758 transitions.
Applied a total of 0 rules in 1001 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1002 ms. Remains : 580/580 places, 4758/4758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 4758/4758 transitions.
Applied a total of 0 rules in 928 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
[2024-06-01 07:43:25] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-06-01 07:43:25] [INFO ] Invariant cache hit.
[2024-06-01 07:43:29] [INFO ] Implicit Places using invariants in 4344 ms returned []
[2024-06-01 07:43:29] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-06-01 07:43:29] [INFO ] Invariant cache hit.
[2024-06-01 07:43:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:43:37] [INFO ] Implicit Places using invariants and state equation in 7595 ms returned []
Implicit Place search using SMT with State Equation took 11952 ms to find 0 implicit places.
[2024-06-01 07:43:37] [INFO ] Redundant transitions in 332 ms returned []
Running 4743 sub problems to find dead transitions.
[2024-06-01 07:43:37] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-06-01 07:43:37] [INFO ] Invariant cache hit.
[2024-06-01 07:43:37] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 580/580 constraints. Problems are: Problem set: 0 solved, 4743 unsolved
SMT process timed out in 59145ms, After SMT, problems are : Problem set: 0 solved, 4743 unsolved
Search for dead transitions found 0 dead transitions in 59194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72449 ms. Remains : 580/580 places, 4758/4758 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3359 transitions
Reduce isomorphic transitions removed 3359 transitions.
Iterating post reduction 0 with 3359 rules applied. Total rules applied 3359 place count 580 transition count 1399
Discarding 192 places :
Symmetric choice reduction at 1 with 192 rule applications. Total rules 3551 place count 388 transition count 1207
Iterating global reduction 1 with 192 rules applied. Total rules applied 3743 place count 388 transition count 1207
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3746 place count 386 transition count 1206
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 3761 place count 386 transition count 1191
Applied a total of 3761 rules in 93 ms. Remains 386 /580 variables (removed 194) and now considering 1191/4758 (removed 3567) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1191 rows 386 cols
[2024-06-01 07:44:37] [INFO ] Computed 51 invariants in 22 ms
[2024-06-01 07:44:37] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:44:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 07:44:37] [INFO ] [Nat]Absence check using 18 positive and 33 generalized place invariants in 17 ms returned sat
[2024-06-01 07:44:37] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:44:38] [INFO ] After 884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:44:38] [INFO ] After 1239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1461 ms.
[2024-06-01 07:44:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 07:44:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 4758 transitions and 33518 arcs took 34 ms.
[2024-06-01 07:44:39] [INFO ] Flatten gal took : 471 ms
Total runtime 128852 ms.
There are residual formulas that ITS could not solve within timeout
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 : SafeBus-PT-15-ReachabilityFireability-2024-12

BK_STOP 1717227879364

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
rfs formula name SafeBus-PT-15-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/609/inv_0_
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="SafeBus-PT-15"
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 SafeBus-PT-15, 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 r524-tall-171679080300439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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