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-159033476100711.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 ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100711
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 3.9K May 14 01:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 762K 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 ShieldPPPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590614928851

[2020-05-27 21:28:50] [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-27 21:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 21:28:50] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2020-05-27 21:28:50] [INFO ] Transformed 3123 places.
[2020-05-27 21:28:50] [INFO ] Transformed 2843 transitions.
[2020-05-27 21:28:50] [INFO ] Found NUPN structural information;
[2020-05-27 21:28:50] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 138 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1]
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 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, 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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[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]
// Phase 1: matrix 2843 rows 3123 cols
[2020-05-27 21:28:51] [INFO ] Computed 441 place invariants in 60 ms
[2020-05-27 21:28:52] [INFO ] [Real]Absence check using 441 positive place invariants in 603 ms returned sat
[2020-05-27 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:28:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:28:56] [INFO ] [Real]Absence check using state equation in 3919 ms returned (error "Failed to check-sat")
[2020-05-27 21:28:57] [INFO ] [Real]Absence check using 441 positive place invariants in 907 ms returned sat
[2020-05-27 21:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:01] [INFO ] [Real]Absence check using state equation in 3696 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 21:29:02] [INFO ] [Real]Absence check using 441 positive place invariants in 649 ms returned sat
[2020-05-27 21:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:06] [INFO ] [Real]Absence check using state equation in 3855 ms returned sat
[2020-05-27 21:29:09] [INFO ] Deduced a trap composed of 18 places in 2694 ms
[2020-05-27 21:29:09] [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 s2 s3 s4 s2738 s2739 s2740 s2741 s2742 s2743 s2744 s2745 s2749 s2750 s2751 s2752 s2753) 0)") while checking expression at index 2
[2020-05-27 21:29:10] [INFO ] [Real]Absence check using 441 positive place invariants in 625 ms returned sat
[2020-05-27 21:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:29:14] [INFO ] [Real]Absence check using state equation in 4039 ms returned (error "Failed to check-sat")
[2020-05-27 21:29:15] [INFO ] [Real]Absence check using 441 positive place invariants in 598 ms returned sat
[2020-05-27 21:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:29:19] [INFO ] [Real]Absence check using state equation in 3949 ms returned (error "Failed to check-sat")
[2020-05-27 21:29:20] [INFO ] [Real]Absence check using 441 positive place invariants in 605 ms returned sat
[2020-05-27 21:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:29:24] [INFO ] [Real]Absence check using state equation in 3948 ms returned (error "Failed to check-sat")
[2020-05-27 21:29:25] [INFO ] [Real]Absence check using 441 positive place invariants in 767 ms returned sat
[2020-05-27 21:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:29:29] [INFO ] [Real]Absence check using state equation in 3860 ms returned (error "Failed to check-sat")
[2020-05-27 21:29:30] [INFO ] [Real]Absence check using 441 positive place invariants in 788 ms returned sat
[2020-05-27 21:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:29:34] [INFO ] [Real]Absence check using state equation in 3875 ms returned (error "Failed to check-sat")
[2020-05-27 21:29:35] [INFO ] [Real]Absence check using 441 positive place invariants in 625 ms returned sat
[2020-05-27 21:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:29:39] [INFO ] [Real]Absence check using state equation in 4051 ms returned (error "Failed to check-sat")
Support contains 42 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Performed 737 Post agglomeration using F-continuation condition.Transition count delta: 737
Iterating post reduction 0 with 737 rules applied. Total rules applied 737 place count 3123 transition count 2106
Reduce places removed 737 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 739 rules applied. Total rules applied 1476 place count 2386 transition count 2104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1477 place count 2385 transition count 2104
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 1477 place count 2385 transition count 1939
Deduced a syphon composed of 165 places in 5 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 1807 place count 2220 transition count 1939
Symmetric choice reduction at 3 with 274 rule applications. Total rules 2081 place count 2220 transition count 1939
Deduced a syphon composed of 274 places in 12 ms
Reduce places removed 274 places and 274 transitions.
Iterating global reduction 3 with 548 rules applied. Total rules applied 2629 place count 1946 transition count 1665
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 2629 place count 1946 transition count 1555
Deduced a syphon composed of 110 places in 3 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 2849 place count 1836 transition count 1555
Performed 665 Post agglomeration using F-continuation condition.Transition count delta: 665
Deduced a syphon composed of 665 places in 15 ms
Reduce places removed 665 places and 0 transitions.
Iterating global reduction 3 with 1330 rules applied. Total rules applied 4179 place count 1171 transition count 890
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4381 place count 1070 transition count 890
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 4399 place count 1061 transition count 890
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4403 place count 1061 transition count 886
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4407 place count 1057 transition count 886
Partial Free-agglomeration rule applied 114 times.
Drop transitions removed 114 transitions
Iterating global reduction 4 with 114 rules applied. Total rules applied 4521 place count 1057 transition count 886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4522 place count 1056 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4523 place count 1055 transition count 885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4523 place count 1055 transition count 883
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4527 place count 1053 transition count 883
Applied a total of 4527 rules in 1880 ms. Remains 1053 /3123 variables (removed 2070) and now considering 883/2843 (removed 1960) transitions.
Finished structural reductions, in 1 iterations. Remains : 1053/3123 places, 883/2843 transitions.
Incomplete random walk after 1000000 steps, including 1 resets, run finished after 7544 ms. (steps per millisecond=132 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4917 ms. (steps per millisecond=203 ) properties seen :[0, 1, 0, 0]
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 4676 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4827 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0]
// Phase 1: matrix 883 rows 1053 cols
[2020-05-27 21:30:03] [INFO ] Computed 440 place invariants in 8 ms
[2020-05-27 21:30:03] [INFO ] [Real]Absence check using 440 positive place invariants in 298 ms returned sat
[2020-05-27 21:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:05] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2020-05-27 21:30:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-27 21:30:05] [INFO ] [Real]Added 20 Read/Feed constraints in 16 ms returned sat
[2020-05-27 21:30:05] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-05-27 21:30:06] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-05-27 21:30:06] [INFO ] Deduced a trap composed of 3 places in 210 ms
[2020-05-27 21:30:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2020-05-27 21:30:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:30:06] [INFO ] [Nat]Absence check using 440 positive place invariants in 222 ms returned sat
[2020-05-27 21:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:08] [INFO ] [Nat]Absence check using state equation in 2143 ms returned sat
[2020-05-27 21:30:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2020-05-27 21:30:09] [INFO ] Deduced a trap composed of 5 places in 205 ms
[2020-05-27 21:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2020-05-27 21:30:09] [INFO ] Computed and/alt/rep : 865/2072/865 causal constraints in 35 ms.
[2020-05-27 21:30:21] [INFO ] Added : 838 causal constraints over 168 iterations in 12344 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
[2020-05-27 21:30:22] [INFO ] [Real]Absence check using 440 positive place invariants in 397 ms returned sat
[2020-05-27 21:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:24] [INFO ] [Real]Absence check using state equation in 2028 ms returned sat
[2020-05-27 21:30:24] [INFO ] [Real]Added 20 Read/Feed constraints in 24 ms returned sat
[2020-05-27 21:30:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:30:24] [INFO ] [Nat]Absence check using 440 positive place invariants in 299 ms returned sat
[2020-05-27 21:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:27] [INFO ] [Nat]Absence check using state equation in 2442 ms returned sat
[2020-05-27 21:30:27] [INFO ] [Nat]Added 20 Read/Feed constraints in 42 ms returned sat
[2020-05-27 21:30:27] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-05-27 21:30:27] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2020-05-27 21:30:27] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2020-05-27 21:30:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
[2020-05-27 21:30:28] [INFO ] Computed and/alt/rep : 865/2072/865 causal constraints in 51 ms.
[2020-05-27 21:30:44] [INFO ] Added : 832 causal constraints over 167 iterations in 16000 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
[2020-05-27 21:30:44] [INFO ] [Real]Absence check using 440 positive place invariants in 281 ms returned sat
[2020-05-27 21:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:46] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2020-05-27 21:30:46] [INFO ] [Real]Added 20 Read/Feed constraints in 21 ms returned sat
[2020-05-27 21:30:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:30:47] [INFO ] [Nat]Absence check using 440 positive place invariants in 240 ms returned sat
[2020-05-27 21:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:30:49] [INFO ] [Nat]Absence check using state equation in 2168 ms returned sat
[2020-05-27 21:30:49] [INFO ] [Nat]Added 20 Read/Feed constraints in 11 ms returned sat
[2020-05-27 21:30:49] [INFO ] Deduced a trap composed of 6 places in 112 ms
[2020-05-27 21:30:49] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2020-05-27 21:30:49] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-05-27 21:30:49] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-27 21:30:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 577 ms
[2020-05-27 21:30:49] [INFO ] Computed and/alt/rep : 865/2072/865 causal constraints in 31 ms.
[2020-05-27 21:31:05] [INFO ] Added : 846 causal constraints over 170 iterations in 15727 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
Incomplete Parikh walk after 165200 steps, including 426 resets, run finished after 1570 ms. (steps per millisecond=105 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 52622 steps, including 85 resets, run visited all 2 properties in 398 ms. (steps per millisecond=132 )
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590615068136

--------------------
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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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-159033476100711"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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