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.r476-tall-171620505200111.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 CANInsertWithFailure-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 CANInsertWithFailure-PT-020-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717187227068

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:27:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:27:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:27:08] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-31 20:27:08] [INFO ] Transformed 1044 places.
[2024-05-31 20:27:08] [INFO ] Transformed 2520 transitions.
[2024-05-31 20:27:08] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (81 resets) in 2110 ms. (18 steps per ms) remains 3/16 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
// Phase 1: matrix 2520 rows 1044 cols
[2024-05-31 20:27:09] [INFO ] Computed 23 invariants in 75 ms
[2024-05-31 20:27:09] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 929/1032 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/1040 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/1042 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:27:11] [INFO ] Deduced a trap composed of 22 places in 461 ms of which 47 ms to minimize.
[2024-05-31 20:27:11] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2520/3562 variables, 1042/1066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3562 variables, 780/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3562 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3564 variables, 2/1848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3564 variables, 1/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3564 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3564 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3564/3564 variables, and 1849 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3430 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1044/1044 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 929/1032 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:27:13] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/1040 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1042 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:27:14] [INFO ] Deduced a trap composed of 56 places in 353 ms of which 5 ms to minimize.
[2024-05-31 20:27:14] [INFO ] Deduced a trap composed of 43 places in 365 ms of which 6 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 5 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 5 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 40 places in 366 ms of which 6 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 52 places in 338 ms of which 5 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 5 ms to minimize.
[2024-05-31 20:27:17] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 5 ms to minimize.
[2024-05-31 20:27:17] [INFO ] Deduced a trap composed of 55 places in 315 ms of which 5 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 5 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 43 places in 347 ms of which 5 ms to minimize.
SMT process timed out in 8744ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 1043 transition count 2437
Reduce places removed 83 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 960 transition count 2414
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 213 place count 937 transition count 2414
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 213 place count 937 transition count 2404
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 233 place count 927 transition count 2404
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 2 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 827 place count 630 transition count 2107
Drop transitions (Redundant composition of simpler transitions.) removed 276 transitions
Redundant transition composition rules discarded 276 transitions
Iterating global reduction 3 with 276 rules applied. Total rules applied 1103 place count 630 transition count 1831
Partial Free-agglomeration rule applied 460 times.
Drop transitions (Partial Free agglomeration) removed 460 transitions
Iterating global reduction 3 with 460 rules applied. Total rules applied 1563 place count 630 transition count 1831
Partial Free-agglomeration rule applied 240 times.
Drop transitions (Partial Free agglomeration) removed 240 transitions
Iterating global reduction 3 with 240 rules applied. Total rules applied 1803 place count 630 transition count 1831
Applied a total of 1803 rules in 376 ms. Remains 630 /1044 variables (removed 414) and now considering 1831/2520 (removed 689) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 630/1044 places, 1831/2520 transitions.
RANDOM walk for 40000 steps (294 resets) in 459 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 195 ms. (204 steps per ms) remains 2/3 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1831 rows 630 cols
[2024-05-31 20:27:19] [INFO ] Computed 22 invariants in 36 ms
[2024-05-31 20:27:19] [INFO ] State equation strengthened by 1417 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 549/611 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:27:19] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:27:19] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/627 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/628 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1831/2459 variables, 628/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2459 variables, 1417/2069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2459 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/2461 variables, 2/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2461 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2461 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2461/2461 variables, and 2071 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 630/630 constraints, ReadFeed: 1417/1417 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 549/611 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/627 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1831/2459 variables, 628/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2459 variables, 1417/2077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2459 variables, 2/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2459 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2461 variables, 2/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2461 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2461 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2461/2461 variables, and 2081 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2927 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 630/630 constraints, ReadFeed: 1417/1417 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 4423ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 494 ms.
Support contains 62 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1831/1831 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 630 transition count 1824
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 623 transition count 1824
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 62 place count 599 transition count 1800
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 599 transition count 1799
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 599 transition count 1789
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 589 transition count 1789
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 3 with 61 rules applied. Total rules applied 144 place count 589 transition count 1789
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 194 place count 589 transition count 1789
Applied a total of 194 rules in 157 ms. Remains 589 /630 variables (removed 41) and now considering 1789/1831 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 589/630 places, 1789/1831 transitions.
RANDOM walk for 40000 steps (343 resets) in 367 ms. (108 steps per ms) remains 1/2 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
// Phase 1: matrix 1789 rows 589 cols
[2024-05-31 20:27:24] [INFO ] Computed 22 invariants in 18 ms
[2024-05-31 20:27:24] [INFO ] State equation strengthened by 1574 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 539/560 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/586 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/587 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1789/2376 variables, 587/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2376 variables, 1574/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2376 variables, 0/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/2378 variables, 2/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2378 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2378 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2378/2378 variables, and 2185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 589/589 constraints, ReadFeed: 1574/1574 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 539/560 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:27:25] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/586 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/587 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1789/2376 variables, 587/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2376 variables, 1574/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2376 variables, 1/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2376 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/2378 variables, 2/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2378 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2378 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2378/2378 variables, and 2187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 589/589 constraints, ReadFeed: 1574/1574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1882ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 21 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1789/1789 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 568 transition count 1768
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 568 transition count 1767
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 61 place count 568 transition count 1767
Applied a total of 61 rules in 80 ms. Remains 568 /589 variables (removed 21) and now considering 1767/1789 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 568/589 places, 1767/1789 transitions.
RANDOM walk for 35971 steps (320 resets) in 272 ms. (131 steps per ms) remains 0/1 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18294 ms.
ITS solved all properties within timeout

BK_STOP 1717187246544

--------------------
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="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, 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 r476-tall-171620505200111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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