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

About the Execution of ITS-LoLa for BusinessProcesses-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.030 3600000.00 48600.00 53.00 FTTFTTFFFFFFTTFT 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.r182-oct2-158987914000550.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-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 23K 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.5K 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.4K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591163111419

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:45:12] [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:45:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:45:12] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-03 05:45:12] [INFO ] Transformed 593 places.
[2020-06-03 05:45:12] [INFO ] Transformed 536 transitions.
[2020-06-03 05:45:12] [INFO ] Found NUPN structural information;
[2020-06-03 05:45:12] [INFO ] Parsed PT model containing 593 places and 536 transitions in 106 ms.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 70 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 1, 0, 0, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 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 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 528 rows 585 cols
[2020-06-03 05:45:13] [INFO ] Computed 95 place invariants in 21 ms
[2020-06-03 05:45:13] [INFO ] [Real]Absence check using 57 positive place invariants in 45 ms returned sat
[2020-06-03 05:45:13] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-06-03 05:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:13] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2020-06-03 05:45:14] [INFO ] Deduced a trap composed of 13 places in 218 ms
[2020-06-03 05:45:14] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2020-06-03 05:45:14] [INFO ] Deduced a trap composed of 130 places in 207 ms
[2020-06-03 05:45:14] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-06-03 05:45:15] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-03 05:45:15] [INFO ] Deduced a trap composed of 16 places in 176 ms
[2020-06-03 05:45:15] [INFO ] Deduced a trap composed of 41 places in 163 ms
[2020-06-03 05:45:15] [INFO ] Deduced a trap composed of 135 places in 177 ms
[2020-06-03 05:45:15] [INFO ] Deduced a trap composed of 45 places in 184 ms
[2020-06-03 05:45:16] [INFO ] Deduced a trap composed of 41 places in 158 ms
[2020-06-03 05:45:16] [INFO ] Deduced a trap composed of 131 places in 168 ms
[2020-06-03 05:45:16] [INFO ] Deduced a trap composed of 45 places in 168 ms
[2020-06-03 05:45:16] [INFO ] Deduced a trap composed of 131 places in 158 ms
[2020-06-03 05:45:16] [INFO ] Deduced a trap composed of 130 places in 164 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 133 places in 141 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 138 places in 142 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 30 places in 142 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-06-03 05:45:17] [INFO ] Deduced a trap composed of 8 places in 166 ms
[2020-06-03 05:45:18] [INFO ] Deduced a trap composed of 19 places in 159 ms
[2020-06-03 05:45:18] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 05:45:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s209 s305 s306 s307 s538 s539) 0)") while checking expression at index 0
[2020-06-03 05:45:18] [INFO ] [Real]Absence check using 57 positive place invariants in 52 ms returned sat
[2020-06-03 05:45:18] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 22 ms returned sat
[2020-06-03 05:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:19] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2020-06-03 05:45:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:45:19] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned unsat
[2020-06-03 05:45:19] [INFO ] [Real]Absence check using 57 positive place invariants in 33 ms returned sat
[2020-06-03 05:45:19] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-06-03 05:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:20] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2020-06-03 05:45:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:45:20] [INFO ] [Nat]Absence check using 57 positive place invariants in 69 ms returned sat
[2020-06-03 05:45:20] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-06-03 05:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:20] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 23 places in 107 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 30 places in 94 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 15 places in 186 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-06-03 05:45:21] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 24 places in 88 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 41 places in 86 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 41 places in 79 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2020-06-03 05:45:22] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2020-06-03 05:45:23] [INFO ] Deduced a trap composed of 43 places in 83 ms
[2020-06-03 05:45:23] [INFO ] Deduced a trap composed of 43 places in 84 ms
[2020-06-03 05:45:23] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-03 05:45:23] [INFO ] Deduced a trap composed of 32 places in 58 ms
[2020-06-03 05:45:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2386 ms
[2020-06-03 05:45:23] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 33 ms.
[2020-06-03 05:45:25] [INFO ] Added : 259 causal constraints over 52 iterations in 1810 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 05:45:25] [INFO ] [Real]Absence check using 57 positive place invariants in 84 ms returned sat
[2020-06-03 05:45:25] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 157 ms returned sat
[2020-06-03 05:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:26] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2020-06-03 05:45:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:45:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 60 ms returned sat
[2020-06-03 05:45:26] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-06-03 05:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:26] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-06-03 05:45:27] [INFO ] Deduced a trap composed of 15 places in 342 ms
[2020-06-03 05:45:27] [INFO ] Deduced a trap composed of 43 places in 178 ms
[2020-06-03 05:45:27] [INFO ] Deduced a trap composed of 145 places in 174 ms
[2020-06-03 05:45:27] [INFO ] Deduced a trap composed of 39 places in 174 ms
[2020-06-03 05:45:28] [INFO ] Deduced a trap composed of 125 places in 172 ms
[2020-06-03 05:45:28] [INFO ] Deduced a trap composed of 34 places in 170 ms
[2020-06-03 05:45:28] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-06-03 05:45:28] [INFO ] Deduced a trap composed of 52 places in 178 ms
[2020-06-03 05:45:28] [INFO ] Deduced a trap composed of 48 places in 169 ms
[2020-06-03 05:45:29] [INFO ] Deduced a trap composed of 31 places in 169 ms
[2020-06-03 05:45:29] [INFO ] Deduced a trap composed of 18 places in 185 ms
[2020-06-03 05:45:29] [INFO ] Deduced a trap composed of 27 places in 168 ms
[2020-06-03 05:45:29] [INFO ] Deduced a trap composed of 133 places in 168 ms
[2020-06-03 05:45:29] [INFO ] Deduced a trap composed of 126 places in 172 ms
[2020-06-03 05:45:30] [INFO ] Deduced a trap composed of 122 places in 164 ms
[2020-06-03 05:45:30] [INFO ] Deduced a trap composed of 30 places in 163 ms
[2020-06-03 05:45:30] [INFO ] Deduced a trap composed of 42 places in 168 ms
[2020-06-03 05:45:30] [INFO ] Deduced a trap composed of 22 places in 163 ms
[2020-06-03 05:45:30] [INFO ] Deduced a trap composed of 54 places in 163 ms
[2020-06-03 05:45:31] [INFO ] Deduced a trap composed of 33 places in 157 ms
[2020-06-03 05:45:31] [INFO ] Deduced a trap composed of 128 places in 155 ms
[2020-06-03 05:45:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s32 s33 s35 s36 s39 s40 s46 s47 s49 s50 s53 s54 s67 s68 s106 s107 s108 s152 s153 s154 s157 s159 s169 s173 s174 s175 s179 s188 s206 s207 s208 s218 s219 s220 s237 s271 s296 s301 s306 s311 s326 s331 s336 s340 s342 s345 s346 s347 s351 s361 s371 s376 s381 s385 s386 s387 s391 s396 s401 s406 s409 s412 s413 s415 s418 s419 s420 s421 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s443 s444 s458 s459 s460 s461 s468 s469 s470 s471 s472 s473 s480 s481 s482 s483 s487 s488 s491 s492 s493 s494 s499 s500 s503 s504 s505 s506 s507 s508 s509 s510 s518 s520 s523 s529 s538 s539 s540 s541 s546 s547 s548 s549 s550 s551 s573 s582) 0)") while checking expression at index 3
[2020-06-03 05:45:31] [INFO ] [Real]Absence check using 57 positive place invariants in 38 ms returned sat
[2020-06-03 05:45:31] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 24 ms returned sat
[2020-06-03 05:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:32] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2020-06-03 05:45:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:45:32] [INFO ] [Nat]Absence check using 57 positive place invariants in 127 ms returned sat
[2020-06-03 05:45:32] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 22 ms returned sat
[2020-06-03 05:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:33] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2020-06-03 05:45:33] [INFO ] Deduced a trap composed of 8 places in 219 ms
[2020-06-03 05:45:33] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-06-03 05:45:33] [INFO ] Deduced a trap composed of 16 places in 156 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 28 places in 137 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 111 places in 133 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 42 places in 78 ms
[2020-06-03 05:45:34] [INFO ] Deduced a trap composed of 108 places in 142 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 19 places in 130 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 36 places in 134 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 122 places in 126 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 111 places in 127 ms
[2020-06-03 05:45:35] [INFO ] Deduced a trap composed of 43 places in 132 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 42 places in 124 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 53 places in 125 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 111 places in 124 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 38 places in 148 ms
[2020-06-03 05:45:36] [INFO ] Deduced a trap composed of 138 places in 217 ms
[2020-06-03 05:45:37] [INFO ] Deduced a trap composed of 123 places in 282 ms
[2020-06-03 05:45:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:45:37] [INFO ] Deduced a trap composed of 6 places in 311 ms
[2020-06-03 05:45:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s228) 0)") while checking expression at index 4
[2020-06-03 05:45:37] [INFO ] [Real]Absence check using 57 positive place invariants in 62 ms returned sat
[2020-06-03 05:45:37] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 52 ms returned sat
[2020-06-03 05:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:39] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2020-06-03 05:45:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:45:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 51 ms returned sat
[2020-06-03 05:45:39] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-06-03 05:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:45:40] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2020-06-03 05:45:40] [INFO ] Deduced a trap composed of 22 places in 574 ms
[2020-06-03 05:45:41] [INFO ] Deduced a trap composed of 123 places in 175 ms
[2020-06-03 05:45:41] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-06-03 05:45:41] [INFO ] Deduced a trap composed of 49 places in 166 ms
[2020-06-03 05:45:41] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-03 05:45:41] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-06-03 05:45:42] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 05:45:42] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-06-03 05:45:42] [INFO ] Deduced a trap composed of 24 places in 334 ms
[2020-06-03 05:45:42] [INFO ] Deduced a trap composed of 35 places in 171 ms
[2020-06-03 05:45:43] [INFO ] Deduced a trap composed of 16 places in 230 ms
[2020-06-03 05:45:43] [INFO ] Deduced a trap composed of 117 places in 159 ms
[2020-06-03 05:45:43] [INFO ] Deduced a trap composed of 22 places in 306 ms
[2020-06-03 05:45:43] [INFO ] Deduced a trap composed of 22 places in 175 ms
[2020-06-03 05:45:44] [INFO ] Deduced a trap composed of 123 places in 171 ms
[2020-06-03 05:45:44] [INFO ] Deduced a trap composed of 124 places in 159 ms
[2020-06-03 05:45:44] [INFO ] Deduced a trap composed of 36 places in 220 ms
[2020-06-03 05:45:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:45:44] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-06-03 05:45:44] [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 s228) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 13 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 325 edges and 585 vertex of which 4 / 585 are part of one of the 1 SCC in 11 ms
Free SCC test removed 3 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1193 edges and 582 vertex of which 576 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 576 transition count 395
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 262 place count 448 transition count 395
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 262 place count 448 transition count 308
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 452 place count 345 transition count 308
Symmetric choice reduction at 2 with 74 rule applications. Total rules 526 place count 345 transition count 308
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 74 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 674 place count 271 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 674 place count 271 transition count 226
Deduced a syphon composed of 8 places in 1 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 692 place count 261 transition count 226
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 860 place count 176 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 862 place count 175 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 863 place count 175 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 864 place count 174 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 865 place count 174 transition count 146
Applied a total of 865 rules in 141 ms. Remains 174 /585 variables (removed 411) and now considering 146/528 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/585 places, 146/528 transitions.
Incomplete random walk after 1000000 steps, including 61073 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties seen :[1, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 109710 steps, including 1894 resets, run visited all 1 properties in 160 ms. (steps per millisecond=685 )
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-13"
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-13, 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-158987914000550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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