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.r111-csrt-158961257500359.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 itstools
Input is NoC3x3-PT-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257500359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 3.8K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 18:31 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.0K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 6 03:57 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 548K 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-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589928259035

[2020-05-19 22:44:22] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 22:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 22:44:23] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2020-05-19 22:44:23] [INFO ] Transformed 2003 places.
[2020-05-19 22:44:24] [INFO ] Transformed 2292 transitions.
[2020-05-19 22:44:24] [INFO ] Found NUPN structural information;
[2020-05-19 22:44:24] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 1043 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 178 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 187 ms. (steps per millisecond=53 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2292 rows 2003 cols
[2020-05-19 22:44:25] [INFO ] Computed 66 place invariants in 102 ms
[2020-05-19 22:44:26] [INFO ] [Real]Absence check using 66 positive place invariants in 452 ms returned sat
[2020-05-19 22:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 22:44:30] [INFO ] [Real]Absence check using state equation in 3205 ms returned (error "Failed to check-sat")
[2020-05-19 22:44:31] [INFO ] [Real]Absence check using 66 positive place invariants in 373 ms returned sat
[2020-05-19 22:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:35] [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 (= s387 (- t1889 t1888))") while checking expression at index 1
[2020-05-19 22:44:36] [INFO ] [Real]Absence check using 66 positive place invariants in 517 ms returned sat
[2020-05-19 22:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 22:44:40] [INFO ] [Real]Absence check using state equation in 3543 ms returned (error "Failed to check-sat")
[2020-05-19 22:44:41] [INFO ] [Real]Absence check using 66 positive place invariants in 517 ms returned sat
[2020-05-19 22:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 22:44:45] [INFO ] [Real]Absence check using state equation in 3653 ms returned (error "Failed to check-sat")
[2020-05-19 22:44:46] [INFO ] [Real]Absence check using 66 positive place invariants in 422 ms returned sat
[2020-05-19 22:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 22:44:50] [INFO ] [Real]Absence check using state equation in 3890 ms returned (error "Failed to check-sat")
[2020-05-19 22:44:51] [INFO ] [Real]Absence check using 66 positive place invariants in 449 ms returned sat
[2020-05-19 22:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:44:55] [INFO ] [Real]Absence check using state equation in 3718 ms returned sat
[2020-05-19 22:45:14] [INFO ] Deduced a trap composed of 15 places in 18889 ms
[2020-05-19 22:45:14] [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 (> (+ s0 s1 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1945 s1967 s1968) 0)") while checking expression at index 5
[2020-05-19 22:45:16] [INFO ] [Real]Absence check using 66 positive place invariants in 615 ms returned sat
[2020-05-19 22:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:45:19] [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 (= s151 (- t1931 t1506))") while checking expression at index 6
[2020-05-19 22:45:20] [INFO ] [Real]Absence check using 66 positive place invariants in 616 ms returned sat
[2020-05-19 22:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:45:24] [INFO ] [Real]Absence check using state equation in 3556 ms returned sat
[2020-05-19 22:45:40] [INFO ] Deduced a trap composed of 15 places in 15562 ms
[2020-05-19 22:45:40] [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 (> (+ s0 s1 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1945 s1967 s1968) 0)") while checking expression at index 7
Support contains 68 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1504 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 66 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Iterating post reduction 0 with 464 rules applied. Total rules applied 465 place count 1938 transition count 1837
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 856 place count 1547 transition count 1837
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 856 place count 1547 transition count 1810
Deduced a syphon composed of 27 places in 7 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 910 place count 1520 transition count 1810
Symmetric choice reduction at 2 with 346 rule applications. Total rules 1256 place count 1520 transition count 1810
Deduced a syphon composed of 346 places in 20 ms
Reduce places removed 346 places and 346 transitions.
Iterating global reduction 2 with 692 rules applied. Total rules applied 1948 place count 1174 transition count 1464
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 1948 place count 1174 transition count 1429
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 2018 place count 1139 transition count 1429
Symmetric choice reduction at 2 with 104 rule applications. Total rules 2122 place count 1139 transition count 1429
Deduced a syphon composed of 104 places in 20 ms
Reduce places removed 104 places and 104 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 2330 place count 1035 transition count 1325
Symmetric choice reduction at 2 with 116 rule applications. Total rules 2446 place count 1035 transition count 1325
Deduced a syphon composed of 116 places in 3 ms
Reduce places removed 116 places and 127 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 2678 place count 919 transition count 1198
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2718 place count 919 transition count 1198
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 69 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 2798 place count 879 transition count 1129
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 2813 place count 877 transition count 1116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2815 place count 875 transition count 1116
Symmetric choice reduction at 4 with 28 rule applications. Total rules 2843 place count 875 transition count 1116
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 2899 place count 847 transition count 1088
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2912 place count 847 transition count 1088
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 26 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 2938 place count 834 transition count 1062
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2951 place count 834 transition count 1062
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 2977 place count 821 transition count 1049
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 15 rules applied. Total rules applied 2992 place count 820 transition count 1035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2993 place count 819 transition count 1035
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 1 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 6 with 532 rules applied. Total rules applied 3525 place count 553 transition count 769
Symmetric choice reduction at 6 with 12 rule applications. Total rules 3537 place count 553 transition count 769
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 3561 place count 541 transition count 757
Symmetric choice reduction at 6 with 7 rule applications. Total rules 3568 place count 541 transition count 757
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 14 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3582 place count 534 transition count 743
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3583 place count 534 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3585 place count 533 transition count 738
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 3643 place count 504 transition count 863
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3644 place count 504 transition count 863
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3646 place count 503 transition count 861
Free-agglomeration rule applied 27 times.
Iterating global reduction 6 with 27 rules applied. Total rules applied 3673 place count 503 transition count 834
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 3704 place count 476 transition count 830
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3705 place count 476 transition count 829
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3706 place count 475 transition count 829
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 3715 place count 475 transition count 829
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3719 place count 475 transition count 829
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3722 place count 475 transition count 826
Applied a total of 3722 rules in 1514 ms. Remains 475 /2003 variables (removed 1528) and now considering 826/2292 (removed 1466) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/2003 places, 826/2292 transitions.
Incomplete random walk after 1000000 steps, including 9847 resets, run finished after 3970 ms. (steps per millisecond=251 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 803 resets, run finished after 1503 ms. (steps per millisecond=665 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 622 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties seen :[0, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 712 resets, run finished after 1384 ms. (steps per millisecond=722 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-05-19 22:45:49] [INFO ] Flow matrix only has 778 transitions (discarded 48 similar events)
// Phase 1: matrix 778 rows 475 cols
[2020-05-19 22:45:49] [INFO ] Computed 56 place invariants in 41 ms
[2020-05-19 22:45:50] [INFO ] [Real]Absence check using 56 positive place invariants in 228 ms returned sat
[2020-05-19 22:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:45:53] [INFO ] [Real]Absence check using state equation in 3380 ms returned sat
[2020-05-19 22:45:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-05-19 22:45:53] [INFO ] [Real]Added 78 Read/Feed constraints in 55 ms returned sat
[2020-05-19 22:45:54] [INFO ] Computed and/alt/rep : 824/6550/776 causal constraints in 153 ms.
[2020-05-19 22:45:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 22:45:55] [INFO ] [Nat]Absence check using 56 positive place invariants in 152 ms returned sat
[2020-05-19 22:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 22:45:56] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2020-05-19 22:45:56] [INFO ] [Nat]Added 78 Read/Feed constraints in 119 ms returned sat
[2020-05-19 22:45:56] [INFO ] Computed and/alt/rep : 824/6550/776 causal constraints in 76 ms.
[2020-05-19 22:46:16] [INFO ] Added : 541 causal constraints over 109 iterations in 19994 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 206 ms.
Incomplete Parikh walk after 101000 steps, including 640 resets, run finished after 603 ms. (steps per millisecond=167 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 475 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 475/475 places, 826/826 transitions.
Graph (trivial) has 84 edges and 475 vertex of which 2 / 475 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 474 transition count 821
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 471 transition count 821
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 9 place count 471 transition count 810
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 31 place count 460 transition count 810
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 460 transition count 810
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 11 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 453 transition count 799
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 453 transition count 799
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 450 transition count 793
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 450 transition count 789
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 450 transition count 789
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 448 transition count 785
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 448 transition count 781
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 133 place count 419 transition count 752
Symmetric choice reduction at 4 with 9 rule applications. Total rules 142 place count 419 transition count 752
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 17 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 160 place count 410 transition count 735
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 164 place count 410 transition count 731
Symmetric choice reduction at 5 with 5 rule applications. Total rules 169 place count 410 transition count 731
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 179 place count 405 transition count 721
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 188 place count 405 transition count 712
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 202 place count 398 transition count 750
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 398 transition count 750
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 10 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 205 place count 397 transition count 740
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 209 place count 397 transition count 736
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 233 place count 393 transition count 716
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 393 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 392 transition count 715
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 392 transition count 715
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 238 place count 392 transition count 715
Symmetric choice reduction at 8 with 2 rule applications. Total rules 240 place count 392 transition count 715
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 244 place count 390 transition count 713
Symmetric choice reduction at 8 with 2 rule applications. Total rules 246 place count 390 transition count 713
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 250 place count 388 transition count 709
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 252 place count 388 transition count 707
Applied a total of 252 rules in 448 ms. Remains 388 /475 variables (removed 87) and now considering 707/826 (removed 119) transitions.
Finished structural reductions, in 1 iterations. Remains : 388/475 places, 707/826 transitions.
Incomplete random walk after 1000000 steps, including 12989 resets, run finished after 4074 ms. (steps per millisecond=245 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 830 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties seen :[0]
Interrupted probabilistic random walk after 6957021 steps, run timeout after 30001 ms. (steps per millisecond=231 ) properties seen :[0]
Probabilistic random walk after 6957021 steps, saw 1184217 distinct states, run finished after 30014 ms. (steps per millisecond=231 ) properties seen :[0]
[2020-05-19 22:46:53] [INFO ] Flow matrix only has 649 transitions (discarded 58 similar events)
// Phase 1: matrix 649 rows 388 cols
[2020-05-19 22:46:53] [INFO ] Computed 56 place invariants in 5 ms
[2020-05-19 22:46:54] [INFO ] [Real]Absence check using 56 positive place invariants in 204 ms returned sat
[2020-05-19 22:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 22:46:56] [INFO ] [Real]Absence check using state equation in 2243 ms returned sat
[2020-05-19 22:46:56] [INFO ] State equation strengthened by 88 read => feed constraints.
[2020-05-19 22:46:56] [INFO ] [Real]Added 88 Read/Feed constraints in 50 ms returned sat
[2020-05-19 22:46:56] [INFO ] Computed and/alt/rep : 695/9994/637 causal constraints in 108 ms.
[2020-05-19 22:46:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 22:46:57] [INFO ] [Nat]Absence check using 56 positive place invariants in 104 ms returned sat
[2020-05-19 22:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 22:46:57] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-05-19 22:46:57] [INFO ] [Nat]Added 88 Read/Feed constraints in 74 ms returned sat
[2020-05-19 22:46:57] [INFO ] Computed and/alt/rep : 695/9994/637 causal constraints in 102 ms.
[2020-05-19 22:47:18] [INFO ] Added : 470 causal constraints over 94 iterations in 20329 ms.(timeout) Result :sat
[2020-05-19 22:47:19] [INFO ] Deduced a trap composed of 13 places in 807 ms
[2020-05-19 22:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1141 ms
Attempting to minimize the solution found.
Minimization took 200 ms.
Finished Parikh walk after 471 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=157 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589928440181

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-2B"
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"

# 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 itstools"
echo " Input is NoC3x3-PT-2B, 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 r111-csrt-158961257500359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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