About the Execution of ITS-Tools for NoC3x3-PT-4B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
856.224 | 32625.00 | 86961.00 | 386.40 | TFFFTTTTFTTFTFTF | 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.r261-smll-167863536100287.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 itstools
Input is NoC3x3-PT-4B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536100287
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 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.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 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 608K 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-4B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678849068076
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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-15 02:57:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 02:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:57:51] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2023-03-15 02:57:51] [INFO ] Transformed 2328 places.
[2023-03-15 02:57:51] [INFO ] Transformed 2701 transitions.
[2023-03-15 02:57:51] [INFO ] Found NUPN structural information;
[2023-03-15 02:57:51] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 589 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 02:57:53] [INFO ] Flatten gal took : 587 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1255 ms. (steps per millisecond=7 ) properties (out of 16) seen :7
FORMULA NoC3x3-PT-4B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
[2023-03-15 02:57:53] [INFO ] Flatten gal took : 393 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
[2023-03-15 02:57:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15351544884403934034.gal : 114 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
[2023-03-15 02:57:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4066345641361598801.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15351544884403934034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4066345641361598801.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2701 rows 2328 cols
[2023-03-15 02:57:54] [INFO ] Computed 66 place invariants in 67 ms
Loading property file /tmp/ReachabilityCardinality4066345641361598801.prop.
[2023-03-15 02:57:57] [INFO ] After 3186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 02:57:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 76 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :13 after 14
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :14 after 258
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :258 after 742
Reachability property NoC3x3-PT-4B-ReachabilityFireability-10 is true.
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :742 after 1011
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :1011 after 1218
[2023-03-15 02:58:04] [INFO ] After 4215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 02:58:04] [INFO ] Deduced a trap composed of 131 places in 569 ms of which 23 ms to minimize.
[2023-03-15 02:58:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 997 ms
[2023-03-15 02:58:08] [INFO ] Deduced a trap composed of 136 places in 415 ms of which 2 ms to minimize.
[2023-03-15 02:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2023-03-15 02:58:09] [INFO ] After 9343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1218 after 7042
Minimization took 2135 ms.
[2023-03-15 02:58:11] [INFO ] After 13826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA NoC3x3-PT-4B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 509 ms.
Support contains 27 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2253 edges and 2328 vertex of which 1091 / 2328 are part of one of the 32 SCC in 20 ms
Free SCC test removed 1059 places
Drop transitions removed 1277 transitions
Reduce isomorphic transitions removed 1277 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 1269 transition count 1198
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 263 rules applied. Total rules applied 490 place count 1043 transition count 1161
Reduce places removed 10 places and 0 transitions.
Ensure Unique test 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 2 with 12 rules applied. Total rules applied 502 place count 1033 transition count 1159
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 3 with 28 rules applied. Total rules applied 530 place count 1032 transition count 1132
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 37 rules applied. Total rules applied 567 place count 1005 transition count 1122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 569 place count 1003 transition count 1122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 569 place count 1003 transition count 1118
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 577 place count 999 transition count 1118
Discarding 312 places :
Symmetric choice reduction at 6 with 312 rule applications. Total rules 889 place count 687 transition count 806
Iterating global reduction 6 with 312 rules applied. Total rules applied 1201 place count 687 transition count 806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1202 place count 687 transition count 805
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 61 Pre rules applied. Total rules applied 1202 place count 687 transition count 744
Deduced a syphon composed of 61 places in 7 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 7 with 122 rules applied. Total rules applied 1324 place count 626 transition count 744
Discarding 53 places :
Symmetric choice reduction at 7 with 53 rule applications. Total rules 1377 place count 573 transition count 661
Iterating global reduction 7 with 53 rules applied. Total rules applied 1430 place count 573 transition count 661
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1714 place count 431 transition count 519
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1724 place count 431 transition count 509
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 17 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1748 place count 419 transition count 601
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1752 place count 419 transition count 597
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1757 place count 419 transition count 592
Free-agglomeration rule applied 168 times.
Iterating global reduction 9 with 168 rules applied. Total rules applied 1925 place count 419 transition count 424
Reduce places removed 168 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 786 edges and 251 vertex of which 234 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 196 rules applied. Total rules applied 2121 place count 234 transition count 397
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 2142 place count 234 transition count 376
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 2148 place count 234 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2150 place count 232 transition count 370
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2155 place count 232 transition count 370
Applied a total of 2155 rules in 1250 ms. Remains 232 /2328 variables (removed 2096) and now considering 370/2701 (removed 2331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1252 ms. Remains : 232/2328 places, 370/2701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 669457 steps, run timeout after 3013 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 669457 steps, saw 548262 distinct states, run finished after 3015 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 370 rows 232 cols
[2023-03-15 02:58:16] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-15 02:58:16] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 02:58:17] [INFO ] [Nat]Absence check using 59 positive place invariants in 37 ms returned sat
[2023-03-15 02:58:17] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 02:58:17] [INFO ] State equation strengthened by 139 read => feed constraints.
[2023-03-15 02:58:17] [INFO ] After 90ms SMT Verify possible using 139 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 02:58:17] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 02:58:17] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 27 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 370/370 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 370/370 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 370/370 transitions.
Applied a total of 0 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2023-03-15 02:58:17] [INFO ] Invariant cache hit.
[2023-03-15 02:58:18] [INFO ] Implicit Places using invariants in 587 ms returned [35, 36, 49, 61, 62, 90, 122, 123, 124, 139, 151, 160, 163, 174, 190, 208, 216, 229, 230, 231]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 615 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 212/232 places, 370/370 transitions.
Graph (trivial) has 87 edges and 212 vertex of which 24 / 212 are part of one of the 6 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 194 transition count 316
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 59 place count 170 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 59 place count 170 transition count 304
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 63 place count 168 transition count 304
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 163 transition count 299
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 163 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 161 transition count 292
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 101 place count 161 transition count 278
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 109 place count 161 transition count 270
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 115 place count 161 transition count 270
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 161 transition count 267
Applied a total of 118 rules in 172 ms. Remains 161 /212 variables (removed 51) and now considering 267/370 (removed 103) transitions.
// Phase 1: matrix 267 rows 161 cols
[2023-03-15 02:58:18] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-15 02:58:18] [INFO ] Implicit Places using invariants in 196 ms returned [160]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 160/232 places, 267/370 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 159 transition count 261
Applied a total of 7 rules in 50 ms. Remains 159 /160 variables (removed 1) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 159 cols
[2023-03-15 02:58:18] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-15 02:58:18] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-15 02:58:18] [INFO ] Invariant cache hit.
[2023-03-15 02:58:18] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 02:58:19] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/232 places, 261/370 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1642 ms. Remains : 159/232 places, 261/370 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39810 steps, run visited all 1 properties in 231 ms. (steps per millisecond=172 )
Probabilistic random walk after 39810 steps, saw 30367 distinct states, run finished after 232 ms. (steps per millisecond=171 ) properties seen :1
FORMULA NoC3x3-PT-4B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 28172 ms.
BK_STOP 1678849100701
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-4B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-4B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536100287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4B.tgz
mv NoC3x3-PT-4B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;