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.r478-tall-171620515800107.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-100, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r478-tall-171620515800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 60M 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717178789388

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:06:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:06:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:06:31] [INFO ] Load time of PNML (sax parser for PT used): 1227 ms
[2024-05-31 18:06:31] [INFO ] Transformed 21204 places.
[2024-05-31 18:06:32] [INFO ] Transformed 60600 transitions.
[2024-05-31 18:06:32] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1471 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1401 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 72 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21201 place count 10603 transition count 50000
Applied a total of 21201 rules in 7583 ms. Remains 10603 /21204 variables (removed 10601) and now considering 50000/60600 (removed 10600) transitions.
[2024-05-31 18:06:39] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
// Phase 1: matrix 40298 rows 10603 cols
[2024-05-31 18:06:52] [INFO ] Computed 102 invariants in 13078 ms
[2024-05-31 18:07:18] [INFO ] Implicit Places using invariants in 38952 ms returned []
Implicit Place search using SMT only with invariants took 38985 ms to find 0 implicit places.
Running 49900 sub problems to find dead transitions.
[2024-05-31 18:07:19] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-05-31 18:07:19] [INFO ] Invariant cache hit.
[2024-05-31 18:07:19] [INFO ] State equation strengthened by 29898 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 30584 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 49900/49900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 30506 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 0/49900 constraints, Known Traps: 0/0 constraints]
After SMT, in 290235ms problems are : Problem set: 0 solved, 49900 unsolved
Search for dead transitions found 0 dead transitions in 290656ms
Starting structural reductions in LIVENESS mode, iteration 1 : 10603/21204 places, 50000/60600 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 337459 ms. Remains : 10603/21204 places, 50000/60600 transitions.
Discarding 29600 transitions out of 50000. Remains 20400
Initial state reduction rules removed 100 formulas.
RANDOM walk for 40000 steps (78 resets) in 6669 ms. (5 steps per ms) remains 7476/20300 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 23 ms. (5 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 7476/7476 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 7476/7476 properties
[2024-05-31 18:12:12] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-05-31 18:12:12] [INFO ] Invariant cache hit.
[2024-05-31 18:12:12] [INFO ] State equation strengthened by 29898 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6343/50901 variables, and 0 constraints, problems are : Problem set: 0 solved, 7476 unsolved in 5093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 7476/7476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6343/50901 variables, and 0 constraints, problems are : Problem set: 0 solved, 7476 unsolved in 5088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 0/7476 constraints, Known Traps: 0/0 constraints]
After SMT, in 42054ms problems are : Problem set: 0 solved, 7476 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6343 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Partial Free-agglomeration rule applied 3865 times.
Drop transitions (Partial Free agglomeration) removed 3865 transitions
Iterating global reduction 0 with 3865 rules applied. Total rules applied 3865 place count 10603 transition count 50000
Applied a total of 3865 rules in 2501 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2505 ms. Remains : 10603/10603 places, 50000/50000 transitions.
RANDOM walk for 736660 steps (1377 resets) in 120004 ms. (6 steps per ms) remains 1/7476 properties
BEST_FIRST walk for 4000004 steps (59 resets) in 12326 ms. (324 steps per ms) remains 1/1 properties
[2024-05-31 18:13:30] [INFO ] Flow matrix only has 44067 transitions (discarded 5933 similar events)
// Phase 1: matrix 44067 rows 10603 cols
[2024-05-31 18:13:38] [INFO ] Computed 102 invariants in 8281 ms
[2024-05-31 18:13:39] [INFO ] State equation strengthened by 37508 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10400/10402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:13:41] [INFO ] Deduced a trap composed of 2 places in 675 ms of which 14 ms to minimize.
[2024-05-31 18:13:41] [INFO ] Deduced a trap composed of 2 places in 573 ms of which 2 ms to minimize.
[2024-05-31 18:13:42] [INFO ] Deduced a trap composed of 2 places in 586 ms of which 2 ms to minimize.
[2024-05-31 18:13:43] [INFO ] Deduced a trap composed of 2 places in 592 ms of which 2 ms to minimize.
[2024-05-31 18:13:43] [INFO ] Deduced a trap composed of 2 places in 600 ms of which 1 ms to minimize.
[2024-05-31 18:13:44] [INFO ] Deduced a trap composed of 2 places in 591 ms of which 1 ms to minimize.
[2024-05-31 18:13:45] [INFO ] Deduced a trap composed of 2 places in 589 ms of which 1 ms to minimize.
[2024-05-31 18:13:46] [INFO ] Deduced a trap composed of 2 places in 585 ms of which 2 ms to minimize.
[2024-05-31 18:13:46] [INFO ] Deduced a trap composed of 2 places in 579 ms of which 1 ms to minimize.
[2024-05-31 18:13:47] [INFO ] Deduced a trap composed of 2 places in 576 ms of which 1 ms to minimize.
[2024-05-31 18:13:48] [INFO ] Deduced a trap composed of 2 places in 571 ms of which 1 ms to minimize.
[2024-05-31 18:13:48] [INFO ] Deduced a trap composed of 2 places in 582 ms of which 1 ms to minimize.
[2024-05-31 18:13:49] [INFO ] Deduced a trap composed of 2 places in 581 ms of which 2 ms to minimize.
[2024-05-31 18:13:50] [INFO ] Deduced a trap composed of 2 places in 582 ms of which 1 ms to minimize.
[2024-05-31 18:13:50] [INFO ] Deduced a trap composed of 2 places in 565 ms of which 1 ms to minimize.
[2024-05-31 18:13:51] [INFO ] Deduced a trap composed of 2 places in 572 ms of which 2 ms to minimize.
[2024-05-31 18:13:52] [INFO ] Deduced a trap composed of 2 places in 578 ms of which 1 ms to minimize.
[2024-05-31 18:13:52] [INFO ] Deduced a trap composed of 2 places in 566 ms of which 1 ms to minimize.
[2024-05-31 18:13:53] [INFO ] Deduced a trap composed of 2 places in 568 ms of which 1 ms to minimize.
[2024-05-31 18:13:54] [INFO ] Deduced a trap composed of 2 places in 583 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10402 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:13:55] [INFO ] Deduced a trap composed of 2 places in 584 ms of which 1 ms to minimize.
[2024-05-31 18:13:55] [INFO ] Deduced a trap composed of 2 places in 580 ms of which 1 ms to minimize.
[2024-05-31 18:13:56] [INFO ] Deduced a trap composed of 2 places in 624 ms of which 1 ms to minimize.
[2024-05-31 18:13:57] [INFO ] Deduced a trap composed of 2 places in 567 ms of which 2 ms to minimize.
[2024-05-31 18:13:57] [INFO ] Deduced a trap composed of 2 places in 567 ms of which 2 ms to minimize.
[2024-05-31 18:13:58] [INFO ] Deduced a trap composed of 2 places in 589 ms of which 1 ms to minimize.
[2024-05-31 18:13:59] [INFO ] Deduced a trap composed of 2 places in 585 ms of which 1 ms to minimize.
[2024-05-31 18:13:59] [INFO ] Deduced a trap composed of 2 places in 590 ms of which 2 ms to minimize.
[2024-05-31 18:14:00] [INFO ] Deduced a trap composed of 2 places in 574 ms of which 1 ms to minimize.
[2024-05-31 18:14:01] [INFO ] Deduced a trap composed of 2 places in 590 ms of which 2 ms to minimize.
[2024-05-31 18:14:02] [INFO ] Deduced a trap composed of 2 places in 590 ms of which 1 ms to minimize.
[2024-05-31 18:14:02] [INFO ] Deduced a trap composed of 2 places in 619 ms of which 1 ms to minimize.
[2024-05-31 18:14:03] [INFO ] Deduced a trap composed of 2 places in 567 ms of which 1 ms to minimize.
[2024-05-31 18:14:04] [INFO ] Deduced a trap composed of 2 places in 556 ms of which 1 ms to minimize.
[2024-05-31 18:14:04] [INFO ] Deduced a trap composed of 2 places in 572 ms of which 2 ms to minimize.
[2024-05-31 18:14:05] [INFO ] Deduced a trap composed of 2 places in 571 ms of which 1 ms to minimize.
[2024-05-31 18:14:06] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 2 ms to minimize.
[2024-05-31 18:14:06] [INFO ] Deduced a trap composed of 2 places in 574 ms of which 1 ms to minimize.
[2024-05-31 18:14:07] [INFO ] Deduced a trap composed of 2 places in 562 ms of which 2 ms to minimize.
[2024-05-31 18:14:08] [INFO ] Deduced a trap composed of 2 places in 570 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10402 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:14:09] [INFO ] Deduced a trap composed of 2 places in 579 ms of which 1 ms to minimize.
[2024-05-31 18:14:09] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 1 ms to minimize.
[2024-05-31 18:14:10] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 1 ms to minimize.
[2024-05-31 18:14:11] [INFO ] Deduced a trap composed of 2 places in 565 ms of which 2 ms to minimize.
[2024-05-31 18:14:11] [INFO ] Deduced a trap composed of 2 places in 561 ms of which 1 ms to minimize.
[2024-05-31 18:14:12] [INFO ] Deduced a trap composed of 2 places in 568 ms of which 2 ms to minimize.
[2024-05-31 18:14:13] [INFO ] Deduced a trap composed of 2 places in 572 ms of which 1 ms to minimize.
[2024-05-31 18:14:13] [INFO ] Deduced a trap composed of 2 places in 568 ms of which 1 ms to minimize.
[2024-05-31 18:14:14] [INFO ] Deduced a trap composed of 2 places in 571 ms of which 1 ms to minimize.
[2024-05-31 18:14:15] [INFO ] Deduced a trap composed of 2 places in 565 ms of which 1 ms to minimize.
[2024-05-31 18:14:15] [INFO ] Deduced a trap composed of 2 places in 560 ms of which 1 ms to minimize.
[2024-05-31 18:14:16] [INFO ] Deduced a trap composed of 2 places in 572 ms of which 1 ms to minimize.
[2024-05-31 18:14:17] [INFO ] Deduced a trap composed of 2 places in 595 ms of which 1 ms to minimize.
[2024-05-31 18:14:18] [INFO ] Deduced a trap composed of 2 places in 562 ms of which 1 ms to minimize.
[2024-05-31 18:14:18] [INFO ] Deduced a trap composed of 2 places in 561 ms of which 2 ms to minimize.
[2024-05-31 18:14:19] [INFO ] Deduced a trap composed of 2 places in 578 ms of which 2 ms to minimize.
[2024-05-31 18:14:20] [INFO ] Deduced a trap composed of 2 places in 566 ms of which 5 ms to minimize.
[2024-05-31 18:14:20] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 1 ms to minimize.
[2024-05-31 18:14:21] [INFO ] Deduced a trap composed of 2 places in 571 ms of which 1 ms to minimize.
[2024-05-31 18:14:22] [INFO ] Deduced a trap composed of 2 places in 564 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/10402 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:14:22] [INFO ] Deduced a trap composed of 2 places in 565 ms of which 2 ms to minimize.
[2024-05-31 18:14:23] [INFO ] Deduced a trap composed of 2 places in 565 ms of which 1 ms to minimize.
[2024-05-31 18:14:24] [INFO ] Deduced a trap composed of 2 places in 568 ms of which 1 ms to minimize.
SMT process timed out in 53736ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 6058 times.
Drop transitions (Partial Free agglomeration) removed 6058 transitions
Iterating global reduction 1 with 6058 rules applied. Total rules applied 6060 place count 10602 transition count 49999
Applied a total of 6060 rules in 16714 ms. Remains 10602 /10603 variables (removed 1) and now considering 49999/50000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16714 ms. Remains : 10602/10603 places, 49999/50000 transitions.
RANDOM walk for 624538 steps (1041 resets) in 28200 ms. (22 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 20400 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 501819 ms.
ITS solved all properties within timeout

BK_STOP 1717179292423

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 QuasiLiveness -timeout 180 -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-100"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-100, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r478-tall-171620515800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-100.tgz
mv CANInsertWithFailure-PT-100 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;