Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853200439.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 24 05:37 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-7B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591148093906

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:34:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:34:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:34:56] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2020-06-03 01:34:57] [INFO ] Transformed 7014 places.
[2020-06-03 01:34:57] [INFO ] Transformed 8833 transitions.
[2020-06-03 01:34:57] [INFO ] Found NUPN structural information;
[2020-06-03 01:34:57] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 436 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 180 ms. (steps per millisecond=55 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8833 rows 7014 cols
[2020-06-03 01:34:58] [INFO ] Computed 66 place invariants in 260 ms
[2020-06-03 01:35:00] [INFO ] [Real]Absence check using 66 positive place invariants in 840 ms returned sat
[2020-06-03 01:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s207 (- t7297 (+ t7298 t7342)))") while checking expression at index 0
[2020-06-03 01:35:04] [INFO ] [Real]Absence check using 66 positive place invariants in 667 ms returned sat
[2020-06-03 01:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:08] [INFO ] [Real]Absence check using state equation in 3546 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:10] [INFO ] [Real]Absence check using 66 positive place invariants in 734 ms returned sat
[2020-06-03 01:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:13] [INFO ] [Real]Absence check using state equation in 3442 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 01:35:14] [INFO ] [Real]Absence check using 66 positive place invariants in 622 ms returned sat
[2020-06-03 01:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:18] [INFO ] [Real]Absence check using state equation in 3610 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:19] [INFO ] [Real]Absence check using 66 positive place invariants in 664 ms returned sat
[2020-06-03 01:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:23] [INFO ] [Real]Absence check using state equation in 3533 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:24] [INFO ] [Real]Absence check using 66 positive place invariants in 671 ms returned sat
[2020-06-03 01:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:28] [INFO ] [Real]Absence check using state equation in 3565 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:30] [INFO ] [Real]Absence check using 66 positive place invariants in 837 ms returned sat
[2020-06-03 01:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:33] [INFO ] [Real]Absence check using state equation in 3321 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:35] [INFO ] [Real]Absence check using 66 positive place invariants in 683 ms returned sat
[2020-06-03 01:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:38] [INFO ] [Real]Absence check using state equation in 3557 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:40] [INFO ] [Real]Absence check using 66 positive place invariants in 667 ms returned sat
[2020-06-03 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:43] [INFO ] [Real]Absence check using state equation in 3563 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:45] [INFO ] [Real]Absence check using 66 positive place invariants in 707 ms returned sat
[2020-06-03 01:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:48] [INFO ] [Real]Absence check using state equation in 3508 ms returned (error "Failed to check-sat")
[2020-06-03 01:35:50] [INFO ] [Real]Absence check using 66 positive place invariants in 721 ms returned sat
[2020-06-03 01:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:35:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:35:53] [INFO ] [Real]Absence check using state equation in 3454 ms returned (error "Failed to check-sat")
Support contains 59 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7666 edges and 7014 vertex of which 3859 / 7014 are part of one of the 29 SCC in 47 ms
Free SCC test removed 3830 places
Drop transitions removed 4670 transitions
Reduce isomorphic transitions removed 4670 transitions.
Performed 952 Post agglomeration using F-continuation condition.Transition count delta: 952
Iterating post reduction 0 with 5622 rules applied. Total rules applied 5623 place count 3184 transition count 3211
Reduce places removed 952 places and 0 transitions.
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 1048 rules applied. Total rules applied 6671 place count 2232 transition count 3115
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 47 rules applied. Total rules applied 6718 place count 2188 transition count 3112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6719 place count 2187 transition count 3112
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 6719 place count 2187 transition count 3101
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 6741 place count 2176 transition count 3101
Symmetric choice reduction at 4 with 707 rule applications. Total rules 7448 place count 2176 transition count 3101
Deduced a syphon composed of 707 places in 6 ms
Reduce places removed 707 places and 713 transitions.
Iterating global reduction 4 with 1414 rules applied. Total rules applied 8862 place count 1469 transition count 2388
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 15 rules applied. Total rules applied 8877 place count 1469 transition count 2373
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 8882 place count 1464 transition count 2373
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 44 Pre rules applied. Total rules applied 8882 place count 1464 transition count 2329
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 8970 place count 1420 transition count 2329
Symmetric choice reduction at 6 with 392 rule applications. Total rules 9362 place count 1420 transition count 2329
Deduced a syphon composed of 392 places in 15 ms
Reduce places removed 392 places and 543 transitions.
Iterating global reduction 6 with 784 rules applied. Total rules applied 10146 place count 1028 transition count 1786
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 6 with 303 rules applied. Total rules applied 10449 place count 1028 transition count 1483
Symmetric choice reduction at 7 with 9 rule applications. Total rules 10458 place count 1028 transition count 1483
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 10476 place count 1019 transition count 1465
Symmetric choice reduction at 7 with 9 rule applications. Total rules 10485 place count 1019 transition count 1465
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 10503 place count 1010 transition count 1456
Symmetric choice reduction at 7 with 9 rule applications. Total rules 10512 place count 1010 transition count 1456
Deduced a syphon composed of 9 places in 19 ms
Reduce places removed 9 places and 13 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 10530 place count 1001 transition count 1443
Symmetric choice reduction at 7 with 9 rule applications. Total rules 10539 place count 1001 transition count 1443
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 10557 place count 992 transition count 1425
Performed 304 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 304 places in 1 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 7 with 608 rules applied. Total rules applied 11165 place count 688 transition count 1102
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 11192 place count 688 transition count 1075
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 11216 place count 676 transition count 1063
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 11218 place count 676 transition count 1061
Performed 101 Post agglomeration using F-continuation condition with reduction of 211 identical transitions.
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 11420 place count 575 transition count 1213
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 9 with 107 rules applied. Total rules applied 11527 place count 575 transition count 1106
Performed 13 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 11553 place count 562 transition count 1214
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 11599 place count 562 transition count 1168
Free-agglomeration rule applied 183 times.
Iterating global reduction 11 with 183 rules applied. Total rules applied 11782 place count 562 transition count 985
Reduce places removed 183 places and 0 transitions.
Drop transitions removed 63 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 19 places :
Also discarding 0 output transitions
Graph (complete) has 1467 edges and 379 vertex of which 360 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.12 ms
Iterating post reduction 11 with 248 rules applied. Total rules applied 12030 place count 360 transition count 921
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 12046 place count 360 transition count 905
Symmetric choice reduction at 13 with 9 rule applications. Total rules 12055 place count 360 transition count 905
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 12073 place count 351 transition count 896
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 12074 place count 351 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 12075 place count 350 transition count 895
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 12111 place count 350 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 12112 place count 350 transition count 894
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 15 with 70 rules applied. Total rules applied 12182 place count 350 transition count 824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 12183 place count 349 transition count 824
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 12184 place count 349 transition count 823
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 12186 place count 348 transition count 822
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 12189 place count 348 transition count 822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 12190 place count 348 transition count 821
Applied a total of 12190 rules in 1820 ms. Remains 348 /7014 variables (removed 6666) and now considering 821/8833 (removed 8012) transitions.
Finished structural reductions, in 1 iterations. Remains : 348/7014 places, 821/8833 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2750 ms. (steps per millisecond=363 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1250 ms. (steps per millisecond=800 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1418 ms. (steps per millisecond=705 ) properties seen :[1, 1, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1194 ms. (steps per millisecond=837 ) properties seen :[1, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 01:36:03] [INFO ] Flow matrix only has 769 transitions (discarded 52 similar events)
// Phase 1: matrix 769 rows 348 cols
[2020-06-03 01:36:04] [INFO ] Computed 56 place invariants in 5 ms
[2020-06-03 01:36:04] [INFO ] [Real]Absence check using 56 positive place invariants in 55 ms returned sat
[2020-06-03 01:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:36:04] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-06-03 01:36:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:36:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 52 ms returned sat
[2020-06-03 01:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:36:05] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2020-06-03 01:36:05] [INFO ] State equation strengthened by 171 read => feed constraints.
[2020-06-03 01:36:05] [INFO ] [Nat]Added 171 Read/Feed constraints in 47 ms returned sat
[2020-06-03 01:36:05] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2020-06-03 01:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2020-06-03 01:36:05] [INFO ] Computed and/alt/rep : 816/5215/764 causal constraints in 118 ms.
[2020-06-03 01:36:23] [INFO ] Added : 706 causal constraints over 143 iterations in 17763 ms. Result :sat
[2020-06-03 01:36:23] [INFO ] Deduced a trap composed of 13 places in 52 ms
[2020-06-03 01:36:24] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-06-03 01:36:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1381 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
Finished Parikh walk after 657 steps, including 3 resets, run visited all 1 properties in 9 ms. (steps per millisecond=73 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

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-7B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is NoC3x3-PT-7B, 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 r174-csrt-158987853200439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B 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 ;