About the Execution of GreatSPN+red for ShieldRVs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13783.792 | 3600000.00 | 13320952.00 | 2625.50 | TTTF?F??F??T?TTT | normal |
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.r355-tall-171683759700847.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 greatspnxred
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700847
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 498K 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 ShieldRVs-PT-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2023-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717060156078
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 09:09:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 09:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:09:17] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-30 09:09:17] [INFO ] Transformed 1603 places.
[2024-05-30 09:09:17] [INFO ] Transformed 1803 transitions.
[2024-05-30 09:09:17] [INFO ] Found NUPN structural information;
[2024-05-30 09:09:17] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 2255 ms. (17 steps per ms) remains 7/16 properties
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
// Phase 1: matrix 1803 rows 1603 cols
[2024-05-30 09:09:18] [INFO ] Computed 161 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1313/1468 variables, 145/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1468 variables, 1313/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1468 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 135/1603 variables, 16/1629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1603 variables, 135/1764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 0/1764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1803/3406 variables, 1603/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 3367 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2803 ms.
Refiners :[Domain max(s): 1603/1603 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1603/1603 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1313/1468 variables, 145/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1468 variables, 1313/1613 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 09:09:22] [INFO ] Deduced a trap composed of 27 places in 552 ms of which 54 ms to minimize.
[2024-05-30 09:09:23] [INFO ] Deduced a trap composed of 15 places in 627 ms of which 7 ms to minimize.
[2024-05-30 09:09:23] [INFO ] Deduced a trap composed of 21 places in 467 ms of which 9 ms to minimize.
[2024-05-30 09:09:24] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 11 ms to minimize.
[2024-05-30 09:09:24] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 5 ms to minimize.
[2024-05-30 09:09:25] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 4 ms to minimize.
[2024-05-30 09:09:25] [INFO ] Deduced a trap composed of 35 places in 441 ms of which 12 ms to minimize.
[2024-05-30 09:09:25] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 12 ms to minimize.
[2024-05-30 09:09:26] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 11 ms to minimize.
[2024-05-30 09:09:26] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 7 ms to minimize.
SMT process timed out in 8039ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 1603 transition count 1678
Reduce places removed 125 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 133 rules applied. Total rules applied 258 place count 1478 transition count 1670
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 266 place count 1470 transition count 1670
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 266 place count 1470 transition count 1479
Deduced a syphon composed of 191 places in 2 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 648 place count 1279 transition count 1479
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 888 place count 1039 transition count 1239
Iterating global reduction 3 with 240 rules applied. Total rules applied 1128 place count 1039 transition count 1239
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 1128 place count 1039 transition count 1173
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 1260 place count 973 transition count 1173
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 2 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 3 with 512 rules applied. Total rules applied 1772 place count 717 transition count 917
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 1840 place count 717 transition count 917
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1841 place count 716 transition count 916
Applied a total of 1841 rules in 746 ms. Remains 716 /1603 variables (removed 887) and now considering 916/1803 (removed 887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 716/1603 places, 916/1803 transitions.
RANDOM walk for 40000 steps (52 resets) in 636 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
// Phase 1: matrix 916 rows 716 cols
[2024-05-30 09:09:28] [INFO ] Computed 161 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 526/641 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/716 variables, 22/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 916/1632 variables, 716/877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1632 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1632 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 877 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 716/716 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/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 526/641 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:29] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:09:29] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:09:29] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-30 09:09:29] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 4 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-30 09:09:30] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 5 ms to minimize.
[2024-05-30 09:09:31] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:32] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:33] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 75/716 variables, 22/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:09:34] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 8/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:35] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/716 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:36] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:09:36] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:09:36] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/716 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 916/1632 variables, 716/943 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1632 variables, 6/949 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:37] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2024-05-30 09:09:37] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-30 09:09:37] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-30 09:09:38] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-30 09:09:39] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-30 09:09:39] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-05-30 09:09:39] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-30 09:09:39] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 09:09:39] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 09:09:40] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1632 variables, 20/969 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:41] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:09:41] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:09:41] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-30 09:09:41] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:09:42] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:09:43] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1632 variables, 11/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1632 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1632 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 980 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14914 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 716/716 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 97/97 constraints]
After SMT, in 15972ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1515 ms.
Support contains 115 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 916/916 transitions.
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 0 with 5 rules applied. Total rules applied 5 place count 716 transition count 911
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 711 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 710 transition count 910
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 710 transition count 903
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 703 transition count 903
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 701 transition count 901
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 701 transition count 901
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 80 place count 676 transition count 876
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 676 transition count 876
Applied a total of 84 rules in 302 ms. Remains 676 /716 variables (removed 40) and now considering 876/916 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 676/716 places, 876/916 transitions.
RANDOM walk for 40000 steps (60 resets) in 427 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 200102 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 6
Probabilistic random walk after 200102 steps, saw 49358 distinct states, run finished after 3008 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 876 rows 676 cols
[2024-05-30 09:09:49] [INFO ] Computed 161 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 489/604 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 72/676 variables, 22/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 876/1552 variables, 676/837 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1552 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1552 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1552/1552 variables, and 837 constraints, problems are : Problem set: 0 solved, 6 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 676/676 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/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 489/604 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 09:09:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:09:52] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-30 09:09:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:09:54] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 72/676 variables, 22/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:09:55] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 7/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:09:56] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:57] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:09:57] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-30 09:09:57] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:57] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:57] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 876/1552 variables, 676/897 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1552 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:09:58] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-30 09:09:58] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:09:58] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:09:59] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:10:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:10:01] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:10:01] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:10:01] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:10:01] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1552 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:10:02] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:10:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:10:03] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:10:03] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1552 variables, 11/934 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:10:03] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:10:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1552 variables, 2/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:10:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:10:04] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1552 variables, 2/938 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1552 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 09:10:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/1552 variables, 1/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1552 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1552 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1552/1552 variables, and 939 constraints, problems are : Problem set: 0 solved, 6 unsolved in 15946 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 676/676 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 96/96 constraints]
After SMT, in 16977ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1438 ms.
Support contains 115 out of 676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 876/876 transitions.
Applied a total of 0 rules in 17 ms. Remains 676 /676 variables (removed 0) and now considering 876/876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 676/676 places, 876/876 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 876/876 transitions.
Applied a total of 0 rules in 16 ms. Remains 676 /676 variables (removed 0) and now considering 876/876 (removed 0) transitions.
[2024-05-30 09:10:08] [INFO ] Invariant cache hit.
[2024-05-30 09:10:08] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-30 09:10:08] [INFO ] Invariant cache hit.
[2024-05-30 09:10:09] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2024-05-30 09:10:09] [INFO ] Redundant transitions in 398 ms returned []
Running 872 sub problems to find dead transitions.
[2024-05-30 09:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (OVERLAPS) 4/676 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:28] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 1 ms to minimize.
[2024-05-30 09:10:29] [INFO ] Deduced a trap composed of 10 places in 664 ms of which 0 ms to minimize.
[2024-05-30 09:10:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:10:30] [INFO ] Deduced a trap composed of 13 places in 653 ms of which 31 ms to minimize.
[2024-05-30 09:10:30] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:10:30] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:10:30] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:10:31] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:10:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:10:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/1552 variables, and 201 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (OVERLAPS) 4/676 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 40/201 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 4 ms to minimize.
[2024-05-30 09:10:49] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:10:50] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:10:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:10:51] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:10:51] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:51] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-30 09:10:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:10:52] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-30 09:10:53] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-30 09:10:54] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 09:10:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:10:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 09:10:56] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:10:57] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2024-05-30 09:10:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:10:58] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-30 09:10:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 09:10:58] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:10:59] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-30 09:11:00] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:11:00] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:11:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:11:00] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:11:01] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:11:01] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-30 09:11:01] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:11:01] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-30 09:11:01] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:11:02] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-05-30 09:11:03] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:11:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:11:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:11:04] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:11:05] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:11:06] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:11:07] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:11:07] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-30 09:11:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:11:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:11:08] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:11:09] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:11:10] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:11:10] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/1552 variables, and 338 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 0/872 constraints, Known Traps: 177/177 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 872 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62164 ms. Remains : 676/676 places, 876/876 transitions.
[2024-05-30 09:11:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 21 ms.
[2024-05-30 09:11:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 676 places, 876 transitions and 4047 arcs took 9 ms.
[2024-05-30 09:11:10] [INFO ] Flatten gal took : 226 ms
Total runtime 113840 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVs-PT-040B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 676
TRANSITIONS: 876
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1732
MODEL NAME: /home/mcc/execution/413/model
676 places, 876 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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="ShieldRVs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVs-PT-040B, 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 r355-tall-171683759700847"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B 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 '
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 ;