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-158987853200431.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-7A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 3.6K Apr 8 15:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 15:08 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.3K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 6 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 6 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 355K 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-7A-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591147877467

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:31:20] [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:31:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:31:20] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2020-06-03 01:31:20] [INFO ] Transformed 801 places.
[2020-06-03 01:31:20] [INFO ] Transformed 1544 transitions.
[2020-06-03 01:31:20] [INFO ] Found NUPN structural information;
[2020-06-03 01:31:20] [INFO ] Parsed PT model containing 801 places and 1544 transitions in 301 ms.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0]
FORMULA NoC3x3-PT-7A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[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, 1, 0, 0]
FORMULA NoC3x3-PT-7A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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, 1, 0]
FORMULA NoC3x3-PT-7A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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]
[2020-06-03 01:31:20] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2020-06-03 01:31:20] [INFO ] Computed 111 place invariants in 62 ms
[2020-06-03 01:31:21] [INFO ] [Real]Absence check using 82 positive place invariants in 131 ms returned sat
[2020-06-03 01:31:21] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 46 ms returned sat
[2020-06-03 01:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:24] [INFO ] [Real]Absence check using state equation in 2574 ms returned sat
[2020-06-03 01:31:24] [INFO ] State equation strengthened by 52 read => feed constraints.
[2020-06-03 01:31:24] [INFO ] [Real]Added 52 Read/Feed constraints in 59 ms returned sat
[2020-06-03 01:31:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:31:24] [INFO ] [Nat]Absence check using 82 positive place invariants in 100 ms returned sat
[2020-06-03 01:31:24] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 82 ms returned sat
[2020-06-03 01:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:27] [INFO ] [Nat]Absence check using state equation in 2370 ms returned sat
[2020-06-03 01:31:27] [INFO ] [Nat]Added 52 Read/Feed constraints in 23 ms returned sat
[2020-06-03 01:31:27] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-06-03 01:31:27] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2020-06-03 01:31:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2020-06-03 01:31:27] [INFO ] Computed and/alt/rep : 1436/6066/1354 causal constraints in 135 ms.
[2020-06-03 01:31:29] [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: Stream closed (=> (> t146 0) (or (and (> t152 0) (< o152 o146)) (and (> t654 0) (< o654 o146))))") while checking expression at index 0
[2020-06-03 01:31:29] [INFO ] [Real]Absence check using 82 positive place invariants in 78 ms returned sat
[2020-06-03 01:31:29] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 01:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:31] [INFO ] [Real]Absence check using state equation in 2013 ms returned sat
[2020-06-03 01:31:31] [INFO ] [Real]Added 52 Read/Feed constraints in 56 ms returned sat
[2020-06-03 01:31:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:31:32] [INFO ] [Nat]Absence check using 82 positive place invariants in 67 ms returned sat
[2020-06-03 01:31:32] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 01:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:34] [INFO ] [Nat]Absence check using state equation in 1952 ms returned sat
[2020-06-03 01:31:34] [INFO ] [Nat]Added 52 Read/Feed constraints in 23 ms returned sat
[2020-06-03 01:31:34] [INFO ] Deduced a trap composed of 19 places in 194 ms
[2020-06-03 01:31:34] [INFO ] Deduced a trap composed of 19 places in 101 ms
[2020-06-03 01:31:34] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 01:31:34] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-03 01:31:34] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-06-03 01:31:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 784 ms
[2020-06-03 01:31:34] [INFO ] Computed and/alt/rep : 1436/6066/1354 causal constraints in 85 ms.
[2020-06-03 01:31:36] [INFO ] Added : 115 causal constraints over 23 iterations in 2009 ms. Result :(error "Failed to check-sat")
[2020-06-03 01:31:37] [INFO ] [Real]Absence check using 82 positive place invariants in 63 ms returned sat
[2020-06-03 01:31:37] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 01:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:38] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2020-06-03 01:31:39] [INFO ] [Real]Added 52 Read/Feed constraints in 38 ms returned sat
[2020-06-03 01:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:31:39] [INFO ] [Nat]Absence check using 82 positive place invariants in 75 ms returned sat
[2020-06-03 01:31:39] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 22 ms returned sat
[2020-06-03 01:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:41] [INFO ] [Nat]Absence check using state equation in 1803 ms returned sat
[2020-06-03 01:31:41] [INFO ] [Nat]Added 52 Read/Feed constraints in 23 ms returned sat
[2020-06-03 01:31:41] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-03 01:31:41] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-06-03 01:31:41] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-06-03 01:31:41] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-06-03 01:31:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 539 ms
[2020-06-03 01:31:42] [INFO ] Computed and/alt/rep : 1436/6066/1354 causal constraints in 242 ms.
[2020-06-03 01:31:44] [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: Stream closed (=> (> t145 0) (or (and (> t480 0) (< o480 o145)) (and (> t481 0) (< o481 o145)) (and (> t482 0) (< o482 o145))))") while checking expression at index 2
[2020-06-03 01:31:44] [INFO ] [Real]Absence check using 82 positive place invariants in 62 ms returned sat
[2020-06-03 01:31:44] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 38 ms returned sat
[2020-06-03 01:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:46] [INFO ] [Real]Absence check using state equation in 1858 ms returned sat
[2020-06-03 01:31:46] [INFO ] [Real]Added 52 Read/Feed constraints in 23 ms returned sat
[2020-06-03 01:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:31:46] [INFO ] [Nat]Absence check using 82 positive place invariants in 69 ms returned sat
[2020-06-03 01:31:46] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 19 ms returned sat
[2020-06-03 01:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:31:48] [INFO ] [Nat]Absence check using state equation in 1851 ms returned sat
[2020-06-03 01:31:48] [INFO ] [Nat]Added 52 Read/Feed constraints in 38 ms returned sat
[2020-06-03 01:31:48] [INFO ] Deduced a trap composed of 17 places in 278 ms
[2020-06-03 01:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2020-06-03 01:31:49] [INFO ] Computed and/alt/rep : 1436/6066/1354 causal constraints in 103 ms.
[2020-06-03 01:31:51] [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: Stream closed (=> (> t117 0) (or (and (> t121 0) (< o121 o117)) (and (> t125 0) (< o125 o117))))") while checking expression at index 3
Support contains 27 out of 801 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 706 edges and 801 vertex of which 99 / 801 are part of one of the 9 SCC in 11 ms
Free SCC test removed 90 places
Drop transitions removed 185 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 195 rules applied. Total rules applied 196 place count 711 transition count 1242
Symmetric choice reduction at 1 with 150 rule applications. Total rules 346 place count 711 transition count 1242
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 166 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 646 place count 561 transition count 1076
Ensure Unique test removed 43 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 114 rules applied. Total rules applied 760 place count 518 transition count 1005
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 771 place count 507 transition count 1005
Performed 128 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 1027 place count 379 transition count 855
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1105 place count 379 transition count 777
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1129 place count 367 transition count 762
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1139 place count 367 transition count 752
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1167 place count 353 transition count 760
Free-agglomeration rule applied 42 times with reduction of 25 identical transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1209 place count 353 transition count 693
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 1282 place count 311 transition count 662
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1287 place count 311 transition count 657
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1303 place count 306 transition count 646
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1306 place count 306 transition count 643
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1319 place count 303 transition count 633
Free-agglomeration rule (complex) applied 25 times with reduction of 10 identical transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 1344 place count 303 transition count 783
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 8 with 116 rules applied. Total rules applied 1460 place count 278 transition count 692
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 9 with 40 rules applied. Total rules applied 1500 place count 278 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1501 place count 278 transition count 691
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1504 place count 278 transition count 691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1507 place count 278 transition count 688
Drop transitions removed 171 transitions
Redundant transition composition rules discarded 171 transitions
Iterating global reduction 11 with 171 rules applied. Total rules applied 1678 place count 278 transition count 517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1679 place count 277 transition count 517
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1681 place count 277 transition count 515
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1684 place count 275 transition count 514
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1686 place count 275 transition count 512
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1687 place count 275 transition count 511
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1689 place count 274 transition count 510
Applied a total of 1689 rules in 416 ms. Remains 274 /801 variables (removed 527) and now considering 510/1437 (removed 927) transitions.
Finished structural reductions, in 1 iterations. Remains : 274/801 places, 510/1437 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3495 ms. (steps per millisecond=286 ) properties seen :[1, 0, 1, 1]
FORMULA NoC3x3-PT-7A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 11585 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=373 )
FORMULA NoC3x3-PT-7A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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-7A"
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-7A, 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-158987853200431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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