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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 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 581K 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-3B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717241071030

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-3B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:24:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:24:32] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-06-01 11:24:32] [INFO ] Transformed 2117 places.
[2024-06-01 11:24:32] [INFO ] Transformed 2435 transitions.
[2024-06-01 11:24:32] [INFO ] Found NUPN structural information;
[2024-06-01 11:24:32] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (63 resets) in 1383 ms. (28 steps per ms) remains 5/16 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 246 ms. (161 steps per ms) remains 3/5 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
// Phase 1: matrix 2435 rows 2117 cols
[2024-06-01 11:24:33] [INFO ] Computed 66 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1032/1050 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 1032/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1067/2117 variables, 34/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2117 variables, 1067/2183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2223 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1032/1050 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 1032/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:24:36] [INFO ] Deduced a trap composed of 64 places in 367 ms of which 45 ms to minimize.
[2024-06-01 11:24:37] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 16 ms to minimize.
[2024-06-01 11:24:37] [INFO ] Deduced a trap composed of 85 places in 302 ms of which 9 ms to minimize.
[2024-06-01 11:24:37] [INFO ] Deduced a trap composed of 97 places in 245 ms of which 4 ms to minimize.
[2024-06-01 11:24:38] [INFO ] Deduced a trap composed of 81 places in 733 ms of which 3 ms to minimize.
[2024-06-01 11:24:38] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-06-01 11:24:38] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 6 ms to minimize.
[2024-06-01 11:24:39] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:24:39] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 9/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1050 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1067/2117 variables, 34/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 1067/2192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:24:41] [INFO ] Deduced a trap composed of 32 places in 1083 ms of which 11 ms to minimize.
SMT process timed out in 7514ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1708 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 14 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 433 rules applied. Total rules applied 434 place count 2049 transition count 1935
Reduce places removed 428 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 434 rules applied. Total rules applied 868 place count 1621 transition count 1929
Reduce places removed 3 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 13 rules applied. Total rules applied 881 place count 1618 transition count 1919
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 891 place count 1608 transition count 1919
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 891 place count 1608 transition count 1897
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 935 place count 1586 transition count 1897
Discarding 361 places :
Symmetric choice reduction at 4 with 361 rule applications. Total rules 1296 place count 1225 transition count 1536
Iterating global reduction 4 with 361 rules applied. Total rules applied 1657 place count 1225 transition count 1536
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1657 place count 1225 transition count 1496
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1737 place count 1185 transition count 1496
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 1872 place count 1050 transition count 1323
Iterating global reduction 4 with 135 rules applied. Total rules applied 2007 place count 1050 transition count 1323
Discarding 137 places :
Symmetric choice reduction at 4 with 137 rule applications. Total rules 2144 place count 913 transition count 1170
Iterating global reduction 4 with 137 rules applied. Total rules applied 2281 place count 913 transition count 1170
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 2336 place count 858 transition count 1074
Iterating global reduction 4 with 55 rules applied. Total rules applied 2391 place count 858 transition count 1074
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 20 rules applied. Total rules applied 2411 place count 856 transition count 1056
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2413 place count 854 transition count 1056
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 2451 place count 816 transition count 1018
Iterating global reduction 6 with 38 rules applied. Total rules applied 2489 place count 816 transition count 1018
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2497 place count 812 transition count 1014
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2501 place count 808 transition count 1014
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 2527 place count 782 transition count 962
Iterating global reduction 8 with 26 rules applied. Total rules applied 2553 place count 782 transition count 962
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 2579 place count 756 transition count 936
Iterating global reduction 8 with 26 rules applied. Total rules applied 2605 place count 756 transition count 936
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 36 rules applied. Total rules applied 2641 place count 751 transition count 905
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2646 place count 746 transition count 905
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 10 with 594 rules applied. Total rules applied 3240 place count 449 transition count 608
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3254 place count 435 transition count 594
Iterating global reduction 10 with 14 rules applied. Total rules applied 3268 place count 435 transition count 594
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 3279 place count 424 transition count 572
Iterating global reduction 10 with 11 rules applied. Total rules applied 3290 place count 424 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3292 place count 424 transition count 570
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3293 place count 423 transition count 568
Iterating global reduction 11 with 1 rules applied. Total rules applied 3294 place count 423 transition count 568
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 3334 place count 403 transition count 639
Free-agglomeration rule applied 22 times.
Iterating global reduction 11 with 22 rules applied. Total rules applied 3356 place count 403 transition count 617
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 29 rules applied. Total rules applied 3385 place count 381 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 3387 place count 381 transition count 608
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3391 place count 381 transition count 604
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3395 place count 377 transition count 604
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3397 place count 377 transition count 604
Applied a total of 3397 rules in 1414 ms. Remains 377 /2117 variables (removed 1740) and now considering 604/2435 (removed 1831) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 377/2117 places, 604/2435 transitions.
RANDOM walk for 40000 steps (529 resets) in 1560 ms. (25 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 169 ms. (235 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 604 rows 377 cols
[2024-06-01 11:24:43] [INFO ] Computed 54 invariants in 6 ms
[2024-06-01 11:24:43] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/191 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/327 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 590/917 variables, 327/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 58/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/981 variables, 50/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/981 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 377/377 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/191 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:24:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:24:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
[2024-06-01 11:24:43] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 136/327 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:24:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 590/917 variables, 327/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 58/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 64/981 variables, 50/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/981 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 377/377 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 122 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=122 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
All properties solved without resorting to model-checking.
Total runtime 12074 ms.
ITS solved all properties within timeout

BK_STOP 1717241084387

--------------------
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-3B"
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-3B, 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-171654352000599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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