About the Execution of LTSMin+red for DLCshifumi-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1546.512 | 55211.00 | 89167.00 | 399.40 | TTFTTFFTTFTTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481700839.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DLCshifumi-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481700839
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 6.8K Feb 26 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.1M Mar 5 18:22 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 DLCshifumi-PT-4b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678392444065
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-4b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 20:07:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 20:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:07:25] [INFO ] Load time of PNML (sax parser for PT used): 441 ms
[2023-03-09 20:07:26] [INFO ] Transformed 15015 places.
[2023-03-09 20:07:26] [INFO ] Transformed 21341 transitions.
[2023-03-09 20:07:26] [INFO ] Found NUPN structural information;
[2023-03-09 20:07:26] [INFO ] Parsed PT model containing 15015 places and 21341 transitions and 56284 arcs in 983 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21341 rows 15015 cols
[2023-03-09 20:07:28] [INFO ] Computed 691 place invariants in 172 ms
[2023-03-09 20:07:34] [INFO ] After 5145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 20:07:40] [INFO ] [Nat]Absence check using 691 positive place invariants in 1458 ms returned sat
[2023-03-09 20:07:59] [INFO ] After 16027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 20:07:59] [INFO ] After 16058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 20:07:59] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 176 out of 15015 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15015/15015 places, 21341/21341 transitions.
Graph (trivial) has 13868 edges and 15015 vertex of which 1294 / 15015 are part of one of the 85 SCC in 37 ms
Free SCC test removed 1209 places
Drop transitions removed 1367 transitions
Reduce isomorphic transitions removed 1367 transitions.
Drop transitions removed 7178 transitions
Trivial Post-agglo rules discarded 7178 transitions
Performed 7178 trivial Post agglomeration. Transition count delta: 7178
Iterating post reduction 0 with 7178 rules applied. Total rules applied 7179 place count 13806 transition count 12796
Reduce places removed 7178 places and 0 transitions.
Ensure Unique test removed 226 transitions
Reduce isomorphic transitions removed 226 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 1 with 7627 rules applied. Total rules applied 14806 place count 6628 transition count 12347
Reduce places removed 223 places and 0 transitions.
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 2 with 360 rules applied. Total rules applied 15166 place count 6405 transition count 12210
Reduce places removed 68 places and 0 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Iterating post reduction 3 with 139 rules applied. Total rules applied 15305 place count 6337 transition count 12139
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 75 rules applied. Total rules applied 15380 place count 6266 transition count 12135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 15381 place count 6265 transition count 12135
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 139 Pre rules applied. Total rules applied 15381 place count 6265 transition count 11996
Deduced a syphon composed of 139 places in 179 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 6 with 278 rules applied. Total rules applied 15659 place count 6126 transition count 11996
Discarding 1662 places :
Symmetric choice reduction at 6 with 1662 rule applications. Total rules 17321 place count 4464 transition count 10334
Iterating global reduction 6 with 1662 rules applied. Total rules applied 18983 place count 4464 transition count 10334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 10 rules applied. Total rules applied 18993 place count 4464 transition count 10324
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 18999 place count 4460 transition count 10322
Performed 626 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 626 Pre rules applied. Total rules applied 18999 place count 4460 transition count 9696
Deduced a syphon composed of 626 places in 157 ms
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 8 with 1252 rules applied. Total rules applied 20251 place count 3834 transition count 9696
Discarding 139 places :
Symmetric choice reduction at 8 with 139 rule applications. Total rules 20390 place count 3695 transition count 8255
Iterating global reduction 8 with 139 rules applied. Total rules applied 20529 place count 3695 transition count 8255
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 8 with 126 rules applied. Total rules applied 20655 place count 3695 transition count 8129
Performed 915 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 915 places in 5 ms
Reduce places removed 915 places and 0 transitions.
Iterating global reduction 9 with 1830 rules applied. Total rules applied 22485 place count 2780 transition count 7213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 22487 place count 2780 transition count 7211
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 108 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 22689 place count 2679 transition count 7556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 22690 place count 2679 transition count 7555
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 22718 place count 2651 transition count 7331
Iterating global reduction 11 with 28 rules applied. Total rules applied 22746 place count 2651 transition count 7331
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 11 with 108 rules applied. Total rules applied 22854 place count 2651 transition count 7223
Performed 101 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 23056 place count 2550 transition count 7560
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 23060 place count 2550 transition count 7556
Discarding 35 places :
Symmetric choice reduction at 13 with 35 rule applications. Total rules 23095 place count 2515 transition count 7276
Iterating global reduction 13 with 35 rules applied. Total rules applied 23130 place count 2515 transition count 7276
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 13 with 121 rules applied. Total rules applied 23251 place count 2515 transition count 7155
Performed 86 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 14 with 172 rules applied. Total rules applied 23423 place count 2429 transition count 7801
Drop transitions removed 96 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 14 with 97 rules applied. Total rules applied 23520 place count 2429 transition count 7704
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 23526 place count 2423 transition count 7653
Iterating global reduction 15 with 6 rules applied. Total rules applied 23532 place count 2423 transition count 7653
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 15 with 23 rules applied. Total rules applied 23555 place count 2423 transition count 7630
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 16 with 133 rules applied. Total rules applied 23688 place count 2423 transition count 7497
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 23689 place count 2422 transition count 7496
Iterating global reduction 16 with 1 rules applied. Total rules applied 23690 place count 2422 transition count 7496
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 23691 place count 2421 transition count 7413
Iterating global reduction 16 with 1 rules applied. Total rules applied 23692 place count 2421 transition count 7413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 23693 place count 2421 transition count 7412
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 23699 place count 2418 transition count 7409
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 23701 place count 2416 transition count 7241
Iterating global reduction 17 with 2 rules applied. Total rules applied 23703 place count 2416 transition count 7241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 23704 place count 2416 transition count 7240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 23706 place count 2415 transition count 7252
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 23707 place count 2415 transition count 7251
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 23708 place count 2415 transition count 7250
Free-agglomeration rule applied 1282 times with reduction of 542 identical transitions.
Iterating global reduction 19 with 1282 rules applied. Total rules applied 24990 place count 2415 transition count 5426
Reduce places removed 1282 places and 0 transitions.
Drop transitions removed 1302 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 1322 transitions.
Graph (complete) has 4416 edges and 1133 vertex of which 1107 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 2605 rules applied. Total rules applied 27595 place count 1107 transition count 4104
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 20 with 104 rules applied. Total rules applied 27699 place count 1107 transition count 4000
Discarding 85 places :
Symmetric choice reduction at 21 with 85 rule applications. Total rules 27784 place count 1022 transition count 3693
Iterating global reduction 21 with 85 rules applied. Total rules applied 27869 place count 1022 transition count 3693
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 27870 place count 1022 transition count 3692
Drop transitions removed 230 transitions
Redundant transition composition rules discarded 230 transitions
Iterating global reduction 22 with 230 rules applied. Total rules applied 28100 place count 1022 transition count 3462
Discarding 8 places :
Symmetric choice reduction at 22 with 8 rule applications. Total rules 28108 place count 1014 transition count 3424
Iterating global reduction 22 with 8 rules applied. Total rules applied 28116 place count 1014 transition count 3424
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 28117 place count 1014 transition count 3423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 28118 place count 1013 transition count 3423
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 23 with 5 rules applied. Total rules applied 28123 place count 1013 transition count 3423
Applied a total of 28123 rules in 5708 ms. Remains 1013 /15015 variables (removed 14002) and now considering 3423/21341 (removed 17918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5710 ms. Remains : 1013/15015 places, 3423/21341 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 13) seen :10
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 20:08:05] [INFO ] Flow matrix only has 1284 transitions (discarded 2139 similar events)
// Phase 1: matrix 1284 rows 1013 cols
[2023-03-09 20:08:05] [INFO ] Computed 586 place invariants in 13 ms
[2023-03-09 20:08:05] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:08:05] [INFO ] [Nat]Absence check using 586 positive place invariants in 120 ms returned sat
[2023-03-09 20:08:06] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 20:08:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-03-09 20:08:07] [INFO ] After 440ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 20:08:07] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-09 20:08:07] [INFO ] After 2309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 79 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 3423/3423 transitions.
Graph (trivial) has 188 edges and 1013 vertex of which 13 / 1013 are part of one of the 6 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 3858 edges and 1006 vertex of which 984 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 984 transition count 3309
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 22 rules applied. Total rules applied 115 place count 965 transition count 3306
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 962 transition count 3306
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 118 place count 962 transition count 3285
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 160 place count 941 transition count 3285
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 165 place count 941 transition count 3280
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 214 place count 892 transition count 3003
Iterating global reduction 4 with 49 rules applied. Total rules applied 263 place count 892 transition count 3003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 892 transition count 3002
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 316 place count 866 transition count 2976
Drop transitions removed 100 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 103 transitions.
Graph (complete) has 3286 edges and 866 vertex of which 862 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 104 rules applied. Total rules applied 420 place count 862 transition count 2873
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 436 place count 862 transition count 2857
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 453 place count 845 transition count 2733
Iterating global reduction 7 with 17 rules applied. Total rules applied 470 place count 845 transition count 2733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 471 place count 845 transition count 2732
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 481 place count 840 transition count 2768
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 506 place count 840 transition count 2743
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 508 place count 838 transition count 2732
Iterating global reduction 9 with 2 rules applied. Total rules applied 510 place count 838 transition count 2732
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 520 place count 838 transition count 2722
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 10 with 62 rules applied. Total rules applied 582 place count 838 transition count 2660
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 586 place count 834 transition count 2644
Iterating global reduction 10 with 4 rules applied. Total rules applied 590 place count 834 transition count 2644
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 597 place count 834 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 598 place count 833 transition count 2571
Iterating global reduction 11 with 1 rules applied. Total rules applied 599 place count 833 transition count 2571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 600 place count 833 transition count 2570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 602 place count 832 transition count 2569
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 603 place count 831 transition count 2503
Iterating global reduction 12 with 1 rules applied. Total rules applied 604 place count 831 transition count 2503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 605 place count 831 transition count 2502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 607 place count 830 transition count 2508
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 615 place count 830 transition count 2500
Free-agglomeration rule applied 46 times with reduction of 69 identical transitions.
Iterating global reduction 13 with 46 rules applied. Total rules applied 661 place count 830 transition count 2385
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 451 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 455 transitions.
Graph (complete) has 2543 edges and 784 vertex of which 725 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Iterating post reduction 13 with 502 rules applied. Total rules applied 1163 place count 725 transition count 1883
Drop transitions removed 71 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 14 with 120 rules applied. Total rules applied 1283 place count 725 transition count 1763
Discarding 93 places :
Symmetric choice reduction at 15 with 93 rule applications. Total rules 1376 place count 632 transition count 1580
Iterating global reduction 15 with 93 rules applied. Total rules applied 1469 place count 632 transition count 1580
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1475 place count 629 transition count 1598
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 1502 place count 629 transition count 1571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1504 place count 628 transition count 1570
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1505 place count 628 transition count 1569
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 15 with 44 rules applied. Total rules applied 1549 place count 627 transition count 1526
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1552 place count 627 transition count 1523
Applied a total of 1552 rules in 548 ms. Remains 627 /1013 variables (removed 386) and now considering 1523/3423 (removed 1900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 549 ms. Remains : 627/1013 places, 1523/3423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :2
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:08:08] [INFO ] Flow matrix only has 653 transitions (discarded 870 similar events)
// Phase 1: matrix 653 rows 627 cols
[2023-03-09 20:08:08] [INFO ] Computed 388 place invariants in 15 ms
[2023-03-09 20:08:08] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:08:08] [INFO ] [Nat]Absence check using 388 positive place invariants in 60 ms returned sat
[2023-03-09 20:08:09] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:09] [INFO ] State equation strengthened by 263 read => feed constraints.
[2023-03-09 20:08:09] [INFO ] After 128ms SMT Verify possible using 263 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:09] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-09 20:08:09] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 25 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 1523/1523 transitions.
Graph (trivial) has 107 edges and 627 vertex of which 10 / 627 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1982 edges and 622 vertex of which 587 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Drop transitions removed 59 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 67 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 587 transition count 1413
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 582 transition count 1413
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 79 place count 582 transition count 1400
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 105 place count 569 transition count 1400
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 113 place count 569 transition count 1392
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 150 place count 532 transition count 1319
Iterating global reduction 3 with 37 rules applied. Total rules applied 187 place count 532 transition count 1319
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 3 with 22 rules applied. Total rules applied 209 place count 521 transition count 1308
Drop transitions removed 14 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 226 place count 521 transition count 1291
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 229 place count 518 transition count 1288
Iterating global reduction 4 with 3 rules applied. Total rules applied 232 place count 518 transition count 1288
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 246 place count 511 transition count 1326
Drop transitions removed 12 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 263 place count 511 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 510 transition count 1301
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 510 transition count 1301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 269 place count 510 transition count 1297
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 283 place count 510 transition count 1283
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 285 place count 508 transition count 1273
Iterating global reduction 6 with 2 rules applied. Total rules applied 287 place count 508 transition count 1273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 289 place count 508 transition count 1271
Free-agglomeration rule applied 21 times with reduction of 5 identical transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 310 place count 508 transition count 1245
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 153 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (complete) has 1479 edges and 487 vertex of which 442 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Iterating post reduction 7 with 176 rules applied. Total rules applied 486 place count 442 transition count 1057
Drop transitions removed 47 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 8 with 86 rules applied. Total rules applied 572 place count 442 transition count 971
Discarding 67 places :
Symmetric choice reduction at 9 with 67 rule applications. Total rules 639 place count 375 transition count 868
Iterating global reduction 9 with 67 rules applied. Total rules applied 706 place count 375 transition count 868
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 716 place count 370 transition count 884
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 719 place count 370 transition count 881
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 720 place count 370 transition count 881
Applied a total of 720 rules in 211 ms. Remains 370 /627 variables (removed 257) and now considering 881/1523 (removed 642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 370/627 places, 881/1523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 738407 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738407 steps, saw 605724 distinct states, run finished after 3003 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:08:12] [INFO ] Flow matrix only has 407 transitions (discarded 474 similar events)
// Phase 1: matrix 407 rows 370 cols
[2023-03-09 20:08:12] [INFO ] Computed 239 place invariants in 5 ms
[2023-03-09 20:08:12] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:08:13] [INFO ] [Nat]Absence check using 239 positive place invariants in 41 ms returned sat
[2023-03-09 20:08:13] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:13] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-03-09 20:08:13] [INFO ] After 97ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:13] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-09 20:08:13] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 881/881 transitions.
Applied a total of 0 rules in 14 ms. Remains 370 /370 variables (removed 0) and now considering 881/881 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 370/370 places, 881/881 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 881/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 370 /370 variables (removed 0) and now considering 881/881 (removed 0) transitions.
[2023-03-09 20:08:13] [INFO ] Flow matrix only has 407 transitions (discarded 474 similar events)
[2023-03-09 20:08:13] [INFO ] Invariant cache hit.
[2023-03-09 20:08:13] [INFO ] Implicit Places using invariants in 292 ms returned [99, 148, 154, 156, 169, 221, 227, 303, 350, 353, 356, 357, 358, 361, 362, 363, 364, 367, 368, 369]
Discarding 20 places :
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Implicit Place search using SMT only with invariants took 295 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 350/370 places, 840/881 transitions.
Graph (trivial) has 29 edges and 350 vertex of which 18 / 350 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 143 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 175 transitions.
Graph (complete) has 952 edges and 340 vertex of which 300 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 34 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 300 transition count 561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 76 place count 300 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 299 transition count 560
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 108 place count 269 transition count 525
Iterating global reduction 1 with 30 rules applied. Total rules applied 138 place count 269 transition count 525
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 268 transition count 533
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 252 place count 268 transition count 421
Reduce places removed 15 places and 0 transitions.
Graph (complete) has 651 edges and 253 vertex of which 116 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.0 ms
Discarding 137 places :
Also discarding 129 output transitions
Drop transitions removed 129 transitions
Iterating post reduction 1 with 16 rules applied. Total rules applied 268 place count 116 transition count 292
Drop transitions removed 36 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 113 rules applied. Total rules applied 381 place count 116 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 383 place count 114 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 383 place count 114 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 385 place count 113 transition count 178
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 399 place count 99 transition count 154
Iterating global reduction 4 with 14 rules applied. Total rules applied 413 place count 99 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 417 place count 97 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 421 place count 95 transition count 162
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 429 place count 95 transition count 154
Applied a total of 429 rules in 38 ms. Remains 95 /350 variables (removed 255) and now considering 154/840 (removed 686) transitions.
[2023-03-09 20:08:13] [INFO ] Flow matrix only has 129 transitions (discarded 25 similar events)
// Phase 1: matrix 129 rows 95 cols
[2023-03-09 20:08:13] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 20:08:13] [INFO ] Implicit Places using invariants in 52 ms returned [22, 29, 49, 51, 52, 57, 60, 67]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/370 places, 154/881 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 87 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 153
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 84 transition count 149
Drop transitions removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 15 place count 84 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 82 transition count 136
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 82 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 81 transition count 138
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 34 place count 81 transition count 125
Graph (complete) has 186 edges and 81 vertex of which 73 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 73 transition count 125
Drop transitions removed 11 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 57 place count 73 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 72 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 72 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 71 transition count 102
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 4 with 2 rules applied. Total rules applied 62 place count 70 transition count 101
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 70 transition count 100
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 65 place count 70 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 70 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 69 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 69 transition count 97
Applied a total of 68 rules in 16 ms. Remains 69 /87 variables (removed 18) and now considering 97/154 (removed 57) transitions.
[2023-03-09 20:08:13] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 69 cols
[2023-03-09 20:08:13] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-09 20:08:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 20:08:13] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2023-03-09 20:08:13] [INFO ] Invariant cache hit.
[2023-03-09 20:08:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-09 20:08:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 69/370 places, 97/881 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 499 ms. Remains : 69/370 places, 97/881 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2109033 steps, run timeout after 3001 ms. (steps per millisecond=702 ) properties seen :{}
Probabilistic random walk after 2109033 steps, saw 1209638 distinct states, run finished after 3001 ms. (steps per millisecond=702 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:08:16] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2023-03-09 20:08:16] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:08:17] [INFO ] [Nat]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-09 20:08:17] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-09 20:08:17] [INFO ] After 17ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:17] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:08:17] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 69/69 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-09 20:08:17] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 20:08:17] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-09 20:08:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-09 20:08:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:08:17] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2023-03-09 20:08:17] [INFO ] Invariant cache hit.
[2023-03-09 20:08:17] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 69/69 places, 97/97 transitions.
Graph (trivial) has 27 edges and 69 vertex of which 14 / 69 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 21 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 103 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 56 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 56 transition count 69
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 0 with 2 rules applied. Total rules applied 6 place count 55 transition count 68
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 55 transition count 64
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 52 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 51 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 50 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 50 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 50 transition count 60
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 20 place count 49 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 48 transition count 59
Applied a total of 21 rules in 6 ms. Remains 48 /69 variables (removed 21) and now considering 59/97 (removed 38) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 48 cols
[2023-03-09 20:08:17] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 20:08:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:08:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-09 20:08:17] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:17] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:08:17] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:08:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-09 20:08:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 97 transitions and 334 arcs took 2 ms.
[2023-03-09 20:08:17] [INFO ] Flatten gal took : 26 ms
Total runtime 52055 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/533/inv_0_ --inv-par
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678392499276
--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name DLCshifumi-PT-4b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/533/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 69 places, 97 transitions and 334 arcs
pnml2lts-sym: Petri net DLCshifumi_PT_4b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 97->55 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 69; there are 55 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/533/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.420 real 1.660 user 0.000 sys
pnml2lts-sym: max token count: 3
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="DLCshifumi-PT-4b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DLCshifumi-PT-4b, 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 r105-tall-167814481700839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b 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 ;