About the Execution of Smart+red for DoubleExponent-PT-002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
281.447 | 133598.00 | 280337.00 | 526.00 | F | 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.r153-smll-167819440200283.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 DoubleExponent-PT-002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-smll-167819440200283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1678402205063
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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 22:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 22:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:50:07] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-09 22:50:07] [INFO ] Transformed 110 places.
[2023-03-09 22:50:07] [INFO ] Transformed 98 transitions.
[2023-03-09 22:50:07] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 154 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 99) seen :44
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Running SMT prover for 55 properties.
// Phase 1: matrix 98 rows 110 cols
[2023-03-09 22:50:10] [INFO ] Computed 14 place invariants in 16 ms
[2023-03-09 22:50:10] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2023-03-09 22:50:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 22:50:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-09 22:50:11] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :55
[2023-03-09 22:50:11] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 8 ms to minimize.
[2023-03-09 22:50:11] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2023-03-09 22:50:11] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2023-03-09 22:50:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 2 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 22:50:12] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2023-03-09 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-09 22:50:12] [INFO ] After 1650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :55
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-09 22:50:13] [INFO ] After 2559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :55
Fused 55 Parikh solutions to 50 different solutions.
Parikh walk visited 0 properties in 2727 ms.
Support contains 55 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 110 transition count 89
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 101 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 101 transition count 87
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 99 transition count 87
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 85 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 83 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 83 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 82 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 82 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 81 transition count 71
Applied a total of 60 rules in 45 ms. Remains 81 /110 variables (removed 29) and now considering 71/98 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 81/110 places, 71/98 transitions.
Interrupted random walk after 983588 steps, including 125555 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 38
Incomplete Best-First random walk after 100001 steps, including 8423 resets, run finished after 1871 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8460 resets, run finished after 1833 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8522 resets, run finished after 1848 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8488 resets, run finished after 1905 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8401 resets, run finished after 1854 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8465 resets, run finished after 1839 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8361 resets, run finished after 2027 ms. (steps per millisecond=49 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8478 resets, run finished after 2162 ms. (steps per millisecond=46 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8438 resets, run finished after 2090 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8360 resets, run finished after 1776 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8369 resets, run finished after 1878 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8417 resets, run finished after 1818 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8509 resets, run finished after 2033 ms. (steps per millisecond=49 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8394 resets, run finished after 1956 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8426 resets, run finished after 1890 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8495 resets, run finished after 1807 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8381 resets, run finished after 1828 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 71 rows 81 cols
[2023-03-09 22:51:18] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-09 22:51:18] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 22:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 22:51:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-09 22:51:18] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 22:51:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:51:18] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 22:51:18] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2023-03-09 22:51:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-09 22:51:19] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 22:51:19] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 822 ms.
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 71/71 transitions.
Graph (complete) has 168 edges and 81 vertex of which 78 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 67 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 67 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 66 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 60 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 60 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 59 transition count 52
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 59 transition count 52
Applied a total of 43 rules in 16 ms. Remains 59 /81 variables (removed 22) and now considering 52/71 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 59/81 places, 52/71 transitions.
Incomplete random walk after 1000000 steps, including 128166 resets, run finished after 27330 ms. (steps per millisecond=36 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8510 resets, run finished after 1889 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8479 resets, run finished after 1807 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8435 resets, run finished after 1963 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8466 resets, run finished after 1682 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8391 resets, run finished after 1553 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8480 resets, run finished after 1932 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8507 resets, run finished after 1807 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8490 resets, run finished after 1620 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8487 resets, run finished after 1421 ms. (steps per millisecond=70 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8558 resets, run finished after 1768 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8405 resets, run finished after 1778 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8393 resets, run finished after 1917 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8441 resets, run finished after 1847 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8423 resets, run finished after 1669 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8512 resets, run finished after 1760 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8411 resets, run finished after 1804 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8492 resets, run finished after 1778 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Finished probabilistic random walk after 2252 steps, run visited all 17 properties in 33 ms. (steps per millisecond=68 )
Probabilistic random walk after 2252 steps, saw 1155 distinct states, run finished after 33 ms. (steps per millisecond=68 ) properties seen :17
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 129761 ms.
ITS solved all properties within timeout
BK_STOP 1678402338661
--------------------
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 StableMarking -timeout 180 -rebuildPNML
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="DoubleExponent-PT-002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DoubleExponent-PT-002, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-smll-167819440200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;