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.r540-smll-171690573800175.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 TokenRing-PT-015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573800175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 219K Apr 11 19:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 19:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 11 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.2M Apr 11 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 117K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 412K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.2M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 595K Apr 11 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2M Apr 11 19:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 11 19:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 TokenRing-PT-015-ReachabilityFireability-2024-00
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-01
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-02
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-03
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-04
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-05
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-06
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-07
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-08
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-09
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-10
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-11
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-12
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-13
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-14
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717250430312

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:00:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:00:32] [INFO ] Load time of PNML (sax parser for PT used): 519 ms
[2024-06-01 14:00:32] [INFO ] Transformed 256 places.
[2024-06-01 14:00:32] [INFO ] Transformed 3616 transitions.
[2024-06-01 14:00:32] [INFO ] Found NUPN structural information;
[2024-06-01 14:00:32] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 865 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 519 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2427 ms. (16 steps per ms) remains 6/12 properties
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 636 ms. (62 steps per ms) remains 5/6 properties
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 442 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 782 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 579 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 471 ms. (84 steps per ms) remains 5/5 properties
// Phase 1: matrix 3616 rows 256 cols
[2024-06-01 14:00:35] [INFO ] Computed 16 invariants in 45 ms
[2024-06-01 14:00:35] [INFO ] State equation strengthened by 3390 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3654 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 141 places in 597 ms of which 37 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 142 places in 592 ms of which 4 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 139 places in 434 ms of which 6 ms to minimize.
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 141 places in 425 ms of which 3 ms to minimize.
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 142 places in 511 ms of which 3 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 140 places in 451 ms of which 3 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 137 places in 476 ms of which 3 ms to minimize.
[2024-06-01 14:00:44] [INFO ] Deduced a trap composed of 137 places in 478 ms of which 3 ms to minimize.
[2024-06-01 14:00:44] [INFO ] Deduced a trap composed of 139 places in 398 ms of which 3 ms to minimize.
[2024-06-01 14:00:45] [INFO ] Deduced a trap composed of 139 places in 467 ms of which 3 ms to minimize.
SMT process timed out in 9449ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 190 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 537 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 557 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 92740 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 92740 steps, saw 18703 distinct states, run finished after 3022 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 14:00:49] [INFO ] Invariant cache hit.
[2024-06-01 14:00:49] [INFO ] State equation strengthened by 3390 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2863 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:00:53] [INFO ] Deduced a trap composed of 146 places in 449 ms of which 3 ms to minimize.
[2024-06-01 14:00:53] [INFO ] Deduced a trap composed of 140 places in 416 ms of which 3 ms to minimize.
[2024-06-01 14:00:53] [INFO ] Deduced a trap composed of 142 places in 375 ms of which 3 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 144 places in 483 ms of which 3 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 144 places in 474 ms of which 3 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 146 places in 469 ms of which 3 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 146 places in 470 ms of which 3 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 142 places in 439 ms of which 3 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 144 places in 484 ms of which 3 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 152 places in 378 ms of which 3 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 144 places in 434 ms of which 3 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 139 places in 420 ms of which 3 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 150 places in 426 ms of which 3 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 149 places in 464 ms of which 3 ms to minimize.
[2024-06-01 14:00:59] [INFO ] Deduced a trap composed of 149 places in 445 ms of which 3 ms to minimize.
[2024-06-01 14:00:59] [INFO ] Deduced a trap composed of 143 places in 459 ms of which 3 ms to minimize.
[2024-06-01 14:01:00] [INFO ] Deduced a trap composed of 139 places in 452 ms of which 3 ms to minimize.
[2024-06-01 14:01:00] [INFO ] Deduced a trap composed of 142 places in 514 ms of which 3 ms to minimize.
[2024-06-01 14:01:01] [INFO ] Deduced a trap composed of 139 places in 456 ms of which 3 ms to minimize.
[2024-06-01 14:01:01] [INFO ] Deduced a trap composed of 140 places in 484 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:02] [INFO ] Deduced a trap composed of 141 places in 426 ms of which 2 ms to minimize.
[2024-06-01 14:01:02] [INFO ] Deduced a trap composed of 137 places in 472 ms of which 3 ms to minimize.
[2024-06-01 14:01:03] [INFO ] Deduced a trap composed of 142 places in 490 ms of which 3 ms to minimize.
[2024-06-01 14:01:03] [INFO ] Deduced a trap composed of 140 places in 493 ms of which 4 ms to minimize.
[2024-06-01 14:01:04] [INFO ] Deduced a trap composed of 141 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:01:04] [INFO ] Deduced a trap composed of 141 places in 471 ms of which 3 ms to minimize.
[2024-06-01 14:01:05] [INFO ] Deduced a trap composed of 141 places in 404 ms of which 3 ms to minimize.
[2024-06-01 14:01:05] [INFO ] Deduced a trap composed of 141 places in 470 ms of which 3 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 139 places in 474 ms of which 3 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 142 places in 474 ms of which 4 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 140 places in 482 ms of which 3 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 140 places in 471 ms of which 3 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 141 places in 433 ms of which 3 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 3 ms to minimize.
[2024-06-01 14:01:09] [INFO ] Deduced a trap composed of 139 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:01:09] [INFO ] Deduced a trap composed of 137 places in 462 ms of which 3 ms to minimize.
[2024-06-01 14:01:10] [INFO ] Deduced a trap composed of 140 places in 488 ms of which 3 ms to minimize.
[2024-06-01 14:01:10] [INFO ] Deduced a trap composed of 140 places in 449 ms of which 3 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 140 places in 461 ms of which 3 ms to minimize.
[2024-06-01 14:01:11] [INFO ] Deduced a trap composed of 142 places in 491 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 141 places in 425 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:12] [INFO ] Deduced a trap composed of 146 places in 394 ms of which 3 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 145 places in 381 ms of which 3 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 141 places in 465 ms of which 3 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 142 places in 476 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 138 places in 379 ms of which 7 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 138 places in 479 ms of which 4 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 141 places in 496 ms of which 3 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 137 places in 490 ms of which 3 ms to minimize.
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 141 places in 487 ms of which 3 ms to minimize.
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 143 places in 499 ms of which 3 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 145 places in 484 ms of which 3 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 143 places in 498 ms of which 3 ms to minimize.
[2024-06-01 14:01:19] [INFO ] Deduced a trap composed of 142 places in 477 ms of which 3 ms to minimize.
[2024-06-01 14:01:19] [INFO ] Deduced a trap composed of 136 places in 479 ms of which 3 ms to minimize.
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 148 places in 483 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 11/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 146 places in 379 ms of which 3 ms to minimize.
[2024-06-01 14:01:21] [INFO ] Deduced a trap composed of 145 places in 490 ms of which 3 ms to minimize.
[2024-06-01 14:01:22] [INFO ] Deduced a trap composed of 148 places in 488 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:22] [INFO ] Deduced a trap composed of 141 places in 377 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:23] [INFO ] Deduced a trap composed of 143 places in 380 ms of which 3 ms to minimize.
[2024-06-01 14:01:24] [INFO ] Deduced a trap composed of 140 places in 497 ms of which 3 ms to minimize.
[2024-06-01 14:01:24] [INFO ] Deduced a trap composed of 151 places in 509 ms of which 3 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 147 places in 374 ms of which 3 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 143 places in 383 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 138 places in 404 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 143 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 140 places in 469 ms of which 3 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 140 places in 477 ms of which 3 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 141 places in 482 ms of which 3 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 141 places in 473 ms of which 3 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 144 places in 466 ms of which 2 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 143 places in 451 ms of which 3 ms to minimize.
[2024-06-01 14:01:30] [INFO ] Deduced a trap composed of 141 places in 492 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3616/3872 variables, 256/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3872 variables, 3390/3992 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3872 variables, 4/3996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 140 places in 406 ms of which 3 ms to minimize.
[2024-06-01 14:01:36] [INFO ] Deduced a trap composed of 140 places in 396 ms of which 3 ms to minimize.
[2024-06-01 14:01:36] [INFO ] Deduced a trap composed of 139 places in 374 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3872 variables, 3/3999 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3999 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45011 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 77/77 constraints]
After SMT, in 48094ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 110 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 124 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2024-06-01 14:01:37] [INFO ] Invariant cache hit.
[2024-06-01 14:01:38] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 14:01:38] [INFO ] Invariant cache hit.
[2024-06-01 14:01:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2024-06-01 14:01:44] [INFO ] Implicit Places using invariants and state equation in 6786 ms returned []
Implicit Place search using SMT with State Equation took 7313 ms to find 0 implicit places.
[2024-06-01 14:01:45] [INFO ] Redundant transitions in 349 ms returned []
Running 3601 sub problems to find dead transitions.
[2024-06-01 14:01:45] [INFO ] Invariant cache hit.
[2024-06-01 14:01:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
[2024-06-01 14:02:17] [INFO ] Deduced a trap composed of 147 places in 397 ms of which 3 ms to minimize.
[2024-06-01 14:02:18] [INFO ] Deduced a trap composed of 140 places in 474 ms of which 3 ms to minimize.
[2024-06-01 14:02:18] [INFO ] Deduced a trap composed of 145 places in 467 ms of which 3 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 145 places in 414 ms of which 2 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 146 places in 447 ms of which 3 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 145 places in 452 ms of which 3 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 141 places in 492 ms of which 3 ms to minimize.
[2024-06-01 14:02:21] [INFO ] Deduced a trap composed of 142 places in 486 ms of which 6 ms to minimize.
SMT process timed out in 35731ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 35776ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43593 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1593 edges and 256 vertex of which 160 / 256 are part of one of the 15 SCC in 7 ms
Free SCC test removed 145 places
Drop transitions (Empty/Sink Transition effects.) removed 1588 transitions
Ensure Unique test removed 1464 transitions
Reduce isomorphic transitions removed 3052 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 2 place count 111 transition count 563
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 110 transition count 559
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 106 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 413 transitions
Redundant transition composition rules discarded 413 transitions
Iterating global reduction 3 with 413 rules applied. Total rules applied 424 place count 106 transition count 146
Applied a total of 424 rules in 78 ms. Remains 106 /256 variables (removed 150) and now considering 146/3616 (removed 3470) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 106 cols
[2024-06-01 14:02:21] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 14:02:21] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 14:02:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 14:02:21] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 14:02:21] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 14:02:21] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 680 ms.
[2024-06-01 14:02:21] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 14:02:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 3616 transitions and 14464 arcs took 35 ms.
[2024-06-01 14:02:22] [INFO ] Flatten gal took : 426 ms
Total runtime 110726 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 : TokenRing-PT-015-ReachabilityFireability-2024-08
Could not compute solution for formula : TokenRing-PT-015-ReachabilityFireability-2024-09
Could not compute solution for formula : TokenRing-PT-015-ReachabilityFireability-2024-11
Could not compute solution for formula : TokenRing-PT-015-ReachabilityFireability-2024-14
Could not compute solution for formula : TokenRing-PT-015-ReachabilityFireability-2024-15

BK_STOP 1717250543231

--------------------
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
mcc2024
rfs formula name TokenRing-PT-015-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/833/inv_0_
rfs formula name TokenRing-PT-015-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/833/inv_1_
rfs formula name TokenRing-PT-015-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/833/inv_2_
rfs formula name TokenRing-PT-015-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/833/inv_3_
rfs formula name TokenRing-PT-015-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/833/inv_4_
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="TokenRing-PT-015"
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 TokenRing-PT-015, 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 r540-smll-171690573800175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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