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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:51 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.6K 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.1K 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.2K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591161350330

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:15:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:15:52] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 05:15:52] [INFO ] Transformed 518 places.
[2020-06-03 05:15:52] [INFO ] Transformed 471 transitions.
[2020-06-03 05:15:52] [INFO ] Found NUPN structural information;
[2020-06-03 05:15:52] [INFO ] Parsed PT model containing 518 places and 471 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 80 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2020-06-03 05:15:52] [INFO ] Computed 85 place invariants in 21 ms
[2020-06-03 05:15:53] [INFO ] [Real]Absence check using 48 positive place invariants in 40 ms returned sat
[2020-06-03 05:15:53] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 36 ms returned sat
[2020-06-03 05:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:15:53] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2020-06-03 05:15:53] [INFO ] Deduced a trap composed of 11 places in 235 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 12 places in 152 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-06-03 05:15:54] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-06-03 05:15:55] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2020-06-03 05:15:55] [INFO ] Deduced a trap composed of 32 places in 104 ms
[2020-06-03 05:15:55] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2020-06-03 05:15:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1575 ms
[2020-06-03 05:15:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:15:55] [INFO ] [Nat]Absence check using 48 positive place invariants in 41 ms returned sat
[2020-06-03 05:15:55] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 33 ms returned sat
[2020-06-03 05:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:15:55] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 26 places in 115 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 24 places in 144 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 33 places in 137 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 12 places in 125 ms
[2020-06-03 05:15:56] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2020-06-03 05:15:57] [INFO ] Deduced a trap composed of 15 places in 198 ms
[2020-06-03 05:15:58] [INFO ] Deduced a trap composed of 23 places in 1373 ms
[2020-06-03 05:15:58] [INFO ] Deduced a trap composed of 21 places in 64 ms
[2020-06-03 05:15:58] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-06-03 05:15:58] [INFO ] Deduced a trap composed of 22 places in 45 ms
[2020-06-03 05:15:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2849 ms
[2020-06-03 05:15:58] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 26 ms.
[2020-06-03 05:16:00] [INFO ] Added : 205 causal constraints over 41 iterations in 1458 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 05:16:00] [INFO ] [Real]Absence check using 48 positive place invariants in 35 ms returned sat
[2020-06-03 05:16:00] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-06-03 05:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:00] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 05:16:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:16:01] [INFO ] [Nat]Absence check using 48 positive place invariants in 45 ms returned sat
[2020-06-03 05:16:01] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-06-03 05:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:01] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2020-06-03 05:16:01] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-06-03 05:16:01] [INFO ] Deduced a trap composed of 15 places in 141 ms
[2020-06-03 05:16:02] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2020-06-03 05:16:02] [INFO ] Deduced a trap composed of 94 places in 135 ms
[2020-06-03 05:16:02] [INFO ] Deduced a trap composed of 18 places in 261 ms
[2020-06-03 05:16:02] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-06-03 05:16:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1054 ms
[2020-06-03 05:16:02] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 27 ms.
[2020-06-03 05:16:04] [INFO ] Added : 254 causal constraints over 52 iterations in 1967 ms. Result :sat
[2020-06-03 05:16:04] [INFO ] Deduced a trap composed of 113 places in 114 ms
[2020-06-03 05:16:04] [INFO ] Deduced a trap composed of 94 places in 117 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 117 places in 117 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 111 places in 115 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 113 places in 118 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 98 places in 114 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 107 places in 116 ms
[2020-06-03 05:16:05] [INFO ] Deduced a trap composed of 102 places in 229 ms
[2020-06-03 05:16:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:16:06] [INFO ] Deduced a trap composed of 9 places in 170 ms
[2020-06-03 05:16:06] [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 s212 s213 s351 s352 s353 s354 s355) 0)") while checking expression at index 1
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using 48 positive place invariants in 18 ms returned unsat
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using 48 positive place invariants in 28 ms returned sat
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned unsat
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using 48 positive place invariants in 26 ms returned sat
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-06-03 05:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:06] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 111 places in 183 ms
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 31 places in 129 ms
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 52 places in 122 ms
[2020-06-03 05:16:07] [INFO ] Deduced a trap composed of 32 places in 127 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 131 places in 165 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 137 places in 145 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 120 places in 145 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 53 places in 146 ms
[2020-06-03 05:16:08] [INFO ] Deduced a trap composed of 41 places in 118 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 135 places in 156 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 116 places in 112 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 122 places in 109 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 62 places in 134 ms
[2020-06-03 05:16:09] [INFO ] Deduced a trap composed of 140 places in 119 ms
[2020-06-03 05:16:10] [INFO ] Deduced a trap composed of 25 places in 134 ms
[2020-06-03 05:16:10] [INFO ] Deduced a trap composed of 50 places in 110 ms
[2020-06-03 05:16:10] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3293 ms
[2020-06-03 05:16:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:16:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 36 ms returned sat
[2020-06-03 05:16:10] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-06-03 05:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:10] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2020-06-03 05:16:10] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2020-06-03 05:16:11] [INFO ] Deduced a trap composed of 129 places in 150 ms
[2020-06-03 05:16:11] [INFO ] Deduced a trap composed of 24 places in 153 ms
[2020-06-03 05:16:11] [INFO ] Deduced a trap composed of 122 places in 158 ms
[2020-06-03 05:16:11] [INFO ] Deduced a trap composed of 23 places in 156 ms
[2020-06-03 05:16:11] [INFO ] Deduced a trap composed of 121 places in 149 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 138 places in 155 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 119 places in 120 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 125 places in 146 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 33 places in 147 ms
[2020-06-03 05:16:12] [INFO ] Deduced a trap composed of 125 places in 147 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 121 places in 188 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 112 places in 150 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 128 places in 143 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 122 places in 141 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-06-03 05:16:13] [INFO ] Deduced a trap composed of 14 places in 118 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 134 places in 131 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 129 places in 122 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 127 places in 134 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 131 places in 140 ms
[2020-06-03 05:16:14] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-06-03 05:16:15] [INFO ] Deduced a trap composed of 132 places in 120 ms
[2020-06-03 05:16:15] [INFO ] Deduced a trap composed of 124 places in 123 ms
[2020-06-03 05:16:15] [INFO ] Deduced a trap composed of 129 places in 132 ms
[2020-06-03 05:16:15] [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 s43 s44 s64 s65 s68 s69 s73 s79 s80 s82 s83 s129 s130 s131 s150 s152 s157 s158 s165 s166 s167 s170 s171 s195 s196 s197 s201 s202 s203 s237 s238 s239 s242 s243 s244 s247 s249 s252 s253 s254 s262 s264 s268 s278 s288 s302 s303 s304 s308 s318 s323 s328 s338 s353 s362 s363 s364 s365 s366 s367 s368 s371 s372 s373 s374 s387 s388 s389 s390 s391 s392 s393 s404 s405 s406 s407 s408 s409 s412 s413 s417 s418 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s444 s445 s448 s449 s452 s453 s454 s456 s457 s458 s459 s462 s463 s464 s465 s466 s467 s471 s472 s477 s478 s479 s487 s492 s493 s500 s501 s502 s506 s507 s508) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 7 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 290 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 510 transition count 352
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 230 place count 400 transition count 352
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 230 place count 400 transition count 276
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 393 place count 313 transition count 276
Symmetric choice reduction at 2 with 66 rule applications. Total rules 459 place count 313 transition count 276
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 66 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 591 place count 247 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 591 place count 247 transition count 202
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 609 place count 237 transition count 202
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 770 place count 155 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 772 place count 154 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 154 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 776 place count 152 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 777 place count 152 transition count 124
Applied a total of 777 rules in 146 ms. Remains 152 /518 variables (removed 366) and now considering 124/471 (removed 347) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/518 places, 124/471 transitions.
Finished random walk after 67159 steps, including 2852 resets, run visited all 3 properties in 184 ms. (steps per millisecond=364 )
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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-10"
export BK_EXAMINATION="ReachabilityCardinality"
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-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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