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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 25K Apr 23 07:41 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 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K 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-5B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2023-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717242957143

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-5B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:55:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:55:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:55:58] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 11:55:58] [INFO ] Transformed 1571 places.
[2024-06-01 11:55:58] [INFO ] Transformed 2173 transitions.
[2024-06-01 11:55:58] [INFO ] Found NUPN structural information;
[2024-06-01 11:55:58] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (58 resets) in 1736 ms. (23 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 660 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 969 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
// Phase 1: matrix 2173 rows 1571 cols
[2024-06-01 11:56:00] [INFO ] Computed 66 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1317/1571 variables, 66/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1571 variables, 1317/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1571 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2173/3744 variables, 1571/3208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3744/3744 variables, and 3208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2543 ms.
Refiners :[Domain max(s): 1571/1571 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1571/1571 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1317/1571 variables, 66/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1571 variables, 1317/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 82 places in 351 ms of which 35 ms to minimize.
[2024-06-01 11:56:04] [INFO ] Deduced a trap composed of 77 places in 237 ms of which 3 ms to minimize.
[2024-06-01 11:56:04] [INFO ] Deduced a trap composed of 140 places in 313 ms of which 16 ms to minimize.
[2024-06-01 11:56:04] [INFO ] Deduced a trap composed of 97 places in 314 ms of which 6 ms to minimize.
[2024-06-01 11:56:05] [INFO ] Deduced a trap composed of 138 places in 333 ms of which 4 ms to minimize.
[2024-06-01 11:56:05] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 4 ms to minimize.
[2024-06-01 11:56:05] [INFO ] Deduced a trap composed of 177 places in 178 ms of which 4 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 6 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 89 places in 291 ms of which 5 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 102 places in 281 ms of which 5 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 3 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 3 ms to minimize.
Problem NoC3x3-PT-5B-ReachabilityFireability-2023-13 is UNSAT
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 113 places in 322 ms of which 6 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 275 places in 211 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1571/3744 variables, and 1651 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 1571/1571 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/1571 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 7891ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 252 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1571 transition count 1975
Reduce places removed 198 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 1 with 251 rules applied. Total rules applied 449 place count 1373 transition count 1922
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 502 place count 1320 transition count 1922
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 766 place count 1056 transition count 1658
Iterating global reduction 3 with 264 rules applied. Total rules applied 1030 place count 1056 transition count 1658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1030 place count 1056 transition count 1643
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1060 place count 1041 transition count 1643
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 1131 place count 970 transition count 1554
Iterating global reduction 3 with 71 rules applied. Total rules applied 1202 place count 970 transition count 1554
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1222 place count 950 transition count 1514
Iterating global reduction 3 with 20 rules applied. Total rules applied 1242 place count 950 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1246 place count 946 transition count 1506
Iterating global reduction 3 with 4 rules applied. Total rules applied 1250 place count 946 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1251 place count 945 transition count 1504
Iterating global reduction 3 with 1 rules applied. Total rules applied 1252 place count 945 transition count 1504
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 5 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 1466 place count 838 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1467 place count 837 transition count 1394
Iterating global reduction 3 with 1 rules applied. Total rules applied 1468 place count 837 transition count 1394
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 1664 place count 739 transition count 1420
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1674 place count 739 transition count 1410
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 1704 place count 739 transition count 1380
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1707 place count 736 transition count 1380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1707 place count 736 transition count 1379
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1709 place count 735 transition count 1379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1713 place count 733 transition count 1380
Free-agglomeration rule applied 46 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1759 place count 733 transition count 1333
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1807 place count 687 transition count 1331
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1816 place count 687 transition count 1322
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 1847 place count 687 transition count 1322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1848 place count 686 transition count 1321
Applied a total of 1848 rules in 733 ms. Remains 686 /1571 variables (removed 885) and now considering 1321/2173 (removed 852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 686/1571 places, 1321/2173 transitions.
RANDOM walk for 40000 steps (99 resets) in 712 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 279 ms. (142 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 130 ms. (305 steps per ms) remains 3/4 properties
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 11:56:09] [INFO ] Flow matrix only has 1311 transitions (discarded 10 similar events)
// Phase 1: matrix 1311 rows 686 cols
[2024-06-01 11:56:09] [INFO ] Computed 63 invariants in 9 ms
[2024-06-01 11:56:09] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 565/673 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/684 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/684 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1310/1994 variables, 684/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1994 variables, 31/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1994 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/1997 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1997 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1997 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1997 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1997/1997 variables, and 780 constraints, problems are : Problem set: 0 solved, 3 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 686/686 constraints, ReadFeed: 31/31 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 565/673 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/684 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:56:11] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-06-01 11:56:11] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2024-06-01 11:56:11] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1310/1994 variables, 684/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1994 variables, 31/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1994 variables, 3/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:56:13] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1994 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/1997 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1997 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1997 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1997 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1997/1997 variables, and 792 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4403 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 686/686 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 5255ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 703 ms.
Support contains 77 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1321/1321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 686 transition count 1292
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 657 transition count 1292
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 58 place count 657 transition count 1283
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 76 place count 648 transition count 1283
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 103 place count 621 transition count 1247
Iterating global reduction 2 with 27 rules applied. Total rules applied 130 place count 621 transition count 1247
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 621 transition count 1245
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 619 transition count 1245
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 616 transition count 1232
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 616 transition count 1232
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 281 place count 545 transition count 1162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 283 place count 545 transition count 1160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 302 place count 526 transition count 1110
Iterating global reduction 3 with 19 rules applied. Total rules applied 321 place count 526 transition count 1110
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 373 place count 500 transition count 1116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 375 place count 500 transition count 1114
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 381 place count 494 transition count 1090
Iterating global reduction 4 with 6 rules applied. Total rules applied 387 place count 494 transition count 1090
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 410 place count 494 transition count 1067
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 413 place count 491 transition count 1067
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 417 place count 487 transition count 1048
Iterating global reduction 5 with 4 rules applied. Total rules applied 421 place count 487 transition count 1048
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 486 transition count 1048
Free-agglomeration rule applied 26 times.
Iterating global reduction 5 with 26 rules applied. Total rules applied 449 place count 486 transition count 1022
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 495 place count 460 transition count 1002
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 499 place count 460 transition count 998
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 509 place count 460 transition count 998
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 510 place count 460 transition count 997
Applied a total of 510 rules in 194 ms. Remains 460 /686 variables (removed 226) and now considering 997/1321 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 460/686 places, 997/1321 transitions.
RANDOM walk for 40000 steps (74 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 330488 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 330488 steps, saw 166766 distinct states, run finished after 3012 ms. (steps per millisecond=109 ) properties seen :0
[2024-06-01 11:56:18] [INFO ] Flow matrix only has 993 transitions (discarded 4 similar events)
// Phase 1: matrix 993 rows 460 cols
[2024-06-01 11:56:18] [INFO ] Computed 59 invariants in 9 ms
[2024-06-01 11:56:18] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 371/448 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/456 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 992/1448 variables, 456/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1448 variables, 42/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1448 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/1453 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1453 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1453 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1453 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1453/1453 variables, and 561 constraints, problems are : Problem set: 0 solved, 2 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 460/460 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 371/448 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/456 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 992/1448 variables, 456/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1448 variables, 42/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1448 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1453 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1453 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1453 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1453 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1453 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1453 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1453/1453 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 460/460 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2234ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 244 ms.
Support contains 77 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 997/997 transitions.
Applied a total of 0 rules in 23 ms. Remains 460 /460 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 460/460 places, 997/997 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 997/997 transitions.
Applied a total of 0 rules in 21 ms. Remains 460 /460 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2024-06-01 11:56:21] [INFO ] Flow matrix only has 993 transitions (discarded 4 similar events)
[2024-06-01 11:56:21] [INFO ] Invariant cache hit.
[2024-06-01 11:56:21] [INFO ] Implicit Places using invariants in 373 ms returned [216]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 381 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 459/460 places, 997/997 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 996
Applied a total of 2 rules in 34 ms. Remains 459 /459 variables (removed 0) and now considering 996/997 (removed 1) transitions.
[2024-06-01 11:56:21] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
// Phase 1: matrix 992 rows 459 cols
[2024-06-01 11:56:21] [INFO ] Computed 58 invariants in 4 ms
[2024-06-01 11:56:21] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 11:56:21] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
[2024-06-01 11:56:21] [INFO ] Invariant cache hit.
[2024-06-01 11:56:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 11:56:22] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 459/460 places, 996/997 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1264 ms. Remains : 459/460 places, 996/997 transitions.
RANDOM walk for 40000 steps (112 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 374159 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 374159 steps, saw 175336 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-01 11:56:25] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
[2024-06-01 11:56:25] [INFO ] Invariant cache hit.
[2024-06-01 11:56:25] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 370/447 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/455 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 991/1446 variables, 455/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1446 variables, 41/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1446 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/1451 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1451 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1451 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1451 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1451/1451 variables, and 558 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 459/459 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 370/447 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/455 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 991/1446 variables, 455/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1446 variables, 41/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1446 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1446 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/1451 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1451 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1451 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1451 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1451 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1451/1451 variables, and 564 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 459/459 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2148ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 414 ms.
Support contains 77 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 996/996 transitions.
Applied a total of 0 rules in 11 ms. Remains 459 /459 variables (removed 0) and now considering 996/996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 459/459 places, 996/996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 996/996 transitions.
Applied a total of 0 rules in 10 ms. Remains 459 /459 variables (removed 0) and now considering 996/996 (removed 0) transitions.
[2024-06-01 11:56:28] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
[2024-06-01 11:56:28] [INFO ] Invariant cache hit.
[2024-06-01 11:56:28] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-06-01 11:56:28] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
[2024-06-01 11:56:28] [INFO ] Invariant cache hit.
[2024-06-01 11:56:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 11:56:29] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2024-06-01 11:56:29] [INFO ] Redundant transitions in 49 ms returned []
Running 994 sub problems to find dead transitions.
[2024-06-01 11:56:29] [INFO ] Flow matrix only has 992 transitions (discarded 4 similar events)
[2024-06-01 11:56:29] [INFO ] Invariant cache hit.
[2024-06-01 11:56:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:56:43] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 4 ms to minimize.
[2024-06-01 11:56:44] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 3 ms to minimize.
[2024-06-01 11:56:44] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-06-01 11:56:44] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 6 ms to minimize.
[2024-06-01 11:56:44] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 4 ms to minimize.
[2024-06-01 11:56:45] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 4 ms to minimize.
[2024-06-01 11:56:45] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-06-01 11:56:45] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 3 ms to minimize.
[2024-06-01 11:56:45] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-06-01 11:56:45] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
[2024-06-01 11:56:46] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 3 ms to minimize.
[2024-06-01 11:56:46] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
[2024-06-01 11:56:46] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-06-01 11:56:46] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:56:54] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 3 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:56:56] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:56:57] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:56:58] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:56:58] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1451 variables, and 100 constraints, problems are : Problem set: 0 solved, 994 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/459 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 994/994 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 994 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 3 (OVERLAPS) 1/459 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 994 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:57:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:57:12] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:57:12] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:57:12] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-06-01 11:57:13] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:57:13] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 11:57:13] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:57:14] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:57:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:57:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-06-01 11:57:22] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:57:23] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:57:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 994 unsolved
[2024-06-01 11:57:25] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:57:25] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:57:25] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:57:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1451 variables, and 135 constraints, problems are : Problem set: 0 solved, 994 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/459 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/994 constraints, Known Traps: 77/77 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 994 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61629 ms. Remains : 459/459 places, 996/996 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 459 transition count 992
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 459 transition count 980
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 459 transition count 980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 459 transition count 979
Applied a total of 29 rules in 42 ms. Remains 459 /459 variables (removed 0) and now considering 979/996 (removed 17) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 979 rows 459 cols
[2024-06-01 11:57:29] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 11:57:30] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 11:57:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2024-06-01 11:57:30] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 11:57:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
TRAPS : Iteration 1
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 2
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 355 ms
TRAPS : Iteration 3
[2024-06-01 11:57:33] [INFO ] After 2908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 11:57:33] [INFO ] After 3269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 3541 ms.
[2024-06-01 11:57:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 11:57:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 459 places, 996 transitions and 3765 arcs took 9 ms.
[2024-06-01 11:57:33] [INFO ] Flatten gal took : 109 ms
Total runtime 95337 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 : NoC3x3-PT-5B-ReachabilityFireability-2024-04
Could not compute solution for formula : NoC3x3-PT-5B-ReachabilityFireability-2024-14

BK_STOP 1717243053883

--------------------
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 NoC3x3-PT-5B-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/923/inv_0_
rfs formula name NoC3x3-PT-5B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/923/inv_1_
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="NoC3x3-PT-5B"
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-5B, 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-171654352100631"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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