fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536100239
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
1350.695 41102.00 110021.00 501.90 TTTFTTFFTTFTTFTF 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-167863536100239.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536100239
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678811704218

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-1B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-14 16:35:07] [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-14 16:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 16:35:07] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-03-14 16:35:07] [INFO ] Transformed 1416 places.
[2023-03-14 16:35:07] [INFO ] Transformed 1640 transitions.
[2023-03-14 16:35:07] [INFO ] Found NUPN structural information;
[2023-03-14 16:35:07] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 16:35:08] [INFO ] Flatten gal took : 428 ms
[2023-03-14 16:35:08] [INFO ] Flatten gal took : 246 ms
[2023-03-14 16:35:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12716514651899258401.gal : 145 ms
[2023-03-14 16:35:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6526652297583888502.prop : 2 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/ReachabilityCardinality12716514651899258401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6526652297583888502.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 8 resets, run finished after 1464 ms. (steps per millisecond=6 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-1B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-1B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Loading property file /tmp/ReachabilityCardinality6526652297583888502.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-14 16:35:10] [INFO ] Computed 40 place invariants in 46 ms
[2023-03-14 16:35:11] [INFO ] After 1019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 16:35:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 33 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 21
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :21 after 26
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :26 after 72
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :72 after 374
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :374 after 414
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :414 after 581
Reachability property NoC3x3-PT-1B-ReachabilityFireability-05 is true.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :581 after 1765
Reachability property NoC3x3-PT-1B-ReachabilityFireability-09 is true.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1765 after 3806
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :3806 after 4848
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4848 after 13354
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :13354 after 33834
[2023-03-14 16:35:13] [INFO ] After 1807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 16:35:14] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 8 ms to minimize.
[2023-03-14 16:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :33834 after 220021
[2023-03-14 16:35:15] [INFO ] After 3781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 962 ms.
[2023-03-14 16:35:16] [INFO ] After 5645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA NoC3x3-PT-1B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 305 ms.
Support contains 122 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1141 edges and 1416 vertex of which 358 / 1416 are part of one of the 16 SCC in 13 ms
Free SCC test removed 342 places
Drop transitions removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Drop transitions removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 284 place count 1074 transition count 960
Reduce places removed 283 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 1 with 308 rules applied. Total rules applied 592 place count 791 transition count 935
Reduce places removed 4 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 6 rules applied. Total rules applied 598 place count 787 transition count 933
Reduce places removed 1 places and 0 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 3 with 91 rules applied. Total rules applied 689 place count 786 transition count 843
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 124 rules applied. Total rules applied 813 place count 696 transition count 809
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 815 place count 694 transition count 809
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 815 place count 694 transition count 799
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 835 place count 684 transition count 799
Discarding 146 places :
Symmetric choice reduction at 6 with 146 rule applications. Total rules 981 place count 538 transition count 653
Iterating global reduction 6 with 146 rules applied. Total rules applied 1127 place count 538 transition count 653
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1130 place count 538 transition count 650
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 1130 place count 538 transition count 635
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1160 place count 523 transition count 635
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1179 place count 504 transition count 611
Iterating global reduction 7 with 19 rules applied. Total rules applied 1198 place count 504 transition count 611
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 7 with 218 rules applied. Total rules applied 1416 place count 395 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1420 place count 395 transition count 498
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1421 place count 394 transition count 496
Iterating global reduction 8 with 1 rules applied. Total rules applied 1422 place count 394 transition count 496
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1452 place count 379 transition count 551
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1458 place count 379 transition count 545
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1468 place count 379 transition count 535
Free-agglomeration rule applied 47 times.
Iterating global reduction 9 with 47 rules applied. Total rules applied 1515 place count 379 transition count 488
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 49 rules applied. Total rules applied 1564 place count 332 transition count 486
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1568 place count 332 transition count 482
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1570 place count 332 transition count 482
Applied a total of 1570 rules in 384 ms. Remains 332 /1416 variables (removed 1084) and now considering 482/1640 (removed 1158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 332/1416 places, 482/1640 transitions.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :220021 after 3.6947e+06
Incomplete random walk after 10000 steps, including 40 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Invariant property NoC3x3-PT-1B-ReachabilityFireability-10 does not hold.
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :3.6947e+06 after 2.07619e+08
Interrupted probabilistic random walk after 241848 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{1=1}
Probabilistic random walk after 241848 steps, saw 73866 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :1
FORMULA NoC3x3-PT-1B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 482 rows 332 cols
[2023-03-14 16:35:21] [INFO ] Computed 40 place invariants in 7 ms
[2023-03-14 16:35:21] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 16:35:21] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-14 16:35:21] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-14 16:35:22] [INFO ] After 175ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:22] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-14 16:35:22] [INFO ] After 1010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 105 out of 332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 332/332 places, 482/482 transitions.
Graph (trivial) has 41 edges and 332 vertex of which 12 / 332 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 326 transition count 466
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 322 transition count 464
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 320 transition count 463
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 320 transition count 461
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 318 transition count 461
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 317 transition count 460
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 317 transition count 460
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 313 transition count 456
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 313 transition count 455
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 313 transition count 452
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 43 place count 313 transition count 441
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 783 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 15 rules applied. Total rules applied 58 place count 301 transition count 438
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 301 transition count 437
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 62 place count 301 transition count 437
Applied a total of 62 rules in 94 ms. Remains 301 /332 variables (removed 31) and now considering 437/482 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 301/332 places, 437/482 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :2.07619e+08 after 3.50039e+08
Interrupted probabilistic random walk after 215519 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215519 steps, saw 182125 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 16:35:25] [INFO ] Flow matrix only has 436 transitions (discarded 1 similar events)
// Phase 1: matrix 436 rows 301 cols
[2023-03-14 16:35:25] [INFO ] Computed 39 place invariants in 3 ms
[2023-03-14 16:35:26] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 16:35:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2023-03-14 16:35:26] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-14 16:35:26] [INFO ] After 175ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:26] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2023-03-14 16:35:26] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2023-03-14 16:35:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-14 16:35:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-14 16:35:27] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-14 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-14 16:35:27] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-14 16:35:27] [INFO ] After 1225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 105 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 437/437 transitions.
Applied a total of 0 rules in 13 ms. Remains 301 /301 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 301/301 places, 437/437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 437/437 transitions.
Applied a total of 0 rules in 14 ms. Remains 301 /301 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2023-03-14 16:35:27] [INFO ] Flow matrix only has 436 transitions (discarded 1 similar events)
[2023-03-14 16:35:27] [INFO ] Invariant cache hit.
[2023-03-14 16:35:27] [INFO ] Implicit Places using invariants in 154 ms returned [150, 265]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 299/301 places, 437/437 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 299 transition count 435
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 297 transition count 433
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 2 with 2 rules applied. Total rules applied 8 place count 296 transition count 432
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 296 transition count 428
Applied a total of 12 rules in 54 ms. Remains 296 /299 variables (removed 3) and now considering 428/437 (removed 9) transitions.
[2023-03-14 16:35:27] [INFO ] Flow matrix only has 427 transitions (discarded 1 similar events)
// Phase 1: matrix 427 rows 296 cols
[2023-03-14 16:35:27] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-14 16:35:27] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-14 16:35:27] [INFO ] Flow matrix only has 427 transitions (discarded 1 similar events)
[2023-03-14 16:35:27] [INFO ] Invariant cache hit.
[2023-03-14 16:35:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 16:35:28] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 296/301 places, 428/437 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 735 ms. Remains : 296/301 places, 428/437 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) 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 3) seen :0
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :3.50039e+08 after 5.28959e+08
Interrupted probabilistic random walk after 243356 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243356 steps, saw 205006 distinct states, run finished after 3005 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 16:35:31] [INFO ] Flow matrix only has 427 transitions (discarded 1 similar events)
[2023-03-14 16:35:31] [INFO ] Invariant cache hit.
[2023-03-14 16:35:31] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 16:35:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2023-03-14 16:35:32] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 16:35:32] [INFO ] After 146ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 16:35:32] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2023-03-14 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-14 16:35:32] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2023-03-14 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-14 16:35:32] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-14 16:35:32] [INFO ] After 993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA NoC3x3-PT-1B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
Support contains 51 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 428/428 transitions.
Graph (trivial) has 100 edges and 296 vertex of which 20 / 296 are part of one of the 8 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 284 transition count 400
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 276 transition count 394
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 31 place count 270 transition count 392
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 31 place count 270 transition count 390
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 35 place count 268 transition count 390
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 41 place count 262 transition count 382
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 262 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 262 transition count 381
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 102 place count 235 transition count 353
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 108 place count 235 transition count 347
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 110 place count 233 transition count 344
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 233 transition count 344
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 120 place count 229 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 229 transition count 368
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 126 place count 229 transition count 364
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 141 place count 229 transition count 349
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 653 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 18 rules applied. Total rules applied 159 place count 213 transition count 347
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 160 place count 213 transition count 346
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 213 transition count 346
Applied a total of 161 rules in 112 ms. Remains 213 /296 variables (removed 83) and now considering 346/428 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 213/296 places, 346/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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
Interrupted probabilistic random walk after 272940 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272940 steps, saw 209511 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 346 rows 213 cols
[2023-03-14 16:35:35] [INFO ] Computed 36 place invariants in 7 ms
[2023-03-14 16:35:35] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 16:35:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-14 16:35:36] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 16:35:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 16:35:36] [INFO ] After 83ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 16:35:36] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-14 16:35:36] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 51 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 346/346 transitions.
Applied a total of 0 rules in 21 ms. Remains 213 /213 variables (removed 0) and now considering 346/346 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 213/213 places, 346/346 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 346/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 213 /213 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2023-03-14 16:35:36] [INFO ] Invariant cache hit.
[2023-03-14 16:35:36] [INFO ] Implicit Places using invariants in 147 ms returned [46, 70, 157, 187]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 149 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/213 places, 346/346 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 209 transition count 343
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 206 transition count 341
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 204 transition count 340
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 202 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 201 transition count 340
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 25 place count 201 transition count 332
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 201 transition count 331
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 201 transition count 331
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 201 transition count 330
Applied a total of 31 rules in 48 ms. Remains 201 /209 variables (removed 8) and now considering 330/346 (removed 16) transitions.
// Phase 1: matrix 330 rows 201 cols
[2023-03-14 16:35:36] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-14 16:35:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-14 16:35:36] [INFO ] Invariant cache hit.
[2023-03-14 16:35:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 16:35:37] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 201/213 places, 330/346 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 617 ms. Remains : 201/213 places, 330/346 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
SDD proceeding with computation,13 properties remain. new max is 131072
SDD size :5.28959e+08 after 8.16201e+08
Interrupted probabilistic random walk after 477692 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477692 steps, saw 137698 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 16:35:40] [INFO ] Invariant cache hit.
[2023-03-14 16:35:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 16:35:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2023-03-14 16:35:40] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 16:35:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-14 16:35:40] [INFO ] After 74ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 16:35:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2023-03-14 16:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-14 16:35:40] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-14 16:35:40] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA NoC3x3-PT-1B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
Support contains 19 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 330/330 transitions.
Graph (trivial) has 95 edges and 201 vertex of which 33 / 201 are part of one of the 11 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 39 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 51 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 179 transition count 275
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 175 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 174 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 174 transition count 273
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 173 transition count 273
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 171 transition count 271
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 171 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 23 place count 171 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 171 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 170 transition count 264
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 39 place count 163 transition count 257
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 162 transition count 255
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 162 transition count 255
Performed 5 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 51 place count 157 transition count 283
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 73 place count 157 transition count 261
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 96 place count 157 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 156 transition count 255
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 120 place count 156 transition count 233
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Remove reverse transitions (loop back) rule discarded transition t256.t257.t285.t1610.t286.t261.t262.t263.t270.t1355.t271.t179.t432.t1349.t431.t177.t178 and 12 places that fell out of Prefix Of Interest.
Drop transitions removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 138 place count 122 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 140 place count 122 transition count 213
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 141 place count 122 transition count 212
Applied a total of 141 rules in 49 ms. Remains 122 /201 variables (removed 79) and now considering 212/330 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 122/201 places, 212/330 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456445 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456445 steps, saw 291440 distinct states, run finished after 3002 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 16:35:43] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 122 cols
[2023-03-14 16:35:43] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-14 16:35:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 16:35:44] [INFO ] [Nat]Absence check using 29 positive place invariants in 8 ms returned sat
[2023-03-14 16:35:44] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 16:35:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-14 16:35:44] [INFO ] After 27ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 16:35:44] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-14 16:35:44] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
FORMULA NoC3x3-PT-1B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 0 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 37067 ms.

BK_STOP 1678811745320

--------------------
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-1B"
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-1B, 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-167863536100239"
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 [ "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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;