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

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

=== Now, execution of the tool begins

BK_START 1591167834535

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:03:56] [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 07:03:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:03:56] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-06-03 07:03:56] [INFO ] Transformed 782 places.
[2020-06-03 07:03:56] [INFO ] Transformed 697 transitions.
[2020-06-03 07:03:56] [INFO ] Found NUPN structural information;
[2020-06-03 07:03:56] [INFO ] Parsed PT model containing 782 places and 697 transitions in 146 ms.
Deduced a syphon composed of 63 places in 26 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 638 rows 719 cols
[2020-06-03 07:03:57] [INFO ] Computed 121 place invariants in 28 ms
[2020-06-03 07:03:57] [INFO ] [Real]Absence check using 78 positive place invariants in 93 ms returned sat
[2020-06-03 07:03:57] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 145 ms returned sat
[2020-06-03 07:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:03:58] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2020-06-03 07:03:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:03:58] [INFO ] [Nat]Absence check using 78 positive place invariants in 105 ms returned sat
[2020-06-03 07:03:59] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 27 ms returned sat
[2020-06-03 07:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:03:59] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2020-06-03 07:04:00] [INFO ] Deduced a trap composed of 11 places in 554 ms
[2020-06-03 07:04:02] [INFO ] Deduced a trap composed of 16 places in 1403 ms
[2020-06-03 07:04:03] [INFO ] Deduced a trap composed of 16 places in 1435 ms
[2020-06-03 07:04:04] [INFO ] Deduced a trap composed of 30 places in 467 ms
[2020-06-03 07:04:04] [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 s176 s177 s181 s187 s188 s189 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s447 s448 s449 s453 s456 s458 s459 s460) 0)") while checking expression at index 0
[2020-06-03 07:04:04] [INFO ] [Real]Absence check using 78 positive place invariants in 76 ms returned sat
[2020-06-03 07:04:04] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 25 ms returned sat
[2020-06-03 07:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:05] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2020-06-03 07:04:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:05] [INFO ] [Nat]Absence check using 78 positive place invariants in 59 ms returned unsat
[2020-06-03 07:04:05] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned sat
[2020-06-03 07:04:05] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 26 ms returned sat
[2020-06-03 07:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:06] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2020-06-03 07:04:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:07] [INFO ] [Nat]Absence check using 78 positive place invariants in 93 ms returned sat
[2020-06-03 07:04:07] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2020-06-03 07:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:08] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 13 places in 200 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 14 places in 235 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 20 places in 284 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 33 places in 177 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 22 places in 267 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 33 places in 99 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 25 places in 276 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 30 places in 250 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 26 places in 248 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 56 places in 186 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 55 places in 471 ms
[2020-06-03 07:04:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3482 ms
[2020-06-03 07:04:11] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 49 ms.
[2020-06-03 07:04:11] [INFO ] Added : 30 causal constraints over 6 iterations in 427 ms. Result :(error "Failed to check-sat")
[2020-06-03 07:04:12] [INFO ] [Real]Absence check using 78 positive place invariants in 64 ms returned sat
[2020-06-03 07:04:12] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2020-06-03 07:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:13] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2020-06-03 07:04:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:13] [INFO ] [Nat]Absence check using 78 positive place invariants in 174 ms returned sat
[2020-06-03 07:04:13] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 44 ms returned sat
[2020-06-03 07:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:15] [INFO ] [Nat]Absence check using state equation in 1482 ms returned sat
[2020-06-03 07:04:15] [INFO ] Deduced a trap composed of 17 places in 395 ms
[2020-06-03 07:04:17] [INFO ] Deduced a trap composed of 28 places in 1883 ms
[2020-06-03 07:04:18] [INFO ] Deduced a trap composed of 20 places in 1103 ms
[2020-06-03 07:04: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 s9 s258 s259 s260 s263 s492 s493 s494 s512 s513 s514) 0)") while checking expression at index 3
[2020-06-03 07:04:18] [INFO ] [Real]Absence check using 78 positive place invariants in 126 ms returned sat
[2020-06-03 07:04:18] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 40 ms returned sat
[2020-06-03 07:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:20] [INFO ] [Real]Absence check using state equation in 1652 ms returned sat
[2020-06-03 07:04:21] [INFO ] Deduced a trap composed of 22 places in 492 ms
[2020-06-03 07:04:21] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-06-03 07:04:22] [INFO ] Deduced a trap composed of 19 places in 811 ms
[2020-06-03 07:04:22] [INFO ] Deduced a trap composed of 23 places in 230 ms
[2020-06-03 07:04:22] [INFO ] Deduced a trap composed of 22 places in 210 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 26 places in 274 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 164 places in 235 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 160 places in 221 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 158 places in 238 ms
[2020-06-03 07:04:23] [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 s69 s71 s75 s80 s81 s82 s83 s87 s88 s96 s108 s122 s123 s149 s150 s151 s237 s238 s239 s255 s256 s257 s274 s275 s276 s290 s293 s335 s336 s337 s351 s360 s361 s362 s365 s366 s367 s370 s371 s372 s380 s382 s390 s392 s396 s401 s405 s407 s411 s437 s439 s447 s448 s449 s452 s453 s454 s458 s463 s467 s469 s473 s478 s483 s488 s493 s508 s512 s513 s514 s527 s528 s529 s530 s531 s532 s533 s538 s539 s540 s541 s544 s545 s550 s551 s552 s554 s555 s556 s558 s559 s560 s561 s566 s567 s568 s573 s574 s579 s580 s593 s594 s601 s602 s603 s604 s610 s611 s612 s613 s616 s621 s622 s623 s624 s625 s626 s629 s630 s635 s636 s639 s640 s655 s656 s657 s658 s661 s662 s665 s670 s671 s676 s677 s678 s679 s680 s681 s682 s683 s684 s687 s688 s693 s694 s695 s696 s697 s702 s703 s705 s706 s710 s711 s712) 0)") while checking expression at index 4
[2020-06-03 07:04:24] [INFO ] [Real]Absence check using 78 positive place invariants in 50 ms returned sat
[2020-06-03 07:04:24] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2020-06-03 07:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:26] [INFO ] [Real]Absence check using state equation in 2387 ms returned sat
[2020-06-03 07:04:26] [INFO ] Deduced a trap composed of 15 places in 293 ms
[2020-06-03 07:04:27] [INFO ] Deduced a trap composed of 21 places in 1191 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 18 places in 458 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 15 places in 429 ms
[2020-06-03 07:04:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s252 s502 s503 s504) 0)") while checking expression at index 5
[2020-06-03 07:04:29] [INFO ] [Real]Absence check using 78 positive place invariants in 90 ms returned sat
[2020-06-03 07:04:29] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 304 ms returned sat
[2020-06-03 07:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:32] [INFO ] [Real]Absence check using state equation in 3056 ms returned sat
[2020-06-03 07:04:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 135 ms returned unsat
[2020-06-03 07:04:33] [INFO ] [Real]Absence check using 78 positive place invariants in 210 ms returned sat
[2020-06-03 07:04:33] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 105 ms returned sat
[2020-06-03 07:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:34] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2020-06-03 07:04:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned unsat
[2020-06-03 07:04:34] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2020-06-03 07:04:34] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 29 ms returned sat
[2020-06-03 07:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:35] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2020-06-03 07:04:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 95 ms returned sat
[2020-06-03 07:04:36] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 27 ms returned sat
[2020-06-03 07:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:37] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2020-06-03 07:04:38] [INFO ] Deduced a trap composed of 8 places in 1701 ms
[2020-06-03 07:04:42] [INFO ] Deduced a trap composed of 20 places in 3932 ms
[2020-06-03 07:04:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s274 s275 s276 s277 s507 s508 s509 s517 s518 s519 s523 s680 s681) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 400 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 15 ms
Free SCC test removed 6 places
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.8 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 686 transition count 455
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 334 place count 524 transition count 455
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 334 place count 524 transition count 356
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 552 place count 405 transition count 356
Symmetric choice reduction at 2 with 88 rule applications. Total rules 640 place count 405 transition count 356
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 88 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 816 place count 317 transition count 268
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 816 place count 317 transition count 259
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 836 place count 306 transition count 259
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 1044 place count 201 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1048 place count 199 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1050 place count 199 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1052 place count 197 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1053 place count 197 transition count 161
Applied a total of 1053 rules in 187 ms. Remains 197 /719 variables (removed 522) and now considering 161/638 (removed 477) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/719 places, 161/638 transitions.
Incomplete random walk after 1000000 steps, including 37371 resets, run finished after 2960 ms. (steps per millisecond=337 ) properties seen :[0, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 12659 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties seen :[0]
[2020-06-03 07:04:47] [INFO ] Flow matrix only has 160 transitions (discarded 1 similar events)
// Phase 1: matrix 160 rows 197 cols
[2020-06-03 07:04:47] [INFO ] Computed 83 place invariants in 3 ms
[2020-06-03 07:04:47] [INFO ] [Real]Absence check using 66 positive place invariants in 35 ms returned sat
[2020-06-03 07:04:47] [INFO ] [Real]Absence check using 66 positive and 17 generalized place invariants in 7 ms returned sat
[2020-06-03 07:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:47] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-06-03 07:04:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2020-06-03 07:04:47] [INFO ] [Nat]Absence check using 66 positive and 17 generalized place invariants in 8 ms returned sat
[2020-06-03 07:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:47] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 07:04:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2020-06-03 07:04:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2020-06-03 07:04:47] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 45 places in 91 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 42 places in 44 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 44 places in 43 ms
[2020-06-03 07:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 345 ms
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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-20"
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-20, 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-158987914100606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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