About the Execution of LTSMin+red for DES-PT-30a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 487.563 | 71263.00 | 103145.00 | 259.50 | TF??T?FF?TT?TFFT | 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.r480-tall-171624189800702.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 DES-PT-30a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800702
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 DES-PT-30a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717194503890
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:28:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:28:25] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 22:28:25] [INFO ] Transformed 234 places.
[2024-05-31 22:28:25] [INFO ] Transformed 191 transitions.
[2024-05-31 22:28:25] [INFO ] Found NUPN structural information;
[2024-05-31 22:28:25] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (894 resets) in 1702 ms. (23 steps per ms) remains 8/11 properties
FORMULA DES-PT-30a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (212 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 355 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (178 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (169 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (184 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (180 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (196 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (222 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
// Phase 1: matrix 177 rows 234 cols
[2024-05-31 22:28:26] [INFO ] Computed 59 invariants in 26 ms
[2024-05-31 22:28:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 33/109 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 33/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 21/130 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 79/209 variables, 21/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 79/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 3/212 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem DES-PT-30a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DES-PT-30a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DES-PT-30a-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DES-PT-30a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 176/388 variables, 212/483 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 1/484 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/484 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 23/411 variables, 22/506 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/411 variables, 22/528 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 0/528 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/411 variables, 0/528 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 528 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3292 ms.
Refiners :[Domain max(s): 234/234 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 234/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 35/90 variables, 21/76 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 35/111 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 27/117 variables, 13/126 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 27/153 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/154 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 90/207 variables, 21/175 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 90/265 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-31 22:28:30] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 1/266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/210 variables, 1/267 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/270 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem DES-PT-30a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DES-PT-30a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (OVERLAPS) 176/386 variables, 210/480 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/386 variables, 1/481 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/386 variables, 2/483 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/483 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 25/411 variables, 24/507 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/411 variables, 24/531 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 3/534 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/534 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 22:28:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:28:33] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/411 variables, 2/536 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 536 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 234/234 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 234/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 8429ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 233 transition count 174
Applied a total of 8 rules in 59 ms. Remains 233 /234 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 233/234 places, 174/177 transitions.
RANDOM walk for 40000 steps (609 resets) in 486 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (113 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (113 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (107 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (122 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 906616 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 5
Probabilistic random walk after 906616 steps, saw 129194 distinct states, run finished after 3005 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 174 rows 233 cols
[2024-05-31 22:28:38] [INFO ] Computed 61 invariants in 8 ms
[2024-05-31 22:28:38] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/85 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 32/117 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 93/210 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 174/384 variables, 210/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 23/407 variables, 23/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 298 constraints, problems are : Problem set: 0 solved, 5 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/85 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 32/117 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 93/210 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:28:39] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 174/384 variables, 210/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 23/407 variables, 23/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:28:40] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:28:40] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/407 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 306 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 3490ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 7628 ms.
Support contains 48 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 12 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 22:28:49] [INFO ] Invariant cache hit.
[2024-05-31 22:28:49] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-31 22:28:49] [INFO ] Invariant cache hit.
[2024-05-31 22:28:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:28:50] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-31 22:28:50] [INFO ] Redundant transitions in 6 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-31 22:28:50] [INFO ] Invariant cache hit.
[2024-05-31 22:28:50] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/407 variables, 233/294 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/407 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:28:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 300 constraints, problems are : Problem set: 0 solved, 173 unsolved in 13106 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:29:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 174/407 variables, 233/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 173/474 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:29:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:29:13] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:29:13] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:29:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:29:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:29:23] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 481 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 10/10 constraints]
After SMT, in 43236ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 43240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43708 ms. Remains : 233/233 places, 174/174 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 174
Applied a total of 1 rules in 15 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 174 rows 233 cols
[2024-05-31 22:29:33] [INFO ] Computed 61 invariants in 5 ms
[2024-05-31 22:29:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 22:29:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-31 22:29:33] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-31 22:29:33] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 22:29:34] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:29:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-31 22:29:34] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 22:29:34] [INFO ] After 1066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1167 ms.
[2024-05-31 22:29:34] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-31 22:29:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 174 transitions and 879 arcs took 4 ms.
[2024-05-31 22:29:34] [INFO ] Flatten gal took : 48 ms
Total runtime 69672 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 : DES-PT-30a-ReachabilityCardinality-2024-02
Could not compute solution for formula : DES-PT-30a-ReachabilityCardinality-2024-03
Could not compute solution for formula : DES-PT-30a-ReachabilityCardinality-2024-05
Could not compute solution for formula : DES-PT-30a-ReachabilityCardinality-2024-08
Could not compute solution for formula : DES-PT-30a-ReachabilityCardinality-2024-11
BK_STOP 1717194575153
--------------------
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 DES-PT-30a-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/586/inv_0_
rfs formula name DES-PT-30a-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/586/inv_1_
rfs formula name DES-PT-30a-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/586/inv_2_
rfs formula name DES-PT-30a-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/586/inv_3_
rfs formula name DES-PT-30a-ReachabilityCardinality-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/586/inv_4_
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="DES-PT-30a"
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 DES-PT-30a, 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 r480-tall-171624189800702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;