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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717242198074

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:43:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:43:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:43:19] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-06-01 11:43:19] [INFO ] Transformed 2328 places.
[2024-06-01 11:43:19] [INFO ] Transformed 2701 transitions.
[2024-06-01 11:43:19] [INFO ] Found NUPN structural information;
[2024-06-01 11:43:19] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (21 resets) in 1682 ms. (23 steps per ms) remains 7/15 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 7/7 properties
// Phase 1: matrix 2701 rows 2328 cols
[2024-06-01 11:43:21] [INFO ] Computed 66 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2113/2308 variables, 64/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2308 variables, 2113/2372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2308 variables, 0/2372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 20/2328 variables, 2/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2328 variables, 20/2394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 0/2394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2701/5029 variables, 2328/4722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5029/5029 variables, and 4722 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3489 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2328/2328 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2113/2308 variables, 64/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2308 variables, 2113/2372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 11:43:25] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2308 variables, 1/2373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2308 variables, 0/2373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 20/2328 variables, 2/2375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 20/2395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2328 variables, 0/2395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2701/5029 variables, 2328/4723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5029 variables, 7/4730 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 11:43:29] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-06-01 11:43:29] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5029/5029 variables, and 4732 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5013 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2328/2328 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 8716ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 1854 edges and 2328 vertex of which 478 / 2328 are part of one of the 23 SCC in 9 ms
Free SCC test removed 455 places
Drop transitions (Empty/Sink Transition effects.) removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 480 place count 1873 transition count 1686
Reduce places removed 479 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 548 rules applied. Total rules applied 1028 place count 1394 transition count 1617
Reduce places removed 18 places and 0 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Iterating post reduction 2 with 135 rules applied. Total rules applied 1163 place count 1376 transition count 1500
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 148 rules applied. Total rules applied 1311 place count 1259 transition count 1469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1314 place count 1256 transition count 1469
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 1314 place count 1256 transition count 1451
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1350 place count 1238 transition count 1451
Discarding 287 places :
Symmetric choice reduction at 5 with 287 rule applications. Total rules 1637 place count 951 transition count 1164
Iterating global reduction 5 with 287 rules applied. Total rules applied 1924 place count 951 transition count 1164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1932 place count 951 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1933 place count 950 transition count 1156
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 41 Pre rules applied. Total rules applied 1933 place count 950 transition count 1115
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 2015 place count 909 transition count 1115
Discarding 36 places :
Symmetric choice reduction at 7 with 36 rule applications. Total rules 2051 place count 873 transition count 1064
Iterating global reduction 7 with 36 rules applied. Total rules applied 2087 place count 873 transition count 1064
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 3 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 7 with 384 rules applied. Total rules applied 2471 place count 681 transition count 872
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 2480 place count 681 transition count 863
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2482 place count 679 transition count 859
Iterating global reduction 8 with 2 rules applied. Total rules applied 2484 place count 679 transition count 859
Performed 26 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 2536 place count 653 transition count 994
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 2550 place count 653 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 2586 place count 653 transition count 944
Free-agglomeration rule applied 96 times.
Iterating global reduction 9 with 96 rules applied. Total rules applied 2682 place count 653 transition count 848
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 2783 place count 557 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 2796 place count 557 transition count 830
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 2804 place count 557 transition count 830
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2805 place count 556 transition count 829
Applied a total of 2805 rules in 711 ms. Remains 556 /2328 variables (removed 1772) and now considering 829/2701 (removed 1872) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 556/2328 places, 829/2701 transitions.
RANDOM walk for 40000 steps (8 resets) in 742 ms. (53 steps per ms) remains 4/7 properties
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2024-06-01 11:43:31] [INFO ] Flow matrix only has 827 transitions (discarded 2 similar events)
// Phase 1: matrix 827 rows 556 cols
[2024-06-01 11:43:31] [INFO ] Computed 66 invariants in 5 ms
[2024-06-01 11:43:31] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 358/519 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/546 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 820/1366 variables, 546/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 68/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14/1380 variables, 7/685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1380 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/1383 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1383 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1383 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1383/1383 variables, and 690 constraints, problems are : Problem set: 0 solved, 4 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 556/556 constraints, ReadFeed: 68/68 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/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 358/519 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:43:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:43:32] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 27/546 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 820/1366 variables, 546/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 68/681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1366 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 11:43:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1366 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 14/1380 variables, 7/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1380 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1380 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1383 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1383 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1383 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1383 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1383/1383 variables, and 698 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 556/556 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 3351ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 5581 steps, including 37 resets, run visited all 1 properties in 21 ms. (steps per millisecond=265 )
FORMULA NoC3x3-PT-4B-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 146 ms.
All properties solved without resorting to model-checking.
Total runtime 15350 ms.
ITS solved all properties within timeout

BK_STOP 1717242214616

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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-171654352000615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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