fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200558
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.700 34566.00 53378.00 249.40 FFFTFTTTTFTFFTFT normal

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.r021-oct2-158897699200558.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 itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.1K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:45 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 156K 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589255017462

[2020-05-12 03:43:39] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:43:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:43:39] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-05-12 03:43:39] [INFO ] Transformed 624 places.
[2020-05-12 03:43:39] [INFO ] Transformed 564 transitions.
[2020-05-12 03:43:39] [INFO ] Found NUPN structural information;
[2020-05-12 03:43:39] [INFO ] Parsed PT model containing 624 places and 564 transitions in 130 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2020-05-12 03:43:39] [INFO ] Computed 99 place invariants in 29 ms
[2020-05-12 03:43:40] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2020-05-12 03:43:40] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 32 ms returned sat
[2020-05-12 03:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:41] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2020-05-12 03:43:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:43:41] [INFO ] [Nat]Absence check using 60 positive place invariants in 56 ms returned sat
[2020-05-12 03:43:41] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 03:43:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:42] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2020-05-12 03:43:42] [INFO ] Deduced a trap composed of 14 places in 466 ms
[2020-05-12 03:43:42] [INFO ] Deduced a trap composed of 20 places in 307 ms
[2020-05-12 03:43:43] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2020-05-12 03:43:43] [INFO ] Deduced a trap composed of 19 places in 209 ms
[2020-05-12 03:43:43] [INFO ] Deduced a trap composed of 25 places in 149 ms
[2020-05-12 03:43:43] [INFO ] Deduced a trap composed of 35 places in 181 ms
[2020-05-12 03:43:44] [INFO ] Deduced a trap composed of 31 places in 254 ms
[2020-05-12 03:43:44] [INFO ] Deduced a trap composed of 26 places in 188 ms
[2020-05-12 03:43:44] [INFO ] Deduced a trap composed of 29 places in 280 ms
[2020-05-12 03:43:44] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-05-12 03:43:44] [INFO ] Deduced a trap composed of 127 places in 160 ms
[2020-05-12 03:43:45] [INFO ] Deduced a trap composed of 20 places in 780 ms
[2020-05-12 03:43:46] [INFO ] Deduced a trap composed of 21 places in 331 ms
[2020-05-12 03:43:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 03:43:46] [INFO ] Deduced a trap composed of 7 places in 380 ms
[2020-05-12 03:43:46] [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 s243 s244 s245 s246) 0)") while checking expression at index 0
[2020-05-12 03:43:46] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2020-05-12 03:43:46] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-05-12 03:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:47] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2020-05-12 03:43:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:43:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 51 ms returned sat
[2020-05-12 03:43:47] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-05-12 03:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:48] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2020-05-12 03:43:49] [INFO ] Deduced a trap composed of 14 places in 816 ms
[2020-05-12 03:43:49] [INFO ] Deduced a trap composed of 18 places in 370 ms
[2020-05-12 03:43:49] [INFO ] Deduced a trap composed of 23 places in 319 ms
[2020-05-12 03:43:50] [INFO ] Deduced a trap composed of 17 places in 151 ms
[2020-05-12 03:43:50] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-05-12 03:43:50] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-05-12 03:43:50] [INFO ] Deduced a trap composed of 147 places in 158 ms
[2020-05-12 03:43:50] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 129 places in 235 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 37 places in 139 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 20 places in 148 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 22 places in 160 ms
[2020-05-12 03:43:51] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-05-12 03:43:52] [INFO ] Deduced a trap composed of 15 places in 151 ms
[2020-05-12 03:43:52] [INFO ] Deduced a trap composed of 145 places in 152 ms
[2020-05-12 03:43:52] [INFO ] Deduced a trap composed of 147 places in 183 ms
[2020-05-12 03:43:52] [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 s29 s30 s33 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s59 s60 s63 s64 s70 s71 s77 s78 s82 s87 s88 s110 s111 s112 s121 s122 s126 s165 s170 s171 s174 s175 s176 s177 s178 s179 s180 s181 s182 s204 s205 s206 s243 s246 s279 s281 s293 s298 s303 s308 s323 s332 s334 s338 s343 s348 s357 s358 s359 s363 s367 s369 s378 s388 s393 s417 s418 s419 s423 s428 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s454 s455 s459 s460 s463 s464 s478 s479 s482 s483 s499 s500 s505 s506 s515 s516 s520 s521 s522 s523 s526 s527 s530 s531 s538 s539 s542 s543 s544 s545 s546 s547 s550 s551 s561 s562 s565 s566 s573 s574 s577 s578 s579 s580 s581 s595 s596 s597 s598 s599 s600 s613 s614 s615) 0)") while checking expression at index 1
[2020-05-12 03:43:52] [INFO ] [Real]Absence check using 60 positive place invariants in 33 ms returned sat
[2020-05-12 03:43:52] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-05-12 03:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:53] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2020-05-12 03:43:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:43:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 58 ms returned sat
[2020-05-12 03:43:53] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-05-12 03:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:54] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-05-12 03:43:54] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-05-12 03:43:54] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2020-05-12 03:43:54] [INFO ] Deduced a trap composed of 26 places in 156 ms
[2020-05-12 03:43:54] [INFO ] Deduced a trap composed of 29 places in 151 ms
[2020-05-12 03:43:55] [INFO ] Deduced a trap composed of 35 places in 153 ms
[2020-05-12 03:43:55] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-05-12 03:43:55] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2020-05-12 03:43:55] [INFO ] Deduced a trap composed of 131 places in 155 ms
[2020-05-12 03:43:55] [INFO ] Deduced a trap composed of 22 places in 157 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 122 places in 128 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-05-12 03:43:56] [INFO ] Deduced a trap composed of 27 places in 135 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 154 places in 134 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 153 places in 138 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 40 places in 145 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 43 places in 78 ms
[2020-05-12 03:43:57] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-05-12 03:43:58] [INFO ] Deduced a trap composed of 35 places in 40 ms
[2020-05-12 03:43:58] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-05-12 03:43:58] [INFO ] Deduced a trap composed of 27 places in 70 ms
[2020-05-12 03:43:58] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3966 ms
[2020-05-12 03:43:58] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 29 ms.
[2020-05-12 03:43:58] [INFO ] Added : 25 causal constraints over 5 iterations in 219 ms. Result :unknown
[2020-05-12 03:43:58] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2020-05-12 03:43:58] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 33 ms returned sat
[2020-05-12 03:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:43:59] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-05-12 03:43:59] [INFO ] Deduced a trap composed of 13 places in 190 ms
[2020-05-12 03:43:59] [INFO ] Deduced a trap composed of 15 places in 231 ms
[2020-05-12 03:43:59] [INFO ] Deduced a trap composed of 15 places in 151 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 16 places in 94 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 15 places in 112 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 22 places in 95 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-05-12 03:44:00] [INFO ] Deduced a trap composed of 37 places in 97 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 44 places in 94 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-05-12 03:44:01] [INFO ] Deduced a trap composed of 38 places in 103 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 44 places in 243 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 38 places in 389 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 41 places in 84 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 53 places in 84 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 44 places in 83 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 46 places in 79 ms
[2020-05-12 03:44:02] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2020-05-12 03:44:03] [INFO ] Deduced a trap composed of 48 places in 389 ms
[2020-05-12 03:44:03] [INFO ] Deduced a trap composed of 51 places in 83 ms
[2020-05-12 03:44: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 s2 s3 s4 s5 s6 s28 s31 s32 s33 s34 s42 s45 s46 s59 s60 s63 s64 s70 s71 s162 s163 s164 s231 s285 s293 s298 s313 s323 s328 s333 s338 s343 s428 s452 s453 s456 s465 s466 s469 s470 s471 s478 s479 s569 s570 s573 s574 s577 s578) 0)") while checking expression at index 3
[2020-05-12 03:44:03] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2020-05-12 03:44:03] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2020-05-12 03:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:44:04] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-05-12 03:44:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:44:04] [INFO ] [Nat]Absence check using 60 positive place invariants in 112 ms returned sat
[2020-05-12 03:44:04] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 27 ms returned sat
[2020-05-12 03:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:44:05] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 13 places in 89 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 48 places in 87 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 20 places in 65 ms
[2020-05-12 03:44:05] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2020-05-12 03:44:06] [INFO ] Deduced a trap composed of 53 places in 73 ms
[2020-05-12 03:44:06] [INFO ] Deduced a trap composed of 52 places in 138 ms
[2020-05-12 03:44:06] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2020-05-12 03:44:06] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2020-05-12 03:44:06] [INFO ] Deduced a trap composed of 56 places in 64 ms
[2020-05-12 03:44:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1210 ms
[2020-05-12 03:44:06] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 22 ms.
[2020-05-12 03:44:09] [INFO ] Added : 335 causal constraints over 67 iterations in 2854 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 27800 steps, including 177 resets, run finished after 99 ms. (steps per millisecond=280 ) properties seen :[0, 1, 1, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 352 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 34 ms
Free SCC test removed 6 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 604 transition count 409
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 286 place count 466 transition count 409
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 286 place count 466 transition count 319
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 483 place count 359 transition count 319
Symmetric choice reduction at 2 with 82 rule applications. Total rules 565 place count 359 transition count 319
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 82 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 729 place count 277 transition count 237
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 729 place count 277 transition count 228
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 749 place count 266 transition count 228
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 935 place count 172 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 937 place count 171 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 939 place count 171 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 941 place count 169 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 942 place count 169 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 943 place count 168 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 944 place count 167 transition count 137
Applied a total of 944 rules in 192 ms. Remains 167 /616 variables (removed 449) and now considering 137/556 (removed 419) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/616 places, 137/556 transitions.
Incomplete random walk after 1000000 steps, including 37796 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties seen :[0, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 599 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=299 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589255052028

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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