fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536100238
Last Updated
May 14, 2023

About the Execution of ITS-Tools for NoC3x3-PT-1B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
655.731 17341.00 45356.00 269.20 TFFTFFFFFTTTTTFT 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-167863536100238.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-1B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536100238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 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.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 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 362K 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-1B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678811677309

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-14 16:34:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 16:34:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 16:34:40] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-14 16:34:40] [INFO ] Transformed 1416 places.
[2023-03-14 16:34:40] [INFO ] Transformed 1640 transitions.
[2023-03-14 16:34:40] [INFO ] Found NUPN structural information;
[2023-03-14 16:34:40] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 16:34:41] [INFO ] Flatten gal took : 315 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 14) seen :9
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
[2023-03-14 16:34:41] [INFO ] Flatten gal took : 208 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
[2023-03-14 16:34:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8707718574330356341.gal : 52 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
[2023-03-14 16:34:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5420994168381439873.prop : 3 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/ReachabilityCardinality8707718574330356341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5420994168381439873.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) 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 5) seen :0
Loading property file /tmp/ReachabilityCardinality5420994168381439873.prop.
Running SMT prover for 5 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-14 16:34:41] [INFO ] Computed 40 place invariants in 70 ms
[2023-03-14 16:34:42] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 16:34:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 31 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :21 after 26
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :26 after 72
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :72 after 374
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :374 after 414
Invariant property NoC3x3-PT-1B-ReachabilityCardinality-05 does not hold.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :414 after 581
Invariant property NoC3x3-PT-1B-ReachabilityCardinality-06 does not hold.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :581 after 690
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :690 after 1784
Invariant property NoC3x3-PT-1B-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1784 after 3855
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :3855 after 4865
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :4865 after 13365
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :13365 after 33834
[2023-03-14 16:34:44] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 16:34:45] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 19 ms to minimize.
[2023-03-14 16:34:45] [INFO ] Deduced a trap composed of 88 places in 251 ms of which 2 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :33834 after 220023
[2023-03-14 16:34:46] [INFO ] Deduced a trap composed of 102 places in 231 ms of which 2 ms to minimize.
[2023-03-14 16:34:46] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 2 ms to minimize.
[2023-03-14 16:34:46] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2023-03-14 16:34:46] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2023-03-14 16:34:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1773 ms
[2023-03-14 16:34:47] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 1 ms to minimize.
[2023-03-14 16:34:47] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2023-03-14 16:34:47] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 1 ms to minimize.
[2023-03-14 16:34:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 658 ms
[2023-03-14 16:34:48] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2023-03-14 16:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-14 16:34:48] [INFO ] After 4763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 587 ms.
[2023-03-14 16:34:48] [INFO ] After 6097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 206 ms.
Support contains 41 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1363 edges and 1416 vertex of which 631 / 1416 are part of one of the 18 SCC in 9 ms
Free SCC test removed 613 places
Drop transitions removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 803 transition count 712
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 232 rules applied. Total rules applied 426 place count 610 transition count 673
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 28 rules applied. Total rules applied 454 place count 601 transition count 654
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 20 rules applied. Total rules applied 474 place count 583 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 475 place count 582 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 475 place count 582 transition count 646
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 487 place count 576 transition count 646
Discarding 160 places :
Symmetric choice reduction at 5 with 160 rule applications. Total rules 647 place count 416 transition count 486
Iterating global reduction 5 with 160 rules applied. Total rules applied 807 place count 416 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 808 place count 416 transition count 485
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 808 place count 416 transition count 462
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 854 place count 393 transition count 462
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 876 place count 371 transition count 433
Iterating global reduction 6 with 22 rules applied. Total rules applied 898 place count 371 transition count 433
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 6 with 194 rules applied. Total rules applied 1092 place count 274 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1095 place count 274 transition count 333
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1097 place count 272 transition count 328
Iterating global reduction 7 with 2 rules applied. Total rules applied 1099 place count 272 transition count 328
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1111 place count 266 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1112 place count 266 transition count 383
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1118 place count 266 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1120 place count 265 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1121 place count 265 transition count 387
Free-agglomeration rule applied 87 times.
Iterating global reduction 9 with 87 rules applied. Total rules applied 1208 place count 265 transition count 300
Reduce places removed 87 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 529 edges and 178 vertex of which 167 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 99 rules applied. Total rules applied 1307 place count 167 transition count 289
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1321 place count 167 transition count 275
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 1328 place count 167 transition count 268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1331 place count 164 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 1337 place count 164 transition count 268
Applied a total of 1337 rules in 328 ms. Remains 164 /1416 variables (removed 1252) and now considering 268/1640 (removed 1372) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 164/1416 places, 268/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 268 rows 164 cols
[2023-03-14 16:34:49] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 16:34:49] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 16:34:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-14 16:34:49] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 16:34:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 16:34:49] [INFO ] After 32ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 16:34:49] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-14 16:34:50] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 268/268 transitions.
Graph (trivial) has 58 edges and 164 vertex of which 20 / 164 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 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 0 with 4 rules applied. Total rules applied 5 place count 152 transition count 241
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 148 transition count 240
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 148 transition count 237
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 145 transition count 237
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 145 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 144 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 144 transition count 235
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 31 place count 138 transition count 229
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 35 place count 138 transition count 225
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 137 transition count 222
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 137 transition count 222
Performed 3 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 43 place count 134 transition count 241
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 50 place count 134 transition count 234
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 78 place count 134 transition count 206
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 89 place count 134 transition count 195
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 101 place count 123 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 123 transition count 194
Applied a total of 102 rules in 55 ms. Remains 123 /164 variables (removed 41) and now considering 194/268 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 123/164 places, 194/268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1442113 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :{}
Probabilistic random walk after 1442113 steps, saw 254420 distinct states, run finished after 3006 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 123 cols
[2023-03-14 16:34:53] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 16:34:53] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 16:34:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-14 16:34:53] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 16:34:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-14 16:34:53] [INFO ] After 29ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 16:34:53] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-14 16:34:53] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
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 13455 ms.

BK_STOP 1678811694650

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-1B"
export BK_EXAMINATION="ReachabilityCardinality"
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-1B, 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 r261-smll-167863536100238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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