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.r508-tall-171654351100215.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 MultiCrashLeafsetExtension-PT-S32C10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351100215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M 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 MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717231167259

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:39:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:39:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:39:29] [INFO ] Load time of PNML (sax parser for PT used): 1114 ms
[2024-06-01 08:39:29] [INFO ] Transformed 32088 places.
[2024-06-01 08:39:29] [INFO ] Transformed 48223 transitions.
[2024-06-01 08:39:29] [INFO ] Parsed PT model containing 32088 places and 48223 transitions and 181342 arcs in 1491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 131 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (389 resets) in 3851 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 228 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 5326 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :0 out of 16
Probabilistic random walk after 5326 steps, saw 2778 distinct states, run finished after 3010 ms. (steps per millisecond=1 ) properties seen :0
[2024-06-01 08:39:35] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32088 cols
[2024-06-01 08:39:42] [INFO ] Computed 1893 invariants in 7236 ms
[2024-06-01 08:39:42] [INFO ] State equation strengthened by 15490 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5532/5745 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5745 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5745 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 31/5776 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5776 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SMT process timed out in 13021ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 213 out of 32088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Graph (complete) has 105773 edges and 32088 vertex of which 32032 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.89 ms
Discarding 56 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10290 transitions
Trivial Post-agglo rules discarded 10290 transitions
Performed 10290 trivial Post agglomeration. Transition count delta: 10290
Iterating post reduction 0 with 10290 rules applied. Total rules applied 10291 place count 32032 transition count 37933
Reduce places removed 10290 places and 0 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Iterating post reduction 1 with 10528 rules applied. Total rules applied 20819 place count 21742 transition count 37695
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 2 with 238 rules applied. Total rules applied 21057 place count 21504 transition count 37695
Performed 642 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 642 Pre rules applied. Total rules applied 21057 place count 21504 transition count 37053
Deduced a syphon composed of 642 places in 51 ms
Reduce places removed 642 places and 0 transitions.
Iterating global reduction 3 with 1284 rules applied. Total rules applied 22341 place count 20862 transition count 37053
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 49 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 22395 place count 20835 transition count 37026
Free-agglomeration rule (complex) applied 374 times.
Iterating global reduction 3 with 374 rules applied. Total rules applied 22769 place count 20835 transition count 36652
Reduce places removed 374 places and 0 transitions.
Iterating post reduction 3 with 374 rules applied. Total rules applied 23143 place count 20461 transition count 36652
Partial Free-agglomeration rule applied 10290 times.
Drop transitions (Partial Free agglomeration) removed 10290 transitions
Iterating global reduction 4 with 10290 rules applied. Total rules applied 33433 place count 20461 transition count 36652
Applied a total of 33433 rules in 11212 ms. Remains 20461 /32088 variables (removed 11627) and now considering 36652/48223 (removed 11571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11228 ms. Remains : 20461/32088 places, 36652/48223 transitions.
RANDOM walk for 40000 steps (552 resets) in 3037 ms. (13 steps per ms) remains 14/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 527 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (60 resets) in 345 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (60 resets) in 265 ms. (150 steps per ms) remains 13/14 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 544 ms. (73 steps per ms) remains 12/13 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (60 resets) in 358 ms. (111 steps per ms) remains 11/12 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (60 resets) in 367 ms. (108 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (60 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 388 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 267 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (60 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (60 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 360 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
[2024-06-01 08:40:01] [INFO ] Flow matrix only has 35222 transitions (discarded 1430 similar events)
// Phase 1: matrix 35222 rows 20461 cols
[2024-06-01 08:40:11] [INFO ] Computed 1837 invariants in 9994 ms
[2024-06-01 08:40:12] [INFO ] State equation strengthened by 15490 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 8180/8256 variables, 23/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8256 variables, 1/26 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8256 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/8260 variables, 4/30 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8260 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 11889/20149 variables, 1495/1525 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20149 variables, 0/1525 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 38/20187 variables, 38/1563 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20187 variables, 0/1563 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 274/20461 variables, 274/1837 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/20461 variables, 0/1837 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 55683/55683 variables, and 22298 constraints, problems are : Problem set: 5 solved, 5 unsolved in 45084 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 1772/1772 constraints, State Equation: 20461/20461 constraints, ReadFeed: 0/15490 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8212/8224 variables, 13/13 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 08:41:14] [INFO ] Deduced a trap composed of 2584 places in 15152 ms of which 406 ms to minimize.
[2024-06-01 08:41:26] [INFO ] Deduced a trap composed of 2514 places in 11610 ms of which 52 ms to minimize.
[2024-06-01 08:41:37] [INFO ] Deduced a trap composed of 2568 places in 11145 ms of which 50 ms to minimize.
[2024-06-01 08:41:52] [INFO ] Deduced a trap composed of 3007 places in 13330 ms of which 58 ms to minimize.
SMT process timed out in 110810ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 20461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20461/20461 places, 36652/36652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 20461 transition count 36622
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 20431 transition count 36622
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 60 place count 20431 transition count 36604
Deduced a syphon composed of 18 places in 39 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 96 place count 20413 transition count 36604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 45 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 20408 transition count 36599
Free-agglomeration rule (complex) applied 1183 times.
Iterating global reduction 2 with 1183 rules applied. Total rules applied 1289 place count 20408 transition count 35416
Reduce places removed 1183 places and 0 transitions.
Iterating post reduction 2 with 1183 rules applied. Total rules applied 2472 place count 19225 transition count 35416
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 2492 place count 19225 transition count 35416
Applied a total of 2492 rules in 9387 ms. Remains 19225 /20461 variables (removed 1236) and now considering 35416/36652 (removed 1236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9389 ms. Remains : 19225/20461 places, 35416/36652 transitions.
RANDOM walk for 40000 steps (648 resets) in 4440 ms. (9 steps per ms) remains 4/5 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 498 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 483 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 459 ms. (86 steps per ms) remains 4/4 properties
[2024-06-01 08:42:03] [INFO ] Flow matrix only has 33876 transitions (discarded 1540 similar events)
// Phase 1: matrix 33876 rows 19225 cols
[2024-06-01 08:42:15] [INFO ] Computed 1837 invariants in 11451 ms
[2024-06-01 08:42:16] [INFO ] State equation strengthened by 15490 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6761/6772 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6772 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12007/18779 variables, 1378/1391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18779 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/18831 variables, 52/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18831 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 394/19225 variables, 394/1837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19225 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 53101/53101 variables, and 21062 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67500 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 1772/1772 constraints, State Equation: 19225/19225 constraints, ReadFeed: 0/15490 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6761/6772 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:35] [INFO ] Deduced a trap composed of 3875 places in 10890 ms of which 45 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 2469 places in 10598 ms of which 43 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 1401 places in 6892 ms of which 27 ms to minimize.
[2024-06-01 08:43:59] [INFO ] Deduced a trap composed of 1405 places in 6585 ms of which 30 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 2858 places in 9839 ms of which 45 ms to minimize.
[2024-06-01 08:44:15] [INFO ] Deduced a trap composed of 1443 places in 4430 ms of which 19 ms to minimize.
[2024-06-01 08:44:20] [INFO ] Deduced a trap composed of 1415 places in 4489 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6772 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6772 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12007/18779 variables, 1378/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:45:51] [INFO ] Deduced a trap composed of 5 places in 86989 ms of which 124 ms to minimize.
SMT process timed out in 227876ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 19225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19225/19225 places, 35416/35416 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19225 transition count 35415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19224 transition count 35415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 19224 transition count 35414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19223 transition count 35414
Applied a total of 4 rules in 2925 ms. Remains 19223 /19225 variables (removed 2) and now considering 35414/35416 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2925 ms. Remains : 19223/19225 places, 35414/35416 transitions.
[2024-06-01 08:45:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 08:45:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 19223 places, 35414 transitions and 215203 arcs took 182 ms.
[2024-06-01 08:45:57] [INFO ] Flatten gal took : 2097 ms
Total runtime 388851 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 : MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-08
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-11
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-13
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-15

BK_STOP 1717231557542

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_1_
rfs formula name MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/588/inv_2_
rfs formula name MultiCrashLeafsetExtension-PT-S32C10-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_3_
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="MultiCrashLeafsetExtension-PT-S32C10"
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 MultiCrashLeafsetExtension-PT-S32C10, 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 r508-tall-171654351100215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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