About the Execution of LoLa+red for ResAllocation-PT-R003C100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1787.119 | 22545.00 | 34504.00 | 177.60 | FFFTTTTTTFFTFTTT | 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.r327-tall-167889200000727.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 lolaxred
Input is ResAllocation-PT-R003C100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889200000727
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Feb 25 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 721K Mar 5 18:23 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 ResAllocation-PT-R003C100-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679055857974
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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 12:24:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 12:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 12:24:19] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-17 12:24:19] [INFO ] Transformed 600 places.
[2023-03-17 12:24:19] [INFO ] Transformed 400 transitions.
[2023-03-17 12:24:19] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 165 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 47 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 16) seen :12
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 400 rows 600 cols
[2023-03-17 12:24:20] [INFO ] Computed 300 place invariants in 19 ms
[2023-03-17 12:24:20] [INFO ] [Real]Absence check using 300 positive place invariants in 53 ms returned sat
[2023-03-17 12:24:20] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 12:24:21] [INFO ] [Nat]Absence check using 300 positive place invariants in 60 ms returned sat
[2023-03-17 12:24:21] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 552 ms
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-17 12:24:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 540 ms
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-17 12:24:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-17 12:24:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-17 12:24:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 637 ms
[2023-03-17 12:24:24] [INFO ] After 3013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 675 ms.
[2023-03-17 12:24:24] [INFO ] After 3905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 229 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 66 place count 567 transition count 367
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 67 place count 567 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 69 place count 565 transition count 366
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 565 transition count 365
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 564 transition count 364
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 97 place count 564 transition count 339
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 152 place count 509 transition count 339
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 159 place count 505 transition count 336
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 505 transition count 334
Applied a total of 161 rules in 127 ms. Remains 505 /600 variables (removed 95) and now considering 334/400 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 505/600 places, 334/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :1
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 334 rows 505 cols
[2023-03-17 12:24:25] [INFO ] Computed 268 place invariants in 9 ms
[2023-03-17 12:24:25] [INFO ] [Real]Absence check using 268 positive place invariants in 32 ms returned sat
[2023-03-17 12:24:25] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 12:24:25] [INFO ] [Nat]Absence check using 268 positive place invariants in 29 ms returned sat
[2023-03-17 12:24:25] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 237 ms
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-17 12:24:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-17 12:24:26] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-17 12:24:26] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 171 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 334/334 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 486 transition count 322
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 484 transition count 320
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 56 place count 484 transition count 299
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 99 place count 444 transition count 296
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 11 rules applied. Total rules applied 110 place count 438 transition count 291
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 438 transition count 289
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 438 transition count 287
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 433 transition count 286
Applied a total of 120 rules in 71 ms. Remains 433 /505 variables (removed 72) and now considering 286/334 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 433/505 places, 286/334 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 376575 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376575 steps, saw 191100 distinct states, run finished after 3004 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 433 cols
[2023-03-17 12:24:30] [INFO ] Computed 238 place invariants in 9 ms
[2023-03-17 12:24:30] [INFO ] [Real]Absence check using 238 positive place invariants in 26 ms returned sat
[2023-03-17 12:24:30] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 12:24:30] [INFO ] [Nat]Absence check using 238 positive place invariants in 25 ms returned sat
[2023-03-17 12:24:30] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-17 12:24:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-17 12:24:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-17 12:24:31] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2023-03-17 12:24:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 355 ms
[2023-03-17 12:24:31] [INFO ] After 844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-17 12:24:31] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
Support contains 96 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 286/286 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_75_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 431 transition count 284
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 1 with 59 rules applied. Total rules applied 61 place count 395 transition count 261
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 395 transition count 260
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 391 transition count 257
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 391 transition count 254
Ensure Unique test removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 387 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 76 place count 387 transition count 252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 383 transition count 252
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 111 place count 383 transition count 223
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_7_1.t_7_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 10 rules applied. Total rules applied 121 place count 308 transition count 213
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 132 place count 301 transition count 209
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 160 place count 284 transition count 198
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 164 place count 284 transition count 194
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 169 place count 284 transition count 189
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 185 place count 270 transition count 187
Applied a total of 185 rules in 78 ms. Remains 270 /433 variables (removed 163) and now considering 187/286 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 270/433 places, 187/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1034823 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1034823 steps, saw 349477 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 270 cols
[2023-03-17 12:24:34] [INFO ] Computed 154 place invariants in 3 ms
[2023-03-17 12:24:34] [INFO ] [Real]Absence check using 154 positive place invariants in 16 ms returned sat
[2023-03-17 12:24:34] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 12:24:34] [INFO ] [Nat]Absence check using 154 positive place invariants in 15 ms returned sat
[2023-03-17 12:24:34] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 12:24:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-17 12:24:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-17 12:24:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-17 12:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2023-03-17 12:24:34] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-17 12:24:34] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 96 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 270 /270 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 270/270 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 187/187 transitions.
Applied a total of 0 rules in 18 ms. Remains 270 /270 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-17 12:24:35] [INFO ] Invariant cache hit.
[2023-03-17 12:24:35] [INFO ] Implicit Places using invariants in 111 ms returned [0, 20, 21, 30, 31, 55, 56, 62, 65, 74, 75, 91, 93, 96, 102, 103, 122, 123, 176, 177, 178, 231, 232, 269]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 113 ms to find 24 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 246/270 places, 187/187 transitions.
Applied a total of 0 rules in 6 ms. Remains 246 /246 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 137 ms. Remains : 246/270 places, 187/187 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1264303 steps, run timeout after 3015 ms. (steps per millisecond=419 ) properties seen :{}
Probabilistic random walk after 1264303 steps, saw 432779 distinct states, run finished after 3016 ms. (steps per millisecond=419 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 246 cols
[2023-03-17 12:24:38] [INFO ] Computed 130 place invariants in 1 ms
[2023-03-17 12:24:38] [INFO ] [Real]Absence check using 130 positive place invariants in 13 ms returned sat
[2023-03-17 12:24:38] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 12:24:38] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-17 12:24:38] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 12:24:38] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-17 12:24:38] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 96 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 187/187 transitions.
Applied a total of 0 rules in 9 ms. Remains 246 /246 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 246/246 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 187/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-17 12:24:38] [INFO ] Invariant cache hit.
[2023-03-17 12:24:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-17 12:24:38] [INFO ] Invariant cache hit.
[2023-03-17 12:24:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-17 12:24:38] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-17 12:24:38] [INFO ] Invariant cache hit.
[2023-03-17 12:24:38] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 246/246 places, 187/187 transitions.
Ensure Unique test removed 12 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_51_1.t_51_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 3 place count 232 transition count 184
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 230 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 227 transition count 181
Applied a total of 11 rules in 19 ms. Remains 227 /246 variables (removed 19) and now considering 181/187 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 227 cols
[2023-03-17 12:24:38] [INFO ] Computed 115 place invariants in 1 ms
[2023-03-17 12:24:39] [INFO ] [Real]Absence check using 115 positive place invariants in 11 ms returned sat
[2023-03-17 12:24:39] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 12:24:39] [INFO ] [Nat]Absence check using 115 positive place invariants in 12 ms returned sat
[2023-03-17 12:24:39] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 12:24:39] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-17 12:24:39] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-17 12:24:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-17 12:24:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 246 places, 187 transitions and 748 arcs took 1 ms.
[2023-03-17 12:24:39] [INFO ] Flatten gal took : 41 ms
Total runtime 20180 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ResAllocation-PT-R003C100
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability
FORMULA ResAllocation-PT-R003C100-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679055880519
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 ResAllocation-PT-R003C100-ReachabilityFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ResAllocation-PT-R003C100-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ResAllocation-PT-R003C100-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 ResAllocation-PT-R003C100-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 4 (type FNDP) for ResAllocation-PT-R003C100-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 14
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for ResAllocation-PT-R003C100-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 7 (type SRCH) for ResAllocation-PT-R003C100-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ResAllocation-PT-R003C100-ReachabilityFireability-02 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ResAllocation-PT-R003C100-ReachabilityFireability-02: AG false findpath
Time elapsed: 0 secs. Pages in use: 2
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="ResAllocation-PT-R003C100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ResAllocation-PT-R003C100, 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 r327-tall-167889200000727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;