About the Execution of LTSMin+red for FlexibleBarrier-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 663.016 | 61823.00 | 96211.00 | 283.30 | TTTTFTTTT?TTTFFT | 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.r496-tall-171640602600063.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 FlexibleBarrier-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 374K 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 FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717182287114
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:04:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:04:48] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-31 19:04:48] [INFO ] Transformed 1402 places.
[2024-05-31 19:04:48] [INFO ] Transformed 1613 transitions.
[2024-05-31 19:04:48] [INFO ] Found NUPN structural information;
[2024-05-31 19:04:48] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (534 resets) in 2204 ms. (18 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (58 resets) in 309 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (56 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (52 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (57 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 261 ms. (152 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (59 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (59 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
// Phase 1: matrix 1613 rows 1402 cols
[2024-05-31 19:04:50] [INFO ] Computed 12 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1200/1402 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1200/1414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1613/3015 variables, 1402/2816 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3015/3015 variables, and 2816 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3506 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1200/1402 variables, 12/214 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1200/1414 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 19:04:54] [INFO ] Deduced a trap composed of 197 places in 214 ms of which 40 ms to minimize.
[2024-05-31 19:04:55] [INFO ] Deduced a trap composed of 513 places in 375 ms of which 8 ms to minimize.
[2024-05-31 19:04:55] [INFO ] Deduced a trap composed of 445 places in 411 ms of which 8 ms to minimize.
[2024-05-31 19:04:56] [INFO ] Deduced a trap composed of 472 places in 321 ms of which 6 ms to minimize.
[2024-05-31 19:04:56] [INFO ] Deduced a trap composed of 449 places in 340 ms of which 6 ms to minimize.
[2024-05-31 19:04:56] [INFO ] Deduced a trap composed of 488 places in 303 ms of which 5 ms to minimize.
[2024-05-31 19:04:57] [INFO ] Deduced a trap composed of 443 places in 294 ms of which 6 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-31 19:04:57] [INFO ] Deduced a trap composed of 481 places in 338 ms of which 6 ms to minimize.
[2024-05-31 19:04:57] [INFO ] Deduced a trap composed of 451 places in 322 ms of which 5 ms to minimize.
[2024-05-31 19:04:58] [INFO ] Deduced a trap composed of 455 places in 329 ms of which 6 ms to minimize.
[2024-05-31 19:04:58] [INFO ] Deduced a trap composed of 445 places in 326 ms of which 6 ms to minimize.
[2024-05-31 19:04:58] [INFO ] Deduced a trap composed of 449 places in 332 ms of which 6 ms to minimize.
[2024-05-31 19:04:59] [INFO ] Deduced a trap composed of 508 places in 346 ms of which 6 ms to minimize.
SMT process timed out in 9056ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 1402 transition count 1407
Reduce places removed 206 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 237 rules applied. Total rules applied 443 place count 1196 transition count 1376
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 474 place count 1165 transition count 1376
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 474 place count 1165 transition count 1243
Deduced a syphon composed of 133 places in 2 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 740 place count 1032 transition count 1243
Discarding 423 places :
Symmetric choice reduction at 3 with 423 rule applications. Total rules 1163 place count 609 transition count 820
Iterating global reduction 3 with 423 rules applied. Total rules applied 1586 place count 609 transition count 820
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1587 place count 609 transition count 819
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1587 place count 609 transition count 816
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1593 place count 606 transition count 816
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1632 place count 567 transition count 777
Iterating global reduction 4 with 39 rules applied. Total rules applied 1671 place count 567 transition count 777
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 1695 place count 567 transition count 753
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 1829 place count 500 transition count 686
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1845 place count 492 transition count 686
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1847 place count 492 transition count 684
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1849 place count 490 transition count 684
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1850 place count 490 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1851 place count 489 transition count 683
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1859 place count 489 transition count 683
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1860 place count 489 transition count 683
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1861 place count 488 transition count 682
Applied a total of 1861 rules in 361 ms. Remains 488 /1402 variables (removed 914) and now considering 682/1613 (removed 931) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 488/1402 places, 682/1613 transitions.
RANDOM walk for 40000 steps (1190 resets) in 483 ms. (82 steps per ms) remains 7/9 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (88 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (92 resets) in 115 ms. (344 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (57 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 69 ms. (571 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (90 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (86 resets) in 56 ms. (701 steps per ms) remains 4/5 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 19:04:59] [INFO ] Flow matrix only has 678 transitions (discarded 4 similar events)
// Phase 1: matrix 678 rows 488 cols
[2024-05-31 19:05:00] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:05:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 318/488 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1166 variables, 488/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1166 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1166 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/1166 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 501 constraints, problems are : Problem set: 0 solved, 4 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 488/488 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 318/488 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:05:00] [INFO ] Deduced a trap composed of 163 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:05:00] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 155 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 2 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:05:01] [INFO ] Deduced a trap composed of 151 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 19:05:02] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 678/1166 variables, 488/509 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1166 variables, 1/510 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1166 variables, 3/513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1166 variables, 0/513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1166 variables, 0/513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 513 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 488/488 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3338ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 457 ms.
Support contains 101 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 682/682 transitions.
Graph (trivial) has 157 edges and 488 vertex of which 11 / 488 are part of one of the 4 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 481 transition count 657
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 467 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 466 transition count 656
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 31 place count 466 transition count 650
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 43 place count 460 transition count 650
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 75 place count 428 transition count 618
Iterating global reduction 3 with 32 rules applied. Total rules applied 107 place count 428 transition count 618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 428 transition count 616
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 109 place count 428 transition count 615
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 427 transition count 615
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 425 transition count 613
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 425 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 425 transition count 611
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 159 place count 404 transition count 590
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 173 place count 390 transition count 576
Iterating global reduction 5 with 14 rules applied. Total rules applied 187 place count 390 transition count 576
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 201 place count 390 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 204 place count 390 transition count 559
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 263 place count 390 transition count 500
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 6 with 59 rules applied. Total rules applied 322 place count 331 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 329 place count 331 transition count 493
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 331 place count 331 transition count 493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 333 place count 329 transition count 491
Applied a total of 333 rules in 145 ms. Remains 329 /488 variables (removed 159) and now considering 491/682 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 329/488 places, 491/682 transitions.
RANDOM walk for 40000 steps (1171 resets) in 1164 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (110 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (109 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 671862 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 2
Probabilistic random walk after 671862 steps, saw 145853 distinct states, run finished after 3016 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-31 19:05:07] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
// Phase 1: matrix 482 rows 329 cols
[2024-05-31 19:05:07] [INFO ] Computed 12 invariants in 5 ms
[2024-05-31 19:05:07] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 228/329 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 482/811 variables, 329/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/811 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 228/329 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:05:07] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:05:08] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 482/811 variables, 329/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/811 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 329/329 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1144ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 32 ms.
Support contains 61 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 491/491 transitions.
Graph (trivial) has 74 edges and 329 vertex of which 7 / 329 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 325 transition count 474
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 315 transition count 474
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 315 transition count 472
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 313 transition count 472
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 46 place count 292 transition count 451
Iterating global reduction 2 with 21 rules applied. Total rules applied 67 place count 292 transition count 451
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 292 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 291 transition count 447
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 291 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 291 transition count 446
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 95 place count 280 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 280 transition count 434
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 104 place count 272 transition count 426
Iterating global reduction 5 with 8 rules applied. Total rules applied 112 place count 272 transition count 426
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 120 place count 272 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 122 place count 272 transition count 416
Free-agglomeration rule applied 24 times.
Iterating global reduction 6 with 24 rules applied. Total rules applied 146 place count 272 transition count 392
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 171 place count 248 transition count 391
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 172 place count 247 transition count 390
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 247 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 174 place count 247 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 176 place count 247 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 177 place count 246 transition count 386
Applied a total of 177 rules in 95 ms. Remains 246 /329 variables (removed 83) and now considering 386/491 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 246/329 places, 386/491 transitions.
RANDOM walk for 40000 steps (1103 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1336433 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 1336433 steps, saw 284839 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2024-05-31 19:05:11] [INFO ] Flow matrix only has 374 transitions (discarded 12 similar events)
// Phase 1: matrix 374 rows 246 cols
[2024-05-31 19:05:11] [INFO ] Computed 12 invariants in 8 ms
[2024-05-31 19:05:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 179/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/614 variables, 240/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/620 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/620 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 179/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/614 variables, 240/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:05:12] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-05-31 19:05:12] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2024-05-31 19:05:12] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/620 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:05:12] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/620 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 999ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 61 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 386/386 transitions.
Applied a total of 0 rules in 7 ms. Remains 246 /246 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 246/246 places, 386/386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 386/386 transitions.
Applied a total of 0 rules in 7 ms. Remains 246 /246 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2024-05-31 19:05:12] [INFO ] Flow matrix only has 374 transitions (discarded 12 similar events)
[2024-05-31 19:05:12] [INFO ] Invariant cache hit.
[2024-05-31 19:05:13] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 19:05:13] [INFO ] Flow matrix only has 374 transitions (discarded 12 similar events)
[2024-05-31 19:05:13] [INFO ] Invariant cache hit.
[2024-05-31 19:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:05:13] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-31 19:05:13] [INFO ] Redundant transitions in 20 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-31 19:05:13] [INFO ] Flow matrix only has 374 transitions (discarded 12 similar events)
[2024-05-31 19:05:13] [INFO ] Invariant cache hit.
[2024-05-31 19:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 4/246 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-31 19:05:17] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:05:17] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:05:17] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 1 ms to minimize.
[2024-05-31 19:05:17] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:05:18] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/620 variables, 246/263 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (OVERLAPS) 0/620 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 264 constraints, problems are : Problem set: 0 solved, 373 unsolved in 16516 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 4/246 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/620 variables, 246/263 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 373/637 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 0/620 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 637 constraints, problems are : Problem set: 0 solved, 373 unsolved in 17358 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 5/5 constraints]
After SMT, in 34174ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 34178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34698 ms. Remains : 246/246 places, 386/386 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 246 transition count 363
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 235 transition count 353
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 76 place count 203 transition count 321
Iterating global reduction 2 with 32 rules applied. Total rules applied 108 place count 203 transition count 321
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 133 place count 203 transition count 296
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 202 transition count 295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 201 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 201 transition count 294
Applied a total of 137 rules in 18 ms. Remains 201 /246 variables (removed 45) and now considering 294/386 (removed 92) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 201 cols
[2024-05-31 19:05:47] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:05:47] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 19:05:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-31 19:05:47] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 19:05:48] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2024-05-31 19:05:48] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 4 ms to minimize.
[2024-05-31 19:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
TRAPS : Iteration 1
[2024-05-31 19:05:48] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
TRAPS : Iteration 2
[2024-05-31 19:05:48] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 19:05:48] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 895 ms.
[2024-05-31 19:05:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 19:05:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 246 places, 386 transitions and 1354 arcs took 14 ms.
[2024-05-31 19:05:48] [INFO ] Flatten gal took : 52 ms
Total runtime 60466 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 : FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09
BK_STOP 1717182348937
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/673/inv_0_
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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602600063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;