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-158987914000511.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-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:37 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 91K 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-08-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591160218482

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:57:00] [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 04:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:57:00] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-06-03 04:57:00] [INFO ] Transformed 393 places.
[2020-06-03 04:57:00] [INFO ] Transformed 344 transitions.
[2020-06-03 04:57:00] [INFO ] Found NUPN structural information;
[2020-06-03 04:57:00] [INFO ] Parsed PT model containing 393 places and 344 transitions in 96 ms.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
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]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 331 rows 380 cols
[2020-06-03 04:57:00] [INFO ] Computed 58 place invariants in 15 ms
[2020-06-03 04:57:01] [INFO ] [Real]Absence check using 44 positive place invariants in 51 ms returned sat
[2020-06-03 04:57:01] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-03 04:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:01] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 35 places in 61 ms
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 18 places in 59 ms
[2020-06-03 04:57:01] [INFO ] Deduced a trap composed of 21 places in 57 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 30 places in 54 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 55 places in 50 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 33 places in 55 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 53 places in 45 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 52 places in 57 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 54 places in 56 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 58 places in 55 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 57 places in 50 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2020-06-03 04:57:02] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 63 places in 79 ms
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 70 places in 50 ms
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 50 places in 52 ms
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 53 places in 50 ms
[2020-06-03 04:57:03] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1899 ms
[2020-06-03 04:57:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:03] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2020-06-03 04:57:03] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-03 04:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:03] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2020-06-03 04:57:03] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 25 places in 215 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 33 places in 53 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 40 places in 85 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 19 places in 80 ms
[2020-06-03 04:57:04] [INFO ] Deduced a trap composed of 58 places in 59 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 58 places in 55 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 38 places in 138 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 35 places in 171 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 35 places in 51 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 19 places in 164 ms
[2020-06-03 04:57:05] [INFO ] Deduced a trap composed of 44 places in 151 ms
[2020-06-03 04:57:06] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-06-03 04:57:06] [INFO ] Deduced a trap composed of 47 places in 174 ms
[2020-06-03 04:57:06] [INFO ] Deduced a trap composed of 50 places in 173 ms
[2020-06-03 04:57:06] [INFO ] Deduced a trap composed of 60 places in 154 ms
[2020-06-03 04:57:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2851 ms
[2020-06-03 04:57:06] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 30 ms.
[2020-06-03 04:57:08] [INFO ] Added : 266 causal constraints over 54 iterations in 1594 ms. Result :sat
[2020-06-03 04:57:08] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2020-06-03 04:57:08] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2020-06-03 04:57:08] [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 s23 s24 s27 s28 s39 s40 s82 s83 s84 s87 s88 s89 s90 s91 s92 s96 s97 s98 s111 s112 s113 s114 s115 s118 s119 s133 s136 s167 s189 s204 s249 s264 s269 s274 s375 s376) 0)") while checking expression at index 0
[2020-06-03 04:57:08] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2020-06-03 04:57:08] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-03 04:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:08] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-06-03 04:57:08] [INFO ] Deduced a trap composed of 13 places in 108 ms
[2020-06-03 04:57:08] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 17 places in 93 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 14 places in 89 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 101 places in 86 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 25 places in 108 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 96 places in 81 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-06-03 04:57:09] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 95 places in 123 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 33 places in 298 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 90 places in 86 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 93 places in 82 ms
[2020-06-03 04:57:10] [INFO ] Deduced a trap composed of 86 places in 141 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 88 places in 145 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 88 places in 80 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 85 places in 112 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 89 places in 93 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 86 places in 89 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 89 places in 225 ms
[2020-06-03 04:57:11] [INFO ] Deduced a trap composed of 93 places in 101 ms
[2020-06-03 04:57:12] [INFO ] Deduced a trap composed of 98 places in 82 ms
[2020-06-03 04:57:12] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3364 ms
[2020-06-03 04:57:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:12] [INFO ] [Nat]Absence check using 44 positive place invariants in 66 ms returned sat
[2020-06-03 04:57:12] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-03 04:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:13] [INFO ] [Nat]Absence check using state equation in 995 ms returned sat
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 50 places in 140 ms
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2020-06-03 04:57:13] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 29 places in 40 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 20 places in 44 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 24 places in 31 ms
[2020-06-03 04:57:14] [INFO ] Deduced a trap composed of 32 places in 32 ms
[2020-06-03 04:57:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1710 ms
[2020-06-03 04:57:14] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 20 ms.
[2020-06-03 04:57:16] [INFO ] Added : 258 causal constraints over 52 iterations in 1380 ms. Result :sat
[2020-06-03 04:57:16] [INFO ] Deduced a trap composed of 92 places in 159 ms
[2020-06-03 04:57:16] [INFO ] Deduced a trap composed of 91 places in 130 ms
[2020-06-03 04:57:16] [INFO ] Deduced a trap composed of 90 places in 90 ms
[2020-06-03 04:57:16] [INFO ] Deduced a trap composed of 98 places in 77 ms
[2020-06-03 04:57:17] [INFO ] Deduced a trap composed of 91 places in 109 ms
[2020-06-03 04:57:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:57:17] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-06-03 04:57:17] [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 s120 s121 s122 s137 s138 s267 s270 s271 s273 s274 s275) 0)") while checking expression at index 1
[2020-06-03 04:57:17] [INFO ] [Real]Absence check using 44 positive place invariants in 26 ms returned sat
[2020-06-03 04:57:17] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-03 04:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:17] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2020-06-03 04:57:17] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-03 04:57:18] [INFO ] Deduced a trap composed of 20 places in 189 ms
[2020-06-03 04:57:18] [INFO ] Deduced a trap composed of 16 places in 186 ms
[2020-06-03 04:57:18] [INFO ] Deduced a trap composed of 11 places in 183 ms
[2020-06-03 04:57:18] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-06-03 04:57:18] [INFO ] Deduced a trap composed of 87 places in 182 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 15 places in 174 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 89 places in 88 ms
[2020-06-03 04:57:19] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-06-03 04:57:20] [INFO ] Deduced a trap composed of 18 places in 1002 ms
[2020-06-03 04:57:21] [INFO ] Deduced a trap composed of 14 places in 538 ms
[2020-06-03 04:57:21] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2020-06-03 04:57:22] [INFO ] Deduced a trap composed of 25 places in 928 ms
[2020-06-03 04:57:22] [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 s118 s119 s123 s124 s125 s133 s136 s167 s253 s254 s255 s258 s259 s260 s263 s264 s265 s269 s274 s294 s295 s296) 0)") while checking expression at index 2
[2020-06-03 04:57:22] [INFO ] [Real]Absence check using 44 positive place invariants in 105 ms returned sat
[2020-06-03 04:57:22] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-03 04:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:23] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-03 04:57:23] [INFO ] Deduced a trap composed of 15 places in 311 ms
[2020-06-03 04:57:23] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-06-03 04:57:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 441 ms
[2020-06-03 04:57:23] [INFO ] [Real]Absence check using 44 positive place invariants in 26 ms returned sat
[2020-06-03 04:57:23] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-03 04:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:23] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2020-06-03 04:57:24] [INFO ] Deduced a trap composed of 8 places in 104 ms
[2020-06-03 04:57:25] [INFO ] Deduced a trap composed of 11 places in 1523 ms
[2020-06-03 04:57:25] [INFO ] Deduced a trap composed of 29 places in 88 ms
[2020-06-03 04:57:26] [INFO ] Deduced a trap composed of 15 places in 795 ms
[2020-06-03 04:57:26] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-06-03 04:57:26] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 15 places in 516 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 32 places in 46 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 19 places in 48 ms
[2020-06-03 04:57:27] [INFO ] Deduced a trap composed of 34 places in 37 ms
[2020-06-03 04:57:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3893 ms
[2020-06-03 04:57:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:27] [INFO ] [Nat]Absence check using 44 positive place invariants in 36 ms returned sat
[2020-06-03 04:57:27] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-03 04:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:28] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2020-06-03 04:57:28] [INFO ] Deduced a trap composed of 20 places in 351 ms
[2020-06-03 04:57:32] [INFO ] Deduced a trap composed of 8 places in 3808 ms
[2020-06-03 04:57:33] [INFO ] Deduced a trap composed of 11 places in 1140 ms
[2020-06-03 04:57:33] [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 s133 s136 s268 s269 s270 s274 s375 s376) 0)") while checking expression at index 4
[2020-06-03 04:57:34] [INFO ] [Real]Absence check using 44 positive place invariants in 267 ms returned unsat
[2020-06-03 04:57:34] [INFO ] [Real]Absence check using 44 positive place invariants in 46 ms returned sat
[2020-06-03 04:57:34] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 12 ms returned sat
[2020-06-03 04:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:35] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2020-06-03 04:57:35] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-03 04:57:35] [INFO ] Deduced a trap composed of 13 places in 94 ms
[2020-06-03 04:57:35] [INFO ] Deduced a trap composed of 14 places in 94 ms
[2020-06-03 04:57:42] [INFO ] Deduced a trap composed of 22 places in 7253 ms
[2020-06-03 04:57: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 s20 s25 s26 s27 s28 s123 s124 s125 s137 s188 s189 s190 s269 s272 s274 s275 s276 s288 s289 s294) 0)") while checking expression at index 6
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 19 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 734 edges and 380 vertex of which 371 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 371 transition count 257
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 299 transition count 257
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 146 place count 299 transition count 192
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 286 place count 224 transition count 192
Symmetric choice reduction at 2 with 61 rule applications. Total rules 347 place count 224 transition count 192
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 61 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 469 place count 163 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 469 place count 163 transition count 126
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 481 place count 156 transition count 126
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 587 place count 103 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 588 place count 103 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 589 place count 103 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 102 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 591 place count 101 transition count 71
Applied a total of 591 rules in 77 ms. Remains 101 /380 variables (removed 279) and now considering 71/331 (removed 260) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/380 places, 71/331 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1407 ms. (steps per millisecond=710 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties seen :[0, 1, 1, 0, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties seen :[0, 0, 0]
// Phase 1: matrix 71 rows 101 cols
[2020-06-03 04:57:46] [INFO ] Computed 38 place invariants in 1 ms
[2020-06-03 04:57:46] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2020-06-03 04:57:46] [INFO ] [Real]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 04:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-03 04:57:46] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 04:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-06-03 04:57:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 71 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 19 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:47] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 9 places in 19 ms
[2020-06-03 04:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2020-06-03 04:57:47] [INFO ] Computed and/alt/rep : 69/211/69 causal constraints in 5 ms.
[2020-06-03 04:57:47] [INFO ] Added : 55 causal constraints over 11 iterations in 124 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-03 04:57:47] [INFO ] [Real]Absence check using 36 positive place invariants in 50 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Real]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:47] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 23 places in 23 ms
[2020-06-03 04:57:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 151 ms
[2020-06-03 04:57:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:47] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 04:57:47] [INFO ] Deduced a trap composed of 10 places in 13 ms
[2020-06-03 04:57:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2020-06-03 04:57:47] [INFO ] Computed and/alt/rep : 69/211/69 causal constraints in 4 ms.
[2020-06-03 04:57:47] [INFO ] Added : 38 causal constraints over 8 iterations in 78 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-03 04:57:47] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Real]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 04:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:48] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 27 places in 22 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 25 places in 20 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 26 places in 20 ms
[2020-06-03 04:57:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
[2020-06-03 04:57:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:57:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2020-06-03 04:57:48] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 04:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:57:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 25 places in 40 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2020-06-03 04:57:48] [INFO ] Deduced a trap composed of 10 places in 52 ms
[2020-06-03 04:57:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 222 ms
[2020-06-03 04:57:48] [INFO ] Computed and/alt/rep : 69/211/69 causal constraints in 5 ms.
[2020-06-03 04:57:48] [INFO ] Added : 40 causal constraints over 8 iterations in 69 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 5500 steps, including 417 resets, run finished after 12 ms. (steps per millisecond=458 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4100 steps, including 170 resets, run finished after 26 ms. (steps per millisecond=157 ) properties seen :[0] could not realise parikh vector
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_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-08"
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-08, 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-158987914000511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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