About the Execution of GreatSPN+red for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13377.088 | 3600000.00 | 14022892.00 | 420.00 | TTFF?T?F???F?F?? | 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-171683758500318.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 ShieldIIPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500318
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 686K 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 ShieldIIPt-PT-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716941521110
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 00:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 00:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:12:02] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-29 00:12:02] [INFO ] Transformed 2803 places.
[2024-05-29 00:12:02] [INFO ] Transformed 2603 transitions.
[2024-05-29 00:12:02] [INFO ] Found NUPN structural information;
[2024-05-29 00:12:02] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1750 ms. (22 steps per ms) remains 8/16 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 798 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
// Phase 1: matrix 2603 rows 2803 cols
[2024-05-29 00:12:04] [INFO ] Computed 361 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2237/2426 variables, 301/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2426 variables, 2237/2727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2426 variables, 0/2727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 377/2803 variables, 60/2787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2803 variables, 377/3164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2803 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5406 variables, 2803/5967 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5406/5406 variables, and 5967 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3963 ms.
Refiners :[Domain max(s): 2803/2803 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2803/2803 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2237/2426 variables, 301/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2426 variables, 2237/2727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:09] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 78 ms to minimize.
[2024-05-29 00:12:10] [INFO ] Deduced a trap composed of 25 places in 502 ms of which 14 ms to minimize.
[2024-05-29 00:12:10] [INFO ] Deduced a trap composed of 27 places in 445 ms of which 8 ms to minimize.
[2024-05-29 00:12:11] [INFO ] Deduced a trap composed of 20 places in 446 ms of which 9 ms to minimize.
[2024-05-29 00:12:11] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 8 ms to minimize.
[2024-05-29 00:12:12] [INFO ] Deduced a trap composed of 19 places in 481 ms of which 9 ms to minimize.
[2024-05-29 00:12:12] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 8 ms to minimize.
[2024-05-29 00:12:13] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 8 ms to minimize.
[2024-05-29 00:12:13] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 8 ms to minimize.
SMT process timed out in 9341ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 189 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2803 transition count 2042
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 563 rules applied. Total rules applied 1124 place count 2242 transition count 2040
Reduce places removed 1 places and 0 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 2 with 38 rules applied. Total rules applied 1162 place count 2241 transition count 2003
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1199 place count 2204 transition count 2003
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 1199 place count 2204 transition count 1835
Deduced a syphon composed of 168 places in 5 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1535 place count 2036 transition count 1835
Discarding 238 places :
Symmetric choice reduction at 4 with 238 rule applications. Total rules 1773 place count 1798 transition count 1597
Iterating global reduction 4 with 238 rules applied. Total rules applied 2011 place count 1798 transition count 1597
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 2011 place count 1798 transition count 1511
Deduced a syphon composed of 86 places in 10 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2183 place count 1712 transition count 1511
Performed 593 Post agglomeration using F-continuation condition.Transition count delta: 593
Deduced a syphon composed of 593 places in 3 ms
Reduce places removed 593 places and 0 transitions.
Iterating global reduction 4 with 1186 rules applied. Total rules applied 3369 place count 1119 transition count 918
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 3547 place count 1030 transition count 955
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 3558 place count 1030 transition count 944
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 3569 place count 1019 transition count 944
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 3601 place count 1019 transition count 944
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3602 place count 1019 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3603 place count 1018 transition count 943
Applied a total of 3603 rules in 973 ms. Remains 1018 /2803 variables (removed 1785) and now considering 943/2603 (removed 1660) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 1018/2803 places, 943/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 118872 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 8
Probabilistic random walk after 118872 steps, saw 73237 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 943 rows 1018 cols
[2024-05-29 00:12:18] [INFO ] Computed 361 invariants in 4 ms
[2024-05-29 00:12:18] [INFO ] State equation strengthened by 190 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 705/894 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 42/936 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 913/1849 variables, 936/1257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1849 variables, 189/1446 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1849 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 94/1943 variables, 68/1514 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1943 variables, 32/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1943 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1943 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1945 variables, 2/1549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1945 variables, 2/1551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 4/1949 variables, 2/1553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1949 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 12/1961 variables, 12/1565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1961 variables, 4/1569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1961 variables, 0/1569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/1961 variables, 0/1569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 1569 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3204 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1018/1018 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 705/894 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:21] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-05-29 00:12:21] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 3 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 3 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-29 00:12:22] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 3 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 3 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 3 ms to minimize.
[2024-05-29 00:12:23] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 3 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 7 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-29 00:12:24] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:12:25] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/894 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 00:12:26] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 4 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-29 00:12:27] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:28] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:12:28] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-29 00:12:28] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/894 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:28] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 42/936 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 7/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-29 00:12:29] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 00:12:30] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 913/1849 variables, 936/1326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1849 variables, 189/1515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1849 variables, 3/1518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:32] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-29 00:12:33] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-29 00:12:33] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-05-29 00:12:33] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-29 00:12:33] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-29 00:12:33] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:12:34] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1849 variables, 7/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:34] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1849 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:35] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1849 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1849 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 94/1943 variables, 68/1595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1943 variables, 32/1627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1943 variables, 1/1628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1943 variables, 5/1633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:38] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-05-29 00:12:38] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:12:38] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-29 00:12:38] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
[2024-05-29 00:12:38] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 3 ms to minimize.
[2024-05-29 00:12:39] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:12:39] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:12:39] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-05-29 00:12:39] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1943 variables, 9/1642 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:40] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-29 00:12:41] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1943 variables, 2/1644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1943 variables, 0/1644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 2/1945 variables, 2/1646 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1945 variables, 2/1648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1945 variables, 0/1648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 4/1949 variables, 2/1650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1949 variables, 0/1650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 12/1961 variables, 12/1662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1961 variables, 4/1666 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 00:12:45] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1961 variables, 1/1667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1961 variables, 0/1667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 0/1961 variables, 0/1667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 1667 constraints, problems are : Problem set: 0 solved, 8 unsolved in 27023 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1018/1018 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 90/90 constraints]
After SMT, in 30311ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 14876 ms.
Support contains 189 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 943/943 transitions.
Applied a total of 0 rules in 54 ms. Remains 1018 /1018 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1018/1018 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 943/943 transitions.
Applied a total of 0 rules in 38 ms. Remains 1018 /1018 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2024-05-29 00:13:03] [INFO ] Invariant cache hit.
[2024-05-29 00:13:03] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-29 00:13:03] [INFO ] Invariant cache hit.
[2024-05-29 00:13:04] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-29 00:13:06] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3192 ms to find 0 implicit places.
[2024-05-29 00:13:06] [INFO ] Redundant transitions in 57 ms returned []
Running 926 sub problems to find dead transitions.
[2024-05-29 00:13:06] [INFO ] Invariant cache hit.
[2024-05-29 00:13:06] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 2 (OVERLAPS) 17/1018 variables, 300/361 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-05-29 00:13:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 00:13:34] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 00:13:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 00:13:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 00:13:37] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 30274ms, After SMT, problems are : Problem set: 0 solved, 926 unsolved
Search for dead transitions found 0 dead transitions in 30287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33590 ms. Remains : 1018/1018 places, 943/943 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2560 edges and 1018 vertex of which 1016 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 1016 transition count 942
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1015 transition count 942
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 103 place count 1015 transition count 942
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 107 place count 1015 transition count 938
Applied a total of 107 rules in 127 ms. Remains 1015 /1018 variables (removed 3) and now considering 938/943 (removed 5) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 938 rows 1015 cols
[2024-05-29 00:13:37] [INFO ] Computed 359 invariants in 7 ms
[2024-05-29 00:13:37] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 00:13:37] [INFO ] [Nat]Absence check using 359 positive place invariants in 55 ms returned sat
[2024-05-29 00:13:38] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 00:13:38] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-29 00:13:39] [INFO ] After 714ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-29 00:13:39] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 4 ms to minimize.
[2024-05-29 00:13:40] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-29 00:13:40] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-05-29 00:13:40] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:13:40] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-29 00:13:40] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:13:41] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:13:42] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3646 ms
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2024-05-29 00:13:43] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 3 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-05-29 00:13:44] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 4 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-29 00:13:45] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-29 00:13:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3295 ms
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 4 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:13:47] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 3 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 3 ms to minimize.
[2024-05-29 00:13:48] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2132 ms
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 3 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-29 00:13:49] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 00:13:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1608 ms
[2024-05-29 00:13:51] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2024-05-29 00:13:51] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-29 00:13:51] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-29 00:13:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
TRAPS : Iteration 1
[2024-05-29 00:13:51] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 3 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1010 ms
[2024-05-29 00:13:52] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 4 ms to minimize.
[2024-05-29 00:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 3 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:13:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 613 ms
[2024-05-29 00:13:54] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
[2024-05-29 00:13:54] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-05-29 00:13:54] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-29 00:13:54] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-29 00:13:55] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 4 ms to minimize.
[2024-05-29 00:13:55] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-05-29 00:13:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1256 ms
[2024-05-29 00:13:55] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:13:55] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-29 00:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
TRAPS : Iteration 2
[2024-05-29 00:13:56] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-29 00:13:56] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-29 00:13:56] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-05-29 00:13:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2024-05-29 00:13:56] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2024-05-29 00:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-05-29 00:13:57] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-05-29 00:13:57] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-05-29 00:13:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2024-05-29 00:13:58] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-05-29 00:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-29 00:13:58] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-29 00:13:58] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-29 00:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
TRAPS : Iteration 3
[2024-05-29 00:13:59] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 3 ms to minimize.
[2024-05-29 00:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-29 00:14:00] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 4 ms to minimize.
[2024-05-29 00:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-29 00:14:00] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-29 00:14:01] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-29 00:14:01] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 4 ms to minimize.
[2024-05-29 00:14:01] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 3 ms to minimize.
[2024-05-29 00:14:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1035 ms
[2024-05-29 00:14:02] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 3 ms to minimize.
[2024-05-29 00:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
TRAPS : Iteration 4
[2024-05-29 00:14:02] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:14:02] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
[2024-05-29 00:14:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2024-05-29 00:14:03] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-29 00:14:03] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-05-29 00:14:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2024-05-29 00:14:04] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-29 00:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 5
[2024-05-29 00:14:05] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 15 ms to minimize.
[2024-05-29 00:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-05-29 00:14:05] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
TRAPS : Iteration 6
[2024-05-29 00:14:06] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-05-29 00:14:06] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 3 ms to minimize.
[2024-05-29 00:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-29 00:14:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:14:07] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-29 00:14:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2024-05-29 00:14:08] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-29 00:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
TRAPS : Iteration 7
[2024-05-29 00:14:09] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-29 00:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
TRAPS : Iteration 8
[2024-05-29 00:14:10] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 4 ms to minimize.
[2024-05-29 00:14:10] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 4 ms to minimize.
[2024-05-29 00:14:10] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-29 00:14:10] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-05-29 00:14:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 817 ms
[2024-05-29 00:14:11] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 4 ms to minimize.
[2024-05-29 00:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2024-05-29 00:14:11] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:14:12] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 4 ms to minimize.
[2024-05-29 00:14:12] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-05-29 00:14:12] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-29 00:14:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 775 ms
TRAPS : Iteration 9
[2024-05-29 00:14:13] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-29 00:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-29 00:14:13] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 3 ms to minimize.
[2024-05-29 00:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
TRAPS : Iteration 10
[2024-05-29 00:14:14] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-29 00:14:15] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-05-29 00:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
TRAPS : Iteration 11
[2024-05-29 00:14:16] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 4 ms to minimize.
[2024-05-29 00:14:16] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-29 00:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 3 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-29 00:14:17] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-05-29 00:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
TRAPS : Iteration 12
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2024-05-29 00:14:19] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
[2024-05-29 00:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 13
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 3 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-29 00:14:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2024-05-29 00:14:21] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-05-29 00:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
TRAPS : Iteration 14
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 4 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-29 00:14:22] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-05-29 00:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
TRAPS : Iteration 15
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-29 00:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2024-05-29 00:14:24] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-29 00:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
TRAPS : Iteration 16
[2024-05-29 00:14:26] [INFO ] After 47298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-29 00:14:27] [INFO ] After 49797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 50250 ms.
[2024-05-29 00:14:27] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 00:14:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1018 places, 943 transitions and 3945 arcs took 16 ms.
[2024-05-29 00:14:27] [INFO ] Flatten gal took : 108 ms
Total runtime 145334 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPt-PT-040B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1018
TRANSITIONS: 943
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]
SAVING FILE /home/mcc/execution/410/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: 1340
MODEL NAME: /home/mcc/execution/410/model
1018 places, 943 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPt-PT-040B, examination is ReachabilityCardinality"
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-171683758500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;