Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100599.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 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 189K 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 BusinessProcesses-PT-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591167529107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:58:51] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2020-06-03 06:58:51] [INFO ] Transformed 772 places.
[2020-06-03 06:58:51] [INFO ] Transformed 685 transitions.
[2020-06-03 06:58:51] [INFO ] Found NUPN structural information;
[2020-06-03 06:58:51] [INFO ] Parsed PT model containing 772 places and 685 transitions in 202 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 670 rows 757 cols
[2020-06-03 06:58:51] [INFO ] Computed 125 place invariants in 26 ms
[2020-06-03 06:58:51] [INFO ] [Real]Absence check using 78 positive place invariants in 66 ms returned sat
[2020-06-03 06:58:51] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2020-06-03 06:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:53] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 8 places in 476 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 17 places in 448 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 11 places in 344 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 24 places in 254 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 15 places in 270 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 149 places in 288 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 15 places in 253 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 19 places in 402 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2020-06-03 06:58:56] [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 s42 s43 s300 s303 s345 s350 s390 s399 s400 s401 s405 s593 s594 s718 s719 s726) 0)") while checking expression at index 0
[2020-06-03 06:58:57] [INFO ] [Real]Absence check using 78 positive place invariants in 50 ms returned unsat
[2020-06-03 06:58:57] [INFO ] [Real]Absence check using 78 positive place invariants in 37 ms returned unsat
[2020-06-03 06:58:57] [INFO ] [Real]Absence check using 78 positive place invariants in 55 ms returned sat
[2020-06-03 06:58:57] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 35 ms returned sat
[2020-06-03 06:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:58] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2020-06-03 06:58:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:58] [INFO ] [Nat]Absence check using 78 positive place invariants in 90 ms returned sat
[2020-06-03 06:58:58] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2020-06-03 06:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:59] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 11 places in 118 ms
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 33 places in 133 ms
[2020-06-03 06:59:00] [INFO ] Deduced a trap composed of 26 places in 130 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 19 places in 114 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 16 places in 118 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 30 places in 118 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-06-03 06:59:01] [INFO ] Deduced a trap composed of 25 places in 117 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 23 places in 119 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 22 places in 116 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 39 places in 115 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 60 places in 154 ms
[2020-06-03 06:59:02] [INFO ] Deduced a trap composed of 38 places in 104 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 34 places in 98 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 65 places in 93 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 32 places in 104 ms
[2020-06-03 06:59:03] [INFO ] Deduced a trap composed of 38 places in 92 ms
[2020-06-03 06:59:03] [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 s129 s130 s131 s132 s137 s138 s139 s140 s141 s142 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s450 s453 s454 s456 s457 s458 s555) 0)") while checking expression at index 3
[2020-06-03 06:59:03] [INFO ] [Real]Absence check using 78 positive place invariants in 73 ms returned sat
[2020-06-03 06:59:03] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2020-06-03 06:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:04] [INFO ] [Real]Absence check using state equation in 765 ms returned unsat
[2020-06-03 06:59:04] [INFO ] [Real]Absence check using 78 positive place invariants in 62 ms returned sat
[2020-06-03 06:59:04] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 32 ms returned sat
[2020-06-03 06:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:06] [INFO ] [Real]Absence check using state equation in 1542 ms returned sat
[2020-06-03 06:59:06] [INFO ] Deduced a trap composed of 11 places in 186 ms
[2020-06-03 06:59:06] [INFO ] Deduced a trap composed of 16 places in 177 ms
[2020-06-03 06:59:07] [INFO ] Deduced a trap composed of 31 places in 335 ms
[2020-06-03 06:59:07] [INFO ] Deduced a trap composed of 8 places in 281 ms
[2020-06-03 06:59:07] [INFO ] Deduced a trap composed of 21 places in 268 ms
[2020-06-03 06:59:08] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-06-03 06:59:09] [INFO ] Deduced a trap composed of 33 places in 1575 ms
[2020-06-03 06:59: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 s37 s38 s39 s50 s51 s52 s68 s69 s300 s303 s350 s364 s365 s366 s375 s380 s390 s400 s405 s565 s566 s569 s570 s573 s574 s593 s594 s718 s719 s726) 0)") while checking expression at index 5
[2020-06-03 06:59:10] [INFO ] [Real]Absence check using 78 positive place invariants in 191 ms returned sat
[2020-06-03 06:59:10] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 35 ms returned sat
[2020-06-03 06:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:12] [INFO ] [Real]Absence check using state equation in 2407 ms returned sat
[2020-06-03 06:59:12] [INFO ] Deduced a trap composed of 20 places in 242 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 13 places in 245 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 8 places in 212 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 11 places in 119 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 34 places in 122 ms
[2020-06-03 06:59:13] [INFO ] Deduced a trap composed of 16 places in 131 ms
[2020-06-03 06:59:14] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-06-03 06:59:14] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2020-06-03 06:59:14] [INFO ] Deduced a trap composed of 28 places in 126 ms
[2020-06-03 06:59:14] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2020-06-03 06:59:14] [INFO ] Deduced a trap composed of 33 places in 119 ms
[2020-06-03 06:59:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s68 s69 s290 s291 s292 s300 s303 s345 s350 s359 s360 s361 s370 s374 s375 s376 s380 s390 s400 s405 s565 s566 s573 s574 s579 s580 s581 s593 s594 s726) 0)") while checking expression at index 6
[2020-06-03 06:59:15] [INFO ] [Real]Absence check using 78 positive place invariants in 149 ms returned sat
[2020-06-03 06:59:15] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 37 ms returned sat
[2020-06-03 06:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:17] [INFO ] [Real]Absence check using state equation in 2490 ms returned sat
[2020-06-03 06:59:18] [INFO ] Deduced a trap composed of 13 places in 1099 ms
[2020-06-03 06:59:19] [INFO ] Deduced a trap composed of 8 places in 267 ms
[2020-06-03 06:59:19] [INFO ] Deduced a trap composed of 20 places in 774 ms
[2020-06-03 06:59:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s290 s291 s292 s300 s303 s345 s350 s390 s399 s400 s401 s405 s565 s566 s593 s594 s726) 0)") while checking expression at index 7
[2020-06-03 06:59:19] [INFO ] [Real]Absence check using 78 positive place invariants in 58 ms returned sat
[2020-06-03 06:59:20] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 37 ms returned sat
[2020-06-03 06:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:21] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2020-06-03 06:59:22] [INFO ] Deduced a trap composed of 23 places in 1714 ms
[2020-06-03 06:59:23] [INFO ] Deduced a trap composed of 172 places in 686 ms
[2020-06-03 06:59:25] [INFO ] Deduced a trap composed of 14 places in 1614 ms
[2020-06-03 06:59:25] [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 s5 s6 s7 s8 s9 s275 s354 s355 s356) 0)") while checking expression at index 8
[2020-06-03 06:59:25] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2020-06-03 06:59:25] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2020-06-03 06:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:26] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2020-06-03 06:59:26] [INFO ] Deduced a trap composed of 11 places in 266 ms
[2020-06-03 06:59:27] [INFO ] Deduced a trap composed of 16 places in 273 ms
[2020-06-03 06:59:27] [INFO ] Deduced a trap composed of 13 places in 526 ms
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 24 places in 520 ms
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 35 places in 266 ms
[2020-06-03 06:59:31] [INFO ] Deduced a trap composed of 8 places in 3076 ms
[2020-06-03 06:59:31] [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 s300 s303 s404 s405 s406) 0)") while checking expression at index 9
[2020-06-03 06:59:31] [INFO ] [Real]Absence check using 78 positive place invariants in 57 ms returned sat
[2020-06-03 06:59:31] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 39 ms returned sat
[2020-06-03 06:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:32] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2020-06-03 06:59:33] [INFO ] Deduced a trap composed of 16 places in 450 ms
[2020-06-03 06:59:33] [INFO ] Deduced a trap composed of 16 places in 466 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 23 places in 490 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 155 places in 393 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 38 places in 453 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 11 places in 527 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 8 places in 445 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 34 places in 539 ms
[2020-06-03 06:59:37] [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 s37 s38 s39 s44 s45 s46 s68 s69 s290 s291 s292 s300 s303 s350 s369 s370 s371 s375 s380 s390 s400 s405 s565 s566 s569 s570 s573 s574 s593 s594 s726) 0)") while checking expression at index 10
[2020-06-03 06:59:37] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2020-06-03 06:59:37] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2020-06-03 06:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:39] [INFO ] [Real]Absence check using state equation in 1855 ms returned sat
[2020-06-03 06:59:39] [INFO ] Deduced a trap composed of 8 places in 323 ms
[2020-06-03 06:59:39] [INFO ] Deduced a trap composed of 23 places in 248 ms
[2020-06-03 06:59:40] [INFO ] Deduced a trap composed of 16 places in 442 ms
[2020-06-03 06:59:40] [INFO ] Deduced a trap composed of 144 places in 262 ms
[2020-06-03 06:59:40] [INFO ] Deduced a trap composed of 31 places in 270 ms
[2020-06-03 06:59:41] [INFO ] Deduced a trap composed of 34 places in 610 ms
[2020-06-03 06:59:41] [INFO ] Deduced a trap composed of 12 places in 257 ms
[2020-06-03 06:59:41] [INFO ] Deduced a trap composed of 146 places in 292 ms
[2020-06-03 06:59:42] [INFO ] Deduced a trap composed of 36 places in 240 ms
[2020-06-03 06:59:42] [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 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s103 s441 s442 s443 s531 s532 s533) 0)") while checking expression at index 11
[2020-06-03 06:59:42] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned unsat
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 40 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 748 transition count 553
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 632 transition count 553
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 233 place count 632 transition count 399
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 329 rules applied. Total rules applied 562 place count 457 transition count 399
Symmetric choice reduction at 2 with 91 rule applications. Total rules 653 place count 457 transition count 399
Deduced a syphon composed of 91 places in 6 ms
Reduce places removed 91 places and 91 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 835 place count 366 transition count 308
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 835 place count 366 transition count 301
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 851 place count 357 transition count 301
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 1063 place count 250 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1065 place count 249 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1066 place count 249 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 248 transition count 198
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 1072 place count 248 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1073 place count 247 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1074 place count 246 transition count 197
Applied a total of 1074 rules in 172 ms. Remains 246 /757 variables (removed 511) and now considering 197/670 (removed 473) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/757 places, 197/670 transitions.
Incomplete random walk after 1000000 steps, including 47324 resets, run finished after 2382 ms. (steps per millisecond=419 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 13025 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 12402 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 12833 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 12652 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 12591 resets, run finished after 1053 ms. (steps per millisecond=949 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 197 rows 246 cols
[2020-06-03 06:59:50] [INFO ] Computed 91 place invariants in 2 ms
[2020-06-03 06:59:51] [INFO ] [Real]Absence check using 69 positive place invariants in 219 ms returned sat
[2020-06-03 06:59:51] [INFO ] [Real]Absence check using 69 positive and 22 generalized place invariants in 12 ms returned sat
[2020-06-03 06:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:51] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 06:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 06:59:51] [INFO ] [Real]Added 4 Read/Feed constraints in 19 ms returned sat
[2020-06-03 06:59:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:51] [INFO ] [Nat]Absence check using 69 positive place invariants in 29 ms returned sat
[2020-06-03 06:59:51] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 8 ms returned sat
[2020-06-03 06:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:51] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-06-03 06:59:51] [INFO ] [Nat]Added 4 Read/Feed constraints in 24 ms returned sat
[2020-06-03 06:59:51] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 34 ms.
[2020-06-03 06:59:51] [INFO ] Added : 73 causal constraints over 16 iterations in 366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 06:59:52] [INFO ] [Real]Absence check using 69 positive place invariants in 25 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Real]Absence check using 69 positive and 22 generalized place invariants in 9 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:52] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:59:52] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 26 ms.
[2020-06-03 06:59:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:52] [INFO ] [Nat]Absence check using 69 positive place invariants in 24 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 8 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:52] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-06-03 06:59:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 18 ms returned sat
[2020-06-03 06:59:52] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 27 ms.
[2020-06-03 06:59:53] [INFO ] Added : 80 causal constraints over 17 iterations in 358 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 06:59:53] [INFO ] [Real]Absence check using 69 positive place invariants in 22 ms returned sat
[2020-06-03 06:59:53] [INFO ] [Real]Absence check using 69 positive and 22 generalized place invariants in 28 ms returned sat
[2020-06-03 06:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:53] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-06-03 06:59:53] [INFO ] [Real]Added 4 Read/Feed constraints in 13 ms returned sat
[2020-06-03 06:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:53] [INFO ] [Nat]Absence check using 69 positive place invariants in 56 ms returned sat
[2020-06-03 06:59:53] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 31 ms returned sat
[2020-06-03 06:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:54] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-06-03 06:59:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 14 ms returned sat
[2020-06-03 06:59:54] [INFO ] Deduced a trap composed of 56 places in 150 ms
[2020-06-03 06:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2020-06-03 06:59:54] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 14 ms.
[2020-06-03 06:59:54] [INFO ] Added : 100 causal constraints over 21 iterations in 572 ms. Result :sat
[2020-06-03 06:59:54] [INFO ] Deduced a trap composed of 56 places in 127 ms
[2020-06-03 06:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 06:59:55] [INFO ] [Real]Absence check using 69 positive place invariants in 60 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Real]Absence check using 69 positive and 22 generalized place invariants in 8 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:55] [INFO ] [Nat]Absence check using 69 positive place invariants in 25 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 7 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:55] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-03 06:59:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2020-06-03 06:59:55] [INFO ] Deduced a trap composed of 52 places in 74 ms
[2020-06-03 06:59:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2020-06-03 06:59:55] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 14 ms.
[2020-06-03 06:59:56] [INFO ] Added : 82 causal constraints over 18 iterations in 591 ms. Result :sat
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 58 places in 169 ms
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 55 places in 103 ms
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 57 places in 126 ms
[2020-06-03 06:59:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 06:59:56] [INFO ] [Real]Absence check using 69 positive place invariants in 37 ms returned sat
[2020-06-03 06:59:56] [INFO ] [Real]Absence check using 69 positive and 22 generalized place invariants in 7 ms returned sat
[2020-06-03 06:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:57] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 06:59:57] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:59:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:57] [INFO ] [Nat]Absence check using 69 positive place invariants in 36 ms returned sat
[2020-06-03 06:59:57] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 12 ms returned sat
[2020-06-03 06:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:57] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-06-03 06:59:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 19 ms returned sat
[2020-06-03 06:59:57] [INFO ] Computed and/alt/rep : 192/1014/192 causal constraints in 19 ms.
[2020-06-03 06:59:58] [INFO ] Added : 88 causal constraints over 19 iterations in 492 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 10400 steps, including 655 resets, run finished after 34 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9000 steps, including 596 resets, run finished after 29 ms. (steps per millisecond=310 ) properties seen :[0, 0, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12100 steps, including 803 resets, run finished after 39 ms. (steps per millisecond=310 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11100 steps, including 749 resets, run finished after 30 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 504 resets, run finished after 20 ms. (steps per millisecond=390 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 197/197 transitions.
Graph (trivial) has 29 edges and 246 vertex of which 4 / 246 are part of one of the 1 SCC in 11 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 243 transition count 184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 235 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 235 transition count 181
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 230 transition count 181
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 230 transition count 181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 228 transition count 179
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 66 place count 213 transition count 164
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 213 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 212 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 212 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 211 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 210 transition count 161
Applied a total of 72 rules in 66 ms. Remains 210 /246 variables (removed 36) and now considering 161/197 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/246 places, 161/197 transitions.
Incomplete random walk after 1000000 steps, including 36598 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties seen :[1, 0, 1]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 728 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=364 )
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-19, 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 r182-oct2-158987914100599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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