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.r107-tall-167814484600727.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 smartxred
Input is DLCround-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484600727
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 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.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 DLCround-PT-09b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678419211991

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 03:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 03:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 03:33:33] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-10 03:33:33] [INFO ] Transformed 3495 places.
[2023-03-10 03:33:33] [INFO ] Transformed 5439 transitions.
[2023-03-10 03:33:33] [INFO ] Found NUPN structural information;
[2023-03-10 03:33:33] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 16) seen :7
FORMULA DLCround-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5439 rows 3495 cols
[2023-03-10 03:33:34] [INFO ] Computed 184 place invariants in 51 ms
[2023-03-10 03:33:36] [INFO ] After 1284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-10 03:33:37] [INFO ] [Nat]Absence check using 184 positive place invariants in 154 ms returned sat
[2023-03-10 03:33:41] [INFO ] After 3614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-10 03:33:42] [INFO ] Deduced a trap composed of 134 places in 512 ms of which 5 ms to minimize.
[2023-03-10 03:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 848 ms
[2023-03-10 03:33:43] [INFO ] Deduced a trap composed of 198 places in 537 ms of which 2 ms to minimize.
[2023-03-10 03:33:44] [INFO ] Deduced a trap composed of 206 places in 454 ms of which 1 ms to minimize.
[2023-03-10 03:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1490 ms
[2023-03-10 03:33:46] [INFO ] Deduced a trap composed of 137 places in 701 ms of which 4 ms to minimize.
[2023-03-10 03:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1029 ms
[2023-03-10 03:33:47] [INFO ] After 9479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1814 ms.
[2023-03-10 03:33:49] [INFO ] After 12766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA DLCround-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 487 ms.
Support contains 96 out of 3495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3073 edges and 3495 vertex of which 506 / 3495 are part of one of the 42 SCC in 12 ms
Free SCC test removed 464 places
Drop transitions removed 522 transitions
Reduce isomorphic transitions removed 522 transitions.
Drop transitions removed 1240 transitions
Trivial Post-agglo rules discarded 1240 transitions
Performed 1240 trivial Post agglomeration. Transition count delta: 1240
Iterating post reduction 0 with 1240 rules applied. Total rules applied 1241 place count 3031 transition count 3677
Reduce places removed 1240 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 1299 rules applied. Total rules applied 2540 place count 1791 transition count 3618
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 34 rules applied. Total rules applied 2574 place count 1763 transition count 3612
Reduce places removed 2 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 3 with 37 rules applied. Total rules applied 2611 place count 1761 transition count 3577
Reduce places removed 35 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 39 rules applied. Total rules applied 2650 place count 1726 transition count 3573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2651 place count 1725 transition count 3573
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 2651 place count 1725 transition count 3547
Deduced a syphon composed of 26 places in 16 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 2703 place count 1699 transition count 3547
Discarding 433 places :
Symmetric choice reduction at 6 with 433 rule applications. Total rules 3136 place count 1266 transition count 3114
Iterating global reduction 6 with 433 rules applied. Total rules applied 3569 place count 1266 transition count 3114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3573 place count 1266 transition count 3110
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 179 Pre rules applied. Total rules applied 3573 place count 1266 transition count 2931
Deduced a syphon composed of 179 places in 38 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 7 with 358 rules applied. Total rules applied 3931 place count 1087 transition count 2931
Discarding 45 places :
Symmetric choice reduction at 7 with 45 rule applications. Total rules 3976 place count 1042 transition count 2379
Iterating global reduction 7 with 45 rules applied. Total rules applied 4021 place count 1042 transition count 2379
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 4033 place count 1042 transition count 2367
Performed 260 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 260 places in 1 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 8 with 520 rules applied. Total rules applied 4553 place count 782 transition count 2100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 4559 place count 782 transition count 2094
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 4563 place count 778 transition count 2042
Iterating global reduction 9 with 4 rules applied. Total rules applied 4567 place count 778 transition count 2042
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -565
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 9 with 114 rules applied. Total rules applied 4681 place count 721 transition count 2607
Drop transitions removed 55 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 9 with 58 rules applied. Total rules applied 4739 place count 721 transition count 2549
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 4747 place count 713 transition count 2339
Iterating global reduction 10 with 8 rules applied. Total rules applied 4755 place count 713 transition count 2339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 4761 place count 713 transition count 2333
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4765 place count 711 transition count 2358
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 4767 place count 711 transition count 2356
Drop transitions removed 148 transitions
Redundant transition composition rules discarded 148 transitions
Iterating global reduction 12 with 148 rules applied. Total rules applied 4915 place count 711 transition count 2208
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 4922 place count 704 transition count 2109
Iterating global reduction 12 with 7 rules applied. Total rules applied 4929 place count 704 transition count 2109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4935 place count 704 transition count 2103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 4939 place count 702 transition count 2125
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 4942 place count 702 transition count 2122
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 14 with 12 rules applied. Total rules applied 4954 place count 702 transition count 2110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4956 place count 701 transition count 2120
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4957 place count 701 transition count 2119
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 4958 place count 701 transition count 2118
Free-agglomeration rule applied 313 times with reduction of 123 identical transitions.
Iterating global reduction 15 with 313 rules applied. Total rules applied 5271 place count 701 transition count 1682
Reduce places removed 313 places and 0 transitions.
Drop transitions removed 354 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 368 transitions.
Graph (complete) has 1442 edges and 388 vertex of which 383 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 682 rules applied. Total rules applied 5953 place count 383 transition count 1314
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 5963 place count 383 transition count 1304
Discarding 19 places :
Symmetric choice reduction at 17 with 19 rule applications. Total rules 5982 place count 364 transition count 1233
Iterating global reduction 17 with 19 rules applied. Total rules applied 6001 place count 364 transition count 1233
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 17 with 45 rules applied. Total rules applied 6046 place count 364 transition count 1188
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 6047 place count 364 transition count 1187
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 6056 place count 363 transition count 1179
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 6058 place count 363 transition count 1177
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 6059 place count 363 transition count 1206
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 6068 place count 362 transition count 1198
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 19 with 14 rules applied. Total rules applied 6082 place count 362 transition count 1184
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 19 with 12 rules applied. Total rules applied 6094 place count 362 transition count 1184
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 6097 place count 362 transition count 1181
Applied a total of 6097 rules in 1118 ms. Remains 362 /3495 variables (removed 3133) and now considering 1181/5439 (removed 4258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1119 ms. Remains : 362/3495 places, 1181/5439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
FORMULA DLCround-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 03:33:51] [INFO ] Flow matrix only has 594 transitions (discarded 587 similar events)
// Phase 1: matrix 594 rows 362 cols
[2023-03-10 03:33:51] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-10 03:33:51] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 03:33:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-10 03:33:51] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 03:33:51] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-10 03:33:51] [INFO ] After 151ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 03:33:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-10 03:33:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-10 03:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-10 03:33:51] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-10 03:33:52] [INFO ] After 963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 80 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 1181/1181 transitions.
Graph (trivial) has 42 edges and 362 vertex of which 5 / 362 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 rules applied. Total rules applied 2 place count 359 transition count 1175
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 4 place count 358 transition count 1174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 357 transition count 1174
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5 place count 357 transition count 1171
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 354 transition count 1171
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 354 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 14 place count 353 transition count 1166
Iterating global reduction 4 with 1 rules applied. Total rules applied 15 place count 353 transition count 1166
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 4 with 6 rules applied. Total rules applied 21 place count 350 transition count 1163
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 32 place count 350 transition count 1152
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 34 place count 348 transition count 1129
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 348 transition count 1129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 348 transition count 1128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 39 place count 347 transition count 1136
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 47 place count 347 transition count 1128
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 62 place count 347 transition count 1113
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 74 place count 347 transition count 1099
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 1192 edges and 335 vertex of which 334 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 54 rules applied. Total rules applied 128 place count 334 transition count 1058
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 150 place count 312 transition count 984
Iterating global reduction 8 with 22 rules applied. Total rules applied 172 place count 312 transition count 984
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 178 place count 312 transition count 978
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 312 transition count 983
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 186 place count 311 transition count 977
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 193 place count 311 transition count 970
Applied a total of 193 rules in 121 ms. Remains 311 /362 variables (removed 51) and now considering 970/1181 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 311/362 places, 970/1181 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 353297 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353297 steps, saw 299148 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 03:33:55] [INFO ] Flow matrix only has 504 transitions (discarded 466 similar events)
// Phase 1: matrix 504 rows 311 cols
[2023-03-10 03:33:55] [INFO ] Computed 137 place invariants in 7 ms
[2023-03-10 03:33:55] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 03:33:55] [INFO ] [Nat]Absence check using 137 positive place invariants in 16 ms returned sat
[2023-03-10 03:33:55] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 03:33:55] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 03:33:55] [INFO ] After 160ms SMT Verify possible using 126 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 03:33:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-10 03:33:56] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2023-03-10 03:33:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-10 03:33:56] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-10 03:33:56] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 80 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 970/970 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 311/311 places, 970/970 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 970/970 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-10 03:33:56] [INFO ] Flow matrix only has 504 transitions (discarded 466 similar events)
[2023-03-10 03:33:56] [INFO ] Invariant cache hit.
[2023-03-10 03:33:56] [INFO ] Implicit Places using invariants in 192 ms returned [221, 240, 241, 244, 247, 248, 253, 254, 255, 256, 259, 268, 269, 270, 271, 272, 273, 278, 281, 282, 283, 284, 285, 286, 287, 288, 291, 297, 298, 299, 304, 305, 308]
Discarding 33 places :
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Implicit Place search using SMT only with invariants took 196 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 278/311 places, 858/970 transitions.
Graph (trivial) has 37 edges and 278 vertex of which 15 / 278 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 56 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 211 transitions
Redundant transition composition rules discarded 211 transitions
Iterating global reduction 0 with 211 rules applied. Total rules applied 212 place count 270 transition count 583
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 778 edges and 267 vertex of which 265 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 216 place count 265 transition count 583
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 219 place count 265 transition count 580
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 252 place count 232 transition count 494
Iterating global reduction 2 with 33 rules applied. Total rules applied 285 place count 232 transition count 494
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 288 place count 232 transition count 491
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 291 place count 229 transition count 491
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 300 place count 229 transition count 491
Applied a total of 300 rules in 53 ms. Remains 229 /278 variables (removed 49) and now considering 491/858 (removed 367) transitions.
[2023-03-10 03:33:56] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
// Phase 1: matrix 427 rows 229 cols
[2023-03-10 03:33:56] [INFO ] Computed 68 place invariants in 5 ms
[2023-03-10 03:33:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 03:33:56] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
[2023-03-10 03:33:56] [INFO ] Invariant cache hit.
[2023-03-10 03:33:56] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-10 03:33:56] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/311 places, 491/970 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 559 ms. Remains : 229/311 places, 491/970 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 481213 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481213 steps, saw 409096 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 03:34:00] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
[2023-03-10 03:34:00] [INFO ] Invariant cache hit.
[2023-03-10 03:34:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 03:34:00] [INFO ] [Nat]Absence check using 68 positive place invariants in 9 ms returned sat
[2023-03-10 03:34:00] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 03:34:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-10 03:34:00] [INFO ] After 170ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 03:34:00] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-10 03:34:00] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 80 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 491/491 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 229/229 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-03-10 03:34:00] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
[2023-03-10 03:34:00] [INFO ] Invariant cache hit.
[2023-03-10 03:34:00] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-10 03:34:00] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
[2023-03-10 03:34:00] [INFO ] Invariant cache hit.
[2023-03-10 03:34:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-10 03:34:01] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-10 03:34:01] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-10 03:34:01] [INFO ] Flow matrix only has 427 transitions (discarded 64 similar events)
[2023-03-10 03:34:01] [INFO ] Invariant cache hit.
[2023-03-10 03:34:01] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 229/229 places, 491/491 transitions.
Graph (trivial) has 113 edges and 229 vertex of which 30 / 229 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 60 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 505 edges and 214 vertex of which 201 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 201 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 200 transition count 352
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 200 transition count 348
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 196 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 192 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 192 transition count 344
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 185 transition count 337
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 45 place count 185 transition count 326
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 183 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 183 transition count 320
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 81 place count 183 transition count 288
Reduce places removed 8 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 3 with 9 rules applied. Total rules applied 90 place count 175 transition count 287
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 174 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 173 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 173 transition count 285
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 172 transition count 285
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 172 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 96 place count 172 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 98 place count 171 transition count 283
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 99 place count 171 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 170 transition count 282
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 112 place count 170 transition count 282
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 170 transition count 281
Applied a total of 113 rules in 46 ms. Remains 170 /229 variables (removed 59) and now considering 281/491 (removed 210) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 281 rows 170 cols
[2023-03-10 03:34:01] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-10 03:34:01] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 03:34:01] [INFO ] [Nat]Absence check using 43 positive place invariants in 6 ms returned sat
[2023-03-10 03:34:01] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 03:34:01] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-10 03:34:01] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-10 03:34:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-10 03:34:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 491 transitions and 2384 arcs took 3 ms.
[2023-03-10 03:34:02] [INFO ] Flatten gal took : 82 ms
Total runtime 28598 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DLCround (PT), instance 09b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 229 places, 491 transitions, 2384 arcs.
Final Score: 5647.188
Took : 27 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678419270982

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
ERROR in file model.sm near line 3111:
syntax error

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="DLCround-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DLCround-PT-09b, 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 r107-tall-167814484600727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-09b.tgz
mv DLCround-PT-09b 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;