About the Execution of LTSMin+red for ShieldRVt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 773.684 | 109345.00 | 159797.00 | 307.80 | ??TFTF??F?FTFT?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.r528-tall-171683762401038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 614K 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 ShieldRVt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717278269208
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:44:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:44:30] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 21:44:30] [INFO ] Transformed 2503 places.
[2024-06-01 21:44:30] [INFO ] Transformed 2503 transitions.
[2024-06-01 21:44:30] [INFO ] Found NUPN structural information;
[2024-06-01 21:44:30] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1551 ms. (25 steps per ms) remains 8/13 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 660 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 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 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-06-01 21:44:31] [INFO ] Computed 201 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1740/1877 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1877 variables, 1740/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1877 variables, 0/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 626/2503 variables, 55/2078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 626/2704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/2704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2503/5006 variables, 2503/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5006/5006 variables, and 5207 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3648 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2503/2503 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/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1740/1877 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1877 variables, 1740/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:44:36] [INFO ] Deduced a trap composed of 35 places in 432 ms of which 58 ms to minimize.
[2024-06-01 21:44:36] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 7 ms to minimize.
[2024-06-01 21:44:37] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 6 ms to minimize.
[2024-06-01 21:44:37] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 7 ms to minimize.
[2024-06-01 21:44:38] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 6 ms to minimize.
[2024-06-01 21:44:38] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 7 ms to minimize.
[2024-06-01 21:44:38] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 6 ms to minimize.
[2024-06-01 21:44:39] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 6 ms to minimize.
[2024-06-01 21:44:39] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 5 ms to minimize.
[2024-06-01 21:44:39] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 6 ms to minimize.
[2024-06-01 21:44:40] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 6 ms to minimize.
[2024-06-01 21:44:40] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 6 ms to minimize.
[2024-06-01 21:44:40] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 5 ms to minimize.
SMT process timed out in 8929ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 675 transitions
Trivial Post-agglo rules discarded 675 transitions
Performed 675 trivial Post agglomeration. Transition count delta: 675
Iterating post reduction 0 with 675 rules applied. Total rules applied 675 place count 2503 transition count 1828
Reduce places removed 675 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 718 rules applied. Total rules applied 1393 place count 1828 transition count 1785
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 1436 place count 1785 transition count 1785
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 1436 place count 1785 transition count 1588
Deduced a syphon composed of 197 places in 3 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 1830 place count 1588 transition count 1588
Discarding 300 places :
Symmetric choice reduction at 3 with 300 rule applications. Total rules 2130 place count 1288 transition count 1288
Iterating global reduction 3 with 300 rules applied. Total rules applied 2430 place count 1288 transition count 1288
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 2430 place count 1288 transition count 1169
Deduced a syphon composed of 119 places in 11 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 2668 place count 1169 transition count 1169
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 431
Deduced a syphon composed of 431 places in 1 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 3 with 862 rules applied. Total rules applied 3530 place count 738 transition count 738
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3732 place count 637 transition count 815
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 3770 place count 618 transition count 827
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3771 place count 618 transition count 826
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3772 place count 618 transition count 825
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 3775 place count 618 transition count 822
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3778 place count 615 transition count 822
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3779 place count 615 transition count 821
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3780 place count 615 transition count 821
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3781 place count 614 transition count 820
Applied a total of 3781 rules in 752 ms. Remains 614 /2503 variables (removed 1889) and now considering 820/2503 (removed 1683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 614/2503 places, 820/2503 transitions.
RANDOM walk for 40000 steps (21 resets) in 801 ms. (49 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 172 ms. (231 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
// Phase 1: matrix 820 rows 614 cols
[2024-06-01 21:44:42] [INFO ] Computed 201 invariants in 6 ms
[2024-06-01 21:44:42] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 344/453 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 144/597 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 802/1399 variables, 597/790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1399 variables, 329/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1421 variables, 10/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1421 variables, 5/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1421 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1433 variables, 6/1141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1433 variables, 2/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1433 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1434 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1434 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1434 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1434 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1434/1434 variables, and 1145 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 614/614 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 344/453 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 144/597 variables, 61/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 802/1399 variables, 597/809 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1399 variables, 329/1138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1399 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:46] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:44:47] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1399 variables, 7/1149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1399 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 22/1421 variables, 10/1159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1421 variables, 5/1164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1421 variables, 1/1165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1421 variables, 2/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1421 variables, 4/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1421 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 12/1433 variables, 6/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1433 variables, 2/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1433 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 1/1434 variables, 1/1180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1434 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1434 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/1434 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1434/1434 variables, and 1181 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9573 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 614/614 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 30/30 constraints]
After SMT, in 11396ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2342 ms.
Support contains 109 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 820/820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 614 transition count 812
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 606 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 605 transition count 811
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 18 place count 605 transition count 805
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 599 transition count 805
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 598 transition count 804
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 598 transition count 804
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 69 place count 579 transition count 786
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 572 transition count 793
Applied a total of 83 rules in 79 ms. Remains 572 /614 variables (removed 42) and now considering 793/820 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 572/614 places, 793/820 transitions.
RANDOM walk for 40000 steps (13 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 179662 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 6
Probabilistic random walk after 179662 steps, saw 99898 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 793 rows 572 cols
[2024-06-01 21:44:59] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 21:44:59] [INFO ] State equation strengthened by 353 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 122/558 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 777/1335 variables, 558/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 352/1103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1357 variables, 10/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1357 variables, 5/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1357 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1357 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 8/1365 variables, 4/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1365 variables, 2/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1365 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1365 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1365/1365 variables, and 1125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 122/558 variables, 61/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2024-06-01 21:45:01] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 777/1335 variables, 558/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1335 variables, 352/1112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1335 variables, 4/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:03] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 21:45:03] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:45:03] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1335 variables, 3/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:03] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:45:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1335 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1335 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 22/1357 variables, 10/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1357 variables, 5/1136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1357 variables, 1/1137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1357 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1357 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 8/1365 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1365 variables, 2/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 21:45:06] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1365 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1365 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1365 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1365/1365 variables, and 1146 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7126 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 15/15 constraints]
After SMT, in 8600ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3297 ms.
Support contains 109 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 793/793 transitions.
Applied a total of 0 rules in 14 ms. Remains 572 /572 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 572/572 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 793/793 transitions.
Applied a total of 0 rules in 17 ms. Remains 572 /572 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2024-06-01 21:45:11] [INFO ] Invariant cache hit.
[2024-06-01 21:45:11] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 21:45:11] [INFO ] Invariant cache hit.
[2024-06-01 21:45:11] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-06-01 21:45:13] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2024-06-01 21:45:13] [INFO ] Redundant transitions in 35 ms returned []
Running 788 sub problems to find dead transitions.
[2024-06-01 21:45:13] [INFO ] Invariant cache hit.
[2024-06-01 21:45:13] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-06-01 21:45:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:45:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:45:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:45:27] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:45:28] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:45:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:45:28] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 21:45:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:45:28] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:45:29] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:45:29] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:45:29] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:45:29] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:45:30] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 21:45:30] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-06-01 21:45:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1365 variables, and 221 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/572 constraints, ReadFeed: 0/353 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 21/221 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (OVERLAPS) 793/1365 variables, 572/793 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1365 variables, 353/1146 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1365 variables, 788/1934 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/1365 variables, and 1934 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 21/21 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62337 ms. Remains : 572/572 places, 793/793 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 129 edges and 572 vertex of which 4 / 572 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1803 edges and 570 vertex of which 568 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 566 transition count 784
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 564 transition count 783
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 564 transition count 779
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 564 transition count 747
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 77 place count 564 transition count 747
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 99 place count 564 transition count 725
Applied a total of 99 rules in 62 ms. Remains 564 /572 variables (removed 8) and now considering 725/793 (removed 68) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 725 rows 564 cols
[2024-06-01 21:46:13] [INFO ] Computed 196 invariants in 5 ms
[2024-06-01 21:46:13] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 21:46:14] [INFO ] [Nat]Absence check using 196 positive place invariants in 26 ms returned sat
[2024-06-01 21:46:14] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 21:46:14] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:46:14] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:46:14] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:46:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 275 ms
[2024-06-01 21:46:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:46:14] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-06-01 21:46:15] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:46:15] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
TRAPS : Iteration 1
[2024-06-01 21:46:15] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
TRAPS : Iteration 2
[2024-06-01 21:46:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-01 21:46:16] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 3
[2024-06-01 21:46:16] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 21:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 4
[2024-06-01 21:46:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:46:17] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 21:46:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2024-06-01 21:46:17] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 5
[2024-06-01 21:46:17] [INFO ] After 3670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 21:46:17] [INFO ] After 4115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 4323 ms.
[2024-06-01 21:46:18] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 21:46:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 572 places, 793 transitions and 3891 arcs took 7 ms.
[2024-06-01 21:46:18] [INFO ] Flatten gal took : 101 ms
Total runtime 107969 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-00
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-06
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-07
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-09
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityCardinality-2024-14
BK_STOP 1717278378553
--------------------
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
mcc2024
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/832/inv_0_
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/832/inv_1_
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/832/inv_2_
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/832/inv_3_
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/832/inv_4_
rfs formula name ShieldRVt-PT-050B-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/832/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-050B, 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 r528-tall-171683762401038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B 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 ;