About the Execution of LTSMin+red for FlexibleBarrier-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 694.731 | 85323.00 | 126108.00 | 279.70 | T?F?TT?TTTFFT?FT | 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-171640602500047.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-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500047
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 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 241K 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-08b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717182066193
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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:01:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-31 19:01:07] [INFO ] Transformed 920 places.
[2024-05-31 19:01:07] [INFO ] Transformed 1057 transitions.
[2024-05-31 19:01:07] [INFO ] Found NUPN structural information;
[2024-05-31 19:01:07] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (634 resets) in 1630 ms. (24 steps per ms) remains 10/16 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (73 resets) in 118 ms. (336 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 511 ms. (78 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 111 ms. (357 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (61 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (74 resets) in 575 ms. (69 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (82 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (74 resets) in 76 ms. (519 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (72 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
// Phase 1: matrix 1057 rows 920 cols
[2024-05-31 19:01:08] [INFO ] Computed 10 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 790/920 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 790/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1057/1977 variables, 920/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1977 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1977 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1977/1977 variables, and 1850 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1380 ms.
Refiners :[Domain max(s): 920/920 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 920/920 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 790/920 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/920 variables, 790/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 19:01:10] [INFO ] Deduced a trap composed of 285 places in 239 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1057/1977 variables, 920/1851 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1977 variables, 6/1857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1977 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1977 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1977/1977 variables, and 1857 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4077 ms.
Refiners :[Domain max(s): 920/920 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 920/920 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5651ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2597 ms.
Support contains 130 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 920 transition count 932
Reduce places removed 125 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 155 rules applied. Total rules applied 280 place count 795 transition count 902
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 310 place count 765 transition count 902
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 310 place count 765 transition count 822
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 470 place count 685 transition count 822
Discarding 250 places :
Symmetric choice reduction at 3 with 250 rule applications. Total rules 720 place count 435 transition count 572
Iterating global reduction 3 with 250 rules applied. Total rules applied 970 place count 435 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 971 place count 435 transition count 571
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 971 place count 435 transition count 569
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 975 place count 433 transition count 569
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 1001 place count 407 transition count 543
Iterating global reduction 4 with 26 rules applied. Total rules applied 1027 place count 407 transition count 543
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1040 place count 407 transition count 530
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 1152 place count 351 transition count 474
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1164 place count 345 transition count 484
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1165 place count 345 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1166 place count 344 transition count 483
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1170 place count 344 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1171 place count 343 transition count 482
Applied a total of 1171 rules in 206 ms. Remains 343 /920 variables (removed 577) and now considering 482/1057 (removed 575) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 343/920 places, 482/1057 transitions.
RANDOM walk for 40000 steps (1264 resets) in 615 ms. (64 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (53 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (87 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (116 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
[2024-05-31 19:01:17] [INFO ] Flow matrix only has 479 transitions (discarded 3 similar events)
// Phase 1: matrix 479 rows 343 cols
[2024-05-31 19:01:17] [INFO ] Computed 10 invariants in 4 ms
[2024-05-31 19:01:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/343 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 479/822 variables, 343/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/822 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 354 constraints, problems are : Problem set: 0 solved, 5 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 343/343 constraints, ReadFeed: 1/1 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/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/343 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:01:18] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 479/822 variables, 343/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:01:18] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:01:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/822 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:01:19] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/822 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/822 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 363 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 343/343 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2944ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FlexibleBarrier-PT-08b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2404 ms.
Support contains 107 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 343 transition count 478
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 339 transition count 478
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 339 transition count 476
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 337 transition count 476
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 333 transition count 472
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 333 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 333 transition count 471
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 41 place count 323 transition count 461
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 321 transition count 459
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 321 transition count 459
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 321 transition count 457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 53 place count 318 transition count 455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 318 transition count 455
Applied a total of 55 rules in 65 ms. Remains 318 /343 variables (removed 25) and now considering 455/482 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 318/343 places, 455/482 transitions.
RANDOM walk for 40000 steps (1446 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (65 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 696059 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 4
Probabilistic random walk after 696059 steps, saw 166581 distinct states, run finished after 3007 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-31 19:01:26] [INFO ] Flow matrix only has 451 transitions (discarded 4 similar events)
// Phase 1: matrix 451 rows 318 cols
[2024-05-31 19:01:26] [INFO ] Computed 10 invariants in 3 ms
[2024-05-31 19:01:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 451/769 variables, 318/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/769 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 329 constraints, problems are : Problem set: 0 solved, 4 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 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/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:01:26] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:01:26] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 451/769 variables, 318/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:01:27] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/769 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/769 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1714ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1238 ms.
Support contains 107 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 318 /318 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 318/318 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-05-31 19:01:29] [INFO ] Flow matrix only has 451 transitions (discarded 4 similar events)
[2024-05-31 19:01:29] [INFO ] Invariant cache hit.
[2024-05-31 19:01:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 19:01:29] [INFO ] Flow matrix only has 451 transitions (discarded 4 similar events)
[2024-05-31 19:01:29] [INFO ] Invariant cache hit.
[2024-05-31 19:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:01:29] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-31 19:01:29] [INFO ] Redundant transitions in 23 ms returned []
Running 441 sub problems to find dead transitions.
[2024-05-31 19:01:29] [INFO ] Flow matrix only has 451 transitions (discarded 4 similar events)
[2024-05-31 19:01:29] [INFO ] Invariant cache hit.
[2024-05-31 19:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 9/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 19:01:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:01:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:01:33] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:01:35] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:01:35] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2024-05-31 19:01:35] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:01:35] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:01:36] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:01:36] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 19:01:38] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 19:01:43] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (OVERLAPS) 451/769 variables, 318/339 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/769 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 441 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 340 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 9/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 451/769 variables, 318/339 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 441/781 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 19:02:06] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:02:08] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 783 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 318/318 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 13/13 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60670 ms. Remains : 318/318 places, 455/455 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 318 transition count 451
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 315 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 315 transition count 448
Applied a total of 10 rules in 14 ms. Remains 315 /318 variables (removed 3) and now considering 448/455 (removed 7) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 448 rows 315 cols
[2024-05-31 19:02:29] [INFO ] Computed 10 invariants in 4 ms
[2024-05-31 19:02:29] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 19:02:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 19:02:30] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 19:02:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-31 19:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-31 19:02:30] [INFO ] After 856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 19:02:31] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1257 ms.
[2024-05-31 19:02:31] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-31 19:02:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 318 places, 455 transitions and 1443 arcs took 6 ms.
[2024-05-31 19:02:31] [INFO ] Flatten gal took : 55 ms
Total runtime 83975 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-08b-ReachabilityFireability-2024-01
Could not compute solution for formula : FlexibleBarrier-PT-08b-ReachabilityFireability-2024-03
Could not compute solution for formula : FlexibleBarrier-PT-08b-ReachabilityFireability-2024-06
Could not compute solution for formula : FlexibleBarrier-PT-08b-ReachabilityFireability-2024-13
BK_STOP 1717182151516
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FlexibleBarrier-PT-08b-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/623/inv_0_
rfs formula name FlexibleBarrier-PT-08b-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/623/inv_1_
rfs formula name FlexibleBarrier-PT-08b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/623/inv_2_
rfs formula name FlexibleBarrier-PT-08b-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/623/inv_3_
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-08b"
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-08b, 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-171640602500047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08b.tgz
mv FlexibleBarrier-PT-08b 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 ;