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

About the Execution of ITS-Tools for ShieldRVt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.960 151262.00 171635.00 86.00 FTTFFFTFFTTTTTFT 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.r210-tajo-159033476701079.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 ShieldRVt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476701079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 3.5K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 09:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 614K May 12 20:42 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 ShieldRVt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590635840371

[2020-05-28 03:17: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-28 03:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 03:17:22] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-05-28 03:17:22] [INFO ] Transformed 2503 places.
[2020-05-28 03:17:22] [INFO ] Transformed 2503 transitions.
[2020-05-28 03:17:22] [INFO ] Found NUPN structural information;
[2020-05-28 03:17:22] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2503 rows 2503 cols
[2020-05-28 03:17:22] [INFO ] Computed 201 place invariants in 71 ms
[2020-05-28 03:17:23] [INFO ] [Real]Absence check using 201 positive place invariants in 275 ms returned sat
[2020-05-28 03:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:27] [INFO ] [Real]Absence check using state equation in 4383 ms returned (error "Failed to check-sat")
[2020-05-28 03:17:28] [INFO ] [Real]Absence check using 201 positive place invariants in 249 ms returned sat
[2020-05-28 03:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:32] [INFO ] [Real]Absence check using state equation in 4327 ms returned unknown
[2020-05-28 03:17:33] [INFO ] [Real]Absence check using 201 positive place invariants in 367 ms returned sat
[2020-05-28 03:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:37] [INFO ] [Real]Absence check using state equation in 4343 ms returned (error "Failed to check-sat")
[2020-05-28 03:17:38] [INFO ] [Real]Absence check using 201 positive place invariants in 250 ms returned sat
[2020-05-28 03:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:42] [INFO ] [Real]Absence check using state equation in 4430 ms returned (error "Failed to check-sat")
[2020-05-28 03:17:43] [INFO ] [Real]Absence check using 201 positive place invariants in 247 ms returned sat
[2020-05-28 03:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:47] [INFO ] [Real]Absence check using state equation in 4445 ms returned (error "Failed to check-sat")
[2020-05-28 03:17:48] [INFO ] [Real]Absence check using 201 positive place invariants in 275 ms returned sat
[2020-05-28 03:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:52] [INFO ] [Real]Absence check using state equation in 4417 ms returned (error "Failed to check-sat")
[2020-05-28 03:17:53] [INFO ] [Real]Absence check using 201 positive place invariants in 255 ms returned sat
[2020-05-28 03:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:17:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:17:57] [INFO ] [Real]Absence check using state equation in 4434 ms returned unknown
[2020-05-28 03:17:58] [INFO ] [Real]Absence check using 201 positive place invariants in 347 ms returned sat
[2020-05-28 03:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:18:02] [INFO ] [Real]Absence check using state equation in 4249 ms returned (error "Failed to check-sat")
[2020-05-28 03:18:03] [INFO ] [Real]Absence check using 201 positive place invariants in 337 ms returned sat
[2020-05-28 03:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:18:07] [INFO ] [Real]Absence check using state equation in 4289 ms returned (error "Failed to check-sat")
[2020-05-28 03:18:08] [INFO ] [Real]Absence check using 201 positive place invariants in 253 ms returned sat
[2020-05-28 03:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-28 03:18:12] [INFO ] [Real]Absence check using state equation in 4322 ms returned (error "Failed to check-sat")
Support contains 49 out of 2503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Performed 766 Post agglomeration using F-continuation condition.Transition count delta: 766
Iterating post reduction 0 with 766 rules applied. Total rules applied 766 place count 2503 transition count 1737
Reduce places removed 766 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 768 rules applied. Total rules applied 1534 place count 1737 transition count 1735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1535 place count 1736 transition count 1735
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 1535 place count 1736 transition count 1528
Deduced a syphon composed of 207 places in 7 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 1949 place count 1529 transition count 1528
Symmetric choice reduction at 3 with 341 rule applications. Total rules 2290 place count 1529 transition count 1528
Deduced a syphon composed of 341 places in 16 ms
Reduce places removed 341 places and 341 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2972 place count 1188 transition count 1187
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 2972 place count 1188 transition count 1052
Deduced a syphon composed of 135 places in 3 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 3242 place count 1053 transition count 1052
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 441
Deduced a syphon composed of 441 places in 3 ms
Reduce places removed 441 places and 0 transitions.
Iterating global reduction 3 with 882 rules applied. Total rules applied 4124 place count 612 transition count 611
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4326 place count 511 transition count 696
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 4396 place count 476 transition count 728
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4397 place count 476 transition count 727
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4401 place count 476 transition count 723
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4405 place count 472 transition count 723
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4406 place count 472 transition count 723
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 4409 place count 472 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4410 place count 471 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4411 place count 470 transition count 719
Applied a total of 4411 rules in 1103 ms. Remains 470 /2503 variables (removed 2033) and now considering 719/2503 (removed 1784) transitions.
Finished structural reductions, in 1 iterations. Remains : 470/2503 places, 719/2503 transitions.
Incomplete random walk after 1000000 steps, including 217 resets, run finished after 4296 ms. (steps per millisecond=232 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 0, 1]
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 36 resets, run finished after 2507 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2290 ms. (steps per millisecond=436 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 2431 ms. (steps per millisecond=411 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 21 resets, run finished after 2483 ms. (steps per millisecond=402 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 2442 ms. (steps per millisecond=409 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 719 rows 470 cols
[2020-05-28 03:18:35] [INFO ] Computed 200 place invariants in 2 ms
[2020-05-28 03:18:35] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-05-28 03:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:36] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2020-05-28 03:18:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2020-05-28 03:18:36] [INFO ] [Real]Added 34 Read/Feed constraints in 15 ms returned sat
[2020-05-28 03:18:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:18:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2020-05-28 03:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:37] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2020-05-28 03:18:37] [INFO ] [Nat]Added 34 Read/Feed constraints in 10 ms returned sat
[2020-05-28 03:18:37] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 95 ms.
[2020-05-28 03:18:43] [INFO ] Added : 604 causal constraints over 122 iterations in 6209 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 71 ms.
[2020-05-28 03:18:43] [INFO ] [Real]Absence check using 200 positive place invariants in 65 ms returned sat
[2020-05-28 03:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:44] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2020-05-28 03:18:44] [INFO ] [Real]Added 34 Read/Feed constraints in 13 ms returned sat
[2020-05-28 03:18:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:18:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 78 ms returned sat
[2020-05-28 03:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:45] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2020-05-28 03:18:45] [INFO ] [Nat]Added 34 Read/Feed constraints in 12 ms returned sat
[2020-05-28 03:18:45] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 89 ms.
[2020-05-28 03:18:53] [INFO ] Added : 624 causal constraints over 125 iterations in 7638 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-05-28 03:18:53] [INFO ] [Real]Absence check using 200 positive place invariants in 82 ms returned sat
[2020-05-28 03:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:54] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2020-05-28 03:18:54] [INFO ] [Real]Added 34 Read/Feed constraints in 10 ms returned sat
[2020-05-28 03:18:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:18:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 62 ms returned sat
[2020-05-28 03:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:18:54] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2020-05-28 03:18:54] [INFO ] [Nat]Added 34 Read/Feed constraints in 12 ms returned sat
[2020-05-28 03:18:54] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 61 ms.
[2020-05-28 03:19:03] [INFO ] Added : 626 causal constraints over 126 iterations in 8493 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-05-28 03:19:03] [INFO ] [Real]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-05-28 03:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:04] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2020-05-28 03:19:04] [INFO ] [Real]Added 34 Read/Feed constraints in 9 ms returned sat
[2020-05-28 03:19:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:19:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-05-28 03:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:05] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2020-05-28 03:19:05] [INFO ] [Nat]Added 34 Read/Feed constraints in 9 ms returned sat
[2020-05-28 03:19:05] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 40 ms.
[2020-05-28 03:19:14] [INFO ] Added : 621 causal constraints over 125 iterations in 9167 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
[2020-05-28 03:19:14] [INFO ] [Real]Absence check using 200 positive place invariants in 61 ms returned sat
[2020-05-28 03:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:15] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2020-05-28 03:19:15] [INFO ] [Real]Added 34 Read/Feed constraints in 7 ms returned sat
[2020-05-28 03:19:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:19:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 130 ms returned sat
[2020-05-28 03:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:16] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2020-05-28 03:19:16] [INFO ] [Nat]Added 34 Read/Feed constraints in 12 ms returned sat
[2020-05-28 03:19:16] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 47 ms.
[2020-05-28 03:19:26] [INFO ] Added : 633 causal constraints over 127 iterations in 10588 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-05-28 03:19:27] [INFO ] [Real]Absence check using 200 positive place invariants in 70 ms returned sat
[2020-05-28 03:19:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:27] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2020-05-28 03:19:27] [INFO ] [Real]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-05-28 03:19:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:19:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-05-28 03:19:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:28] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-05-28 03:19:28] [INFO ] [Nat]Added 34 Read/Feed constraints in 17 ms returned sat
[2020-05-28 03:19:28] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 50 ms.
[2020-05-28 03:19:38] [INFO ] Added : 634 causal constraints over 127 iterations in 9850 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 94 ms.
[2020-05-28 03:19:38] [INFO ] [Real]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-05-28 03:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:39] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2020-05-28 03:19:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:19:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-05-28 03:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:19:40] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-05-28 03:19:40] [INFO ] [Nat]Added 34 Read/Feed constraints in 11 ms returned sat
[2020-05-28 03:19:40] [INFO ] Computed and/alt/rep : 701/2283/701 causal constraints in 54 ms.
[2020-05-28 03:19:48] [INFO ] Added : 621 causal constraints over 125 iterations in 8217 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
Incomplete Parikh walk after 101700 steps, including 319 resets, run finished after 725 ms. (steps per millisecond=140 ) properties seen :[1, 1, 1, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 95500 steps, including 532 resets, run finished after 489 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 100600 steps, including 448 resets, run finished after 478 ms. (steps per millisecond=210 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 139100 steps, including 693 resets, run finished after 622 ms. (steps per millisecond=223 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 5252 steps, including 20 resets, run visited all 1 properties in 25 ms. (steps per millisecond=210 )
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590635991633

--------------------
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="ShieldRVt-PT-050B"
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 ShieldRVt-PT-050B, 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 r210-tajo-159033476701079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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