About the Execution of LTSMin+red for NoC3x3-PT-6B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3179.867 | 3600000.00 | 14250440.00 | 696.90 | TTFF?TFTFFFFTFTT | 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.r265-smll-167863539900318.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is NoC3x3-PT-6B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539900318
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678944104363
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 05:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 05:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:21:47] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-16 05:21:47] [INFO ] Transformed 1544 places.
[2023-03-16 05:21:47] [INFO ] Transformed 2229 transitions.
[2023-03-16 05:21:47] [INFO ] Found NUPN structural information;
[2023-03-16 05:21:47] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 13) seen :10
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2229 rows 1544 cols
[2023-03-16 05:21:48] [INFO ] Computed 66 place invariants in 52 ms
[2023-03-16 05:21:50] [INFO ] After 1149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 05:21:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 97 ms returned sat
[2023-03-16 05:22:10] [INFO ] After 19452ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-16 05:22:15] [INFO ] After 23859ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 05:22:15] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 39 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1544 transition count 2021
Reduce places removed 208 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 214 rules applied. Total rules applied 422 place count 1336 transition count 2015
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 428 place count 1330 transition count 2015
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 428 place count 1330 transition count 1955
Deduced a syphon composed of 60 places in 12 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 548 place count 1270 transition count 1955
Discarding 265 places :
Symmetric choice reduction at 3 with 265 rule applications. Total rules 813 place count 1005 transition count 1690
Iterating global reduction 3 with 265 rules applied. Total rules applied 1078 place count 1005 transition count 1690
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 1078 place count 1005 transition count 1656
Deduced a syphon composed of 34 places in 6 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1146 place count 971 transition count 1656
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 1252 place count 865 transition count 1310
Iterating global reduction 3 with 106 rules applied. Total rules applied 1358 place count 865 transition count 1310
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1403 place count 820 transition count 1217
Iterating global reduction 3 with 45 rules applied. Total rules applied 1448 place count 820 transition count 1217
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1468 place count 800 transition count 1177
Iterating global reduction 3 with 20 rules applied. Total rules applied 1488 place count 800 transition count 1177
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1501 place count 787 transition count 1149
Iterating global reduction 3 with 13 rules applied. Total rules applied 1514 place count 787 transition count 1149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1517 place count 784 transition count 1143
Iterating global reduction 3 with 3 rules applied. Total rules applied 1520 place count 784 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1523 place count 781 transition count 1137
Iterating global reduction 3 with 3 rules applied. Total rules applied 1526 place count 781 transition count 1137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1529 place count 781 transition count 1134
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 1829 place count 631 transition count 984
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 17 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2031 place count 530 transition count 1013
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 2101 place count 495 transition count 1034
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 2122 place count 495 transition count 1013
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 2146 place count 495 transition count 989
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2182 place count 471 transition count 977
Applied a total of 2182 rules in 1506 ms. Remains 471 /1544 variables (removed 1073) and now considering 977/2229 (removed 1252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1507 ms. Remains : 471/1544 places, 977/2229 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 267 ms. (steps per millisecond=37 ) 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 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 190307 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190307 steps, saw 101177 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 05:22:20] [INFO ] Flow matrix only has 975 transitions (discarded 2 similar events)
// Phase 1: matrix 975 rows 471 cols
[2023-03-16 05:22:20] [INFO ] Computed 66 place invariants in 14 ms
[2023-03-16 05:22:20] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 05:22:20] [INFO ] [Nat]Absence check using 66 positive place invariants in 47 ms returned sat
[2023-03-16 05:22:21] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 05:22:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 05:22:21] [INFO ] After 248ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 05:22:21] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-16 05:22:22] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 977/977 transitions.
Applied a total of 0 rules in 83 ms. Remains 471 /471 variables (removed 0) and now considering 977/977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 471/471 places, 977/977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 977/977 transitions.
Applied a total of 0 rules in 38 ms. Remains 471 /471 variables (removed 0) and now considering 977/977 (removed 0) transitions.
[2023-03-16 05:22:22] [INFO ] Flow matrix only has 975 transitions (discarded 2 similar events)
[2023-03-16 05:22:22] [INFO ] Invariant cache hit.
[2023-03-16 05:22:23] [INFO ] Implicit Places using invariants in 1396 ms returned [14, 49, 103, 151, 210, 295, 356, 450]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1398 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/471 places, 977/977 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 442 transition count 956
Applied a total of 42 rules in 31 ms. Remains 442 /463 variables (removed 21) and now considering 956/977 (removed 21) transitions.
[2023-03-16 05:22:23] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
// Phase 1: matrix 954 rows 442 cols
[2023-03-16 05:22:23] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-16 05:22:24] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-16 05:22:24] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
[2023-03-16 05:22:24] [INFO ] Invariant cache hit.
[2023-03-16 05:22:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 05:22:25] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/471 places, 956/977 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3434 ms. Remains : 442/471 places, 956/977 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:22:25] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
[2023-03-16 05:22:25] [INFO ] Invariant cache hit.
[2023-03-16 05:22:25] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:22:26] [INFO ] [Nat]Absence check using 58 positive place invariants in 25 ms returned sat
[2023-03-16 05:22:26] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 05:22:26] [INFO ] After 217ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:27] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2023-03-16 05:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-16 05:22:27] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-16 05:22:27] [INFO ] After 1659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 31 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 956/956 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 1 place count 442 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 441 transition count 955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 441 transition count 953
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 439 transition count 953
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 2 with 4 rules applied. Total rules applied 10 place count 437 transition count 951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 436 transition count 949
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 436 transition count 949
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 434 transition count 949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 433 transition count 945
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 433 transition count 945
Applied a total of 18 rules in 74 ms. Remains 433 /442 variables (removed 9) and now considering 945/956 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 433/442 places, 945/956 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216550 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216550 steps, saw 86881 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:22:30] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
// Phase 1: matrix 943 rows 433 cols
[2023-03-16 05:22:30] [INFO ] Computed 58 place invariants in 13 ms
[2023-03-16 05:22:30] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:22:31] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-16 05:22:31] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 05:22:31] [INFO ] After 170ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:31] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-16 05:22:32] [INFO ] After 1274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 945/945 transitions.
Applied a total of 0 rules in 17 ms. Remains 433 /433 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 433/433 places, 945/945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 433 /433 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2023-03-16 05:22:32] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 05:22:32] [INFO ] Invariant cache hit.
[2023-03-16 05:22:32] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-16 05:22:32] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 05:22:32] [INFO ] Invariant cache hit.
[2023-03-16 05:22:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 05:22:33] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2023-03-16 05:22:33] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-16 05:22:33] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 05:22:33] [INFO ] Invariant cache hit.
[2023-03-16 05:22:34] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1994 ms. Remains : 433/433 places, 945/945 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 433 transition count 943
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 1 with 4 rules applied. Total rules applied 6 place count 431 transition count 941
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 431 transition count 931
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 431 transition count 931
Applied a total of 18 rules in 50 ms. Remains 431 /433 variables (removed 2) and now considering 931/945 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 931 rows 431 cols
[2023-03-16 05:22:34] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-16 05:22:34] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:22:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-16 05:22:34] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-16 05:22:35] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:35] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-16 05:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-16 05:22:35] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-16 05:22:35] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:22:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-16 05:22:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 945 transitions and 3862 arcs took 8 ms.
[2023-03-16 05:22:35] [INFO ] Flatten gal took : 176 ms
Total runtime 48710 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/525/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12967244 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098736 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
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="NoC3x3-PT-6B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-6B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539900318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;