fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922813800062
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DLCshifumi-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.630 146295.00 185299.00 80.40 FFTTTFFTTFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922813800062.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCshifumi-PT-5b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922813800062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 3.4K Mar 31 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 10:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 10:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 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 9.7M 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 DLCshifumi-PT-5b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590099615715

[2020-05-21 22:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-21 22:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 22:20:17] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2020-05-21 22:20:18] [INFO ] Transformed 27146 places.
[2020-05-21 22:20:18] [INFO ] Transformed 39849 transitions.
[2020-05-21 22:20:18] [INFO ] Found NUPN structural information;
[2020-05-21 22:20:18] [INFO ] Parsed PT model containing 27146 places and 39849 transitions in 1714 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 1406 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=36 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[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]
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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 39849 rows 27146 cols
[2020-05-21 22:20:23] [INFO ] Computed 1378 place invariants in 3054 ms
[2020-05-21 22:20:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:28] [INFO ] [Real]Absence check using 1378 positive place invariants in 2180 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-05-21 22:20:33] [INFO ] [Real]Absence check using 1378 positive place invariants in 2235 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 22:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-05-21 22:20:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:39] [INFO ] [Real]Absence check using 1378 positive place invariants in 2131 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-21 22:20:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:44] [INFO ] [Real]Absence check using 1378 positive place invariants in 2180 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-21 22:20:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:49] [INFO ] [Real]Absence check using 1378 positive place invariants in 2345 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-21 22:20:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:54] [INFO ] [Real]Absence check using 1378 positive place invariants in 2114 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-05-21 22:20:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:20:59] [INFO ] [Real]Absence check using 1378 positive place invariants in 2110 ms returned (error "Failed to check-sat")
[2020-05-21 22:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:20:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2020-05-21 22:21:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:21:04] [INFO ] [Real]Absence check using 1378 positive place invariants in 2183 ms returned (error "Failed to check-sat")
[2020-05-21 22:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:21:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
Support contains 33 out of 27146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27146/27146 places, 39849/39849 transitions.
Graph (trivial) has 25227 edges and 27146 vertex of which 2225 / 27146 are part of one of the 142 SCC in 91 ms
Free SCC test removed 2083 places
Drop transitions removed 2356 transitions
Reduce isomorphic transitions removed 2356 transitions.
Performed 12886 Post agglomeration using F-continuation condition.Transition count delta: 12886
Iterating post reduction 0 with 15242 rules applied. Total rules applied 15243 place count 25063 transition count 24607
Reduce places removed 12886 places and 0 transitions.
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Performed 374 Post agglomeration using F-continuation condition.Transition count delta: 374
Iterating post reduction 1 with 13639 rules applied. Total rules applied 28882 place count 12177 transition count 23854
Reduce places removed 374 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Iterating post reduction 2 with 613 rules applied. Total rules applied 29495 place count 11803 transition count 23615
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 3 with 119 rules applied. Total rules applied 29614 place count 11684 transition count 23615
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 142 Pre rules applied. Total rules applied 29614 place count 11684 transition count 23473
Deduced a syphon composed of 142 places in 828 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 29898 place count 11542 transition count 23473
Symmetric choice reduction at 4 with 3271 rule applications. Total rules 33169 place count 11542 transition count 23473
Deduced a syphon composed of 3271 places in 849 ms
Reduce places removed 3271 places and 3271 transitions.
Iterating global reduction 4 with 6542 rules applied. Total rules applied 39711 place count 8271 transition count 20202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 39716 place count 8271 transition count 20197
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 39719 place count 8269 transition count 20196
Performed 1365 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1365 Pre rules applied. Total rules applied 39719 place count 8269 transition count 18831
Deduced a syphon composed of 1365 places in 1118 ms
Reduce places removed 1365 places and 0 transitions.
Iterating global reduction 6 with 2730 rules applied. Total rules applied 42449 place count 6904 transition count 18831
Symmetric choice reduction at 6 with 275 rule applications. Total rules 42724 place count 6904 transition count 18831
Deduced a syphon composed of 275 places in 795 ms
Reduce places removed 275 places and 5645 transitions.
Iterating global reduction 6 with 550 rules applied. Total rules applied 43274 place count 6629 transition count 13186
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Iterating post reduction 6 with 250 rules applied. Total rules applied 43524 place count 6629 transition count 12936
Performed 1665 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 1665 places in 4 ms
Reduce places removed 1665 places and 0 transitions.
Iterating global reduction 7 with 3330 rules applied. Total rules applied 46854 place count 4964 transition count 11266
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 46860 place count 4964 transition count 11260
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 160 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 47062 place count 4863 transition count 11734
Performed 101 Post agglomeration using F-continuation condition with reduction of 155 identical transitions.
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 47264 place count 4762 transition count 12214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 47266 place count 4762 transition count 12212
Performed 101 Post agglomeration using F-continuation condition with reduction of 160 identical transitions.
Deduced a syphon composed of 101 places in 16 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 47468 place count 4661 transition count 12682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 47469 place count 4661 transition count 12681
Performed 92 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 92 places in 3 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 10 with 184 rules applied. Total rules applied 47653 place count 4569 transition count 13208
Applied a total of 47653 rules in 14838 ms. Remains 4569 /27146 variables (removed 22577) and now considering 13208/39849 (removed 26641) transitions.
Finished structural reductions, in 1 iterations. Remains : 4569/27146 places, 13208/39849 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 29687 ms. (steps per millisecond=33 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1]
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 591942 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=118 ) properties seen :[0]
[2020-05-21 22:21:53] [INFO ] Flow matrix only has 12502 transitions (discarded 706 similar events)
// Phase 1: matrix 12502 rows 4569 cols
[2020-05-21 22:21:53] [INFO ] Computed 1378 place invariants in 45 ms
[2020-05-21 22:21:57] [INFO ] [Real]Absence check using 1378 positive place invariants in 2558 ms returned sat
[2020-05-21 22:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 22:22:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 22:22:38] [INFO ] [Real]Absence check using state equation in 41925 ms returned (error "Failed to check-sat")
Support contains 6 out of 4569 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4569/4569 places, 13208/13208 transitions.
Graph (trivial) has 2928 edges and 4569 vertex of which 2 / 4569 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 4568 transition count 13145
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 77 place count 4556 transition count 13144
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 77 place count 4556 transition count 13140
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 4552 transition count 13140
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 4552 transition count 13140
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4551 transition count 13139
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 120 place count 4535 transition count 13123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 141 place count 4535 transition count 13102
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 4535 transition count 13102
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 16 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 4532 transition count 13086
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 153 place count 4532 transition count 13083
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 4531 transition count 13091
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 160 place count 4531 transition count 13086
Free-agglomeration rule applied 2833 times with reduction of 1831 identical transitions.
Iterating global reduction 5 with 2833 rules applied. Total rules applied 2993 place count 4531 transition count 8422
Reduce places removed 2833 places and 0 transitions.
Drop transitions removed 3722 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 3756 transitions.
Discarding 1629 places :
Also discarding 4428 output transitions
Drop transitions removed 4428 transitions
Graph (complete) has 5898 edges and 1698 vertex of which 69 are kept as prefixes of interest. Removing 1629 places using SCC suffix rule.14 ms
Iterating post reduction 5 with 6590 rules applied. Total rules applied 9583 place count 69 transition count 238
Drop transitions removed 60 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 124 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 126 rules applied. Total rules applied 9709 place count 69 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 9711 place count 67 transition count 112
Symmetric choice reduction at 8 with 3 rule applications. Total rules 9714 place count 67 transition count 112
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 15 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 9720 place count 64 transition count 97
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 9735 place count 64 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 9739 place count 62 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 9740 place count 62 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 9741 place count 61 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 9742 place count 61 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 9743 place count 60 transition count 78
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (trivial) has 13 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 75 rules applied. Total rules applied 9818 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 3 places :
Also discarding 0 output transitions
Graph (complete) has 26 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Iterating post reduction 11 with 17 rules applied. Total rules applied 9835 place count 19 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 9836 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 9838 place count 18 transition count 20
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 9841 place count 18 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 9843 place count 18 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 9844 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 9845 place count 17 transition count 17
Applied a total of 9845 rules in 2505 ms. Remains 17 /4569 variables (removed 4552) and now considering 17/13208 (removed 13191) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/4569 places, 17/13208 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties seen :[0]
Finished Best-First random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590099762010

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DLCshifumi-PT-5b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 DLCshifumi-PT-5b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922813800062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-5b.tgz
mv DLCshifumi-PT-5b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;