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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15725.280 3600000.00 155459.00 158.10 TTTFFTFTFTFTFTFT 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-158987914000543.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-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K 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.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.5K 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.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.3K 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 146K 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591162712424

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:38:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:38:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:38:35] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-03 05:38:35] [INFO ] Transformed 586 places.
[2020-06-03 05:38:35] [INFO ] Transformed 525 transitions.
[2020-06-03 05:38:35] [INFO ] Found NUPN structural information;
[2020-06-03 05:38:35] [INFO ] Parsed PT model containing 586 places and 525 transitions in 210 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 73 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:38:35] [INFO ] Computed 98 place invariants in 18 ms
[2020-06-03 05:38:36] [INFO ] [Real]Absence check using 55 positive place invariants in 60 ms returned sat
[2020-06-03 05:38:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:37] [INFO ] [Real]Absence check using state equation in 1377 ms returned sat
[2020-06-03 05:38:41] [INFO ] Deduced a trap composed of 22 places in 3765 ms
[2020-06-03 05:38:41] [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 s223 s224 s228 s229 s230 s240 s388 s389 s390 s394 s398 s399 s400 s404 s407 s409 s410 s411 s529 s530) 0)") while checking expression at index 0
[2020-06-03 05:38:41] [INFO ] [Real]Absence check using 55 positive place invariants in 350 ms returned sat
[2020-06-03 05:38:41] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 145 ms returned sat
[2020-06-03 05:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:44] [INFO ] [Real]Absence check using state equation in 2581 ms returned sat
[2020-06-03 05:38:49] [INFO ] Deduced a trap composed of 27 places in 5282 ms
[2020-06-03 05:38:49] [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 s209 s210 s211 s215 s216 s217 s225 s228 s229 s230 s378 s379 s380 s388 s389 s390 s394 s399 s404 s535 s536) 0)") while checking expression at index 1
[2020-06-03 05:38:50] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2020-06-03 05:38:50] [INFO ] [Real]Absence check using 55 positive place invariants in 62 ms returned sat
[2020-06-03 05:38:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 90 ms returned sat
[2020-06-03 05:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:51] [INFO ] [Real]Absence check using state equation in 1659 ms returned sat
[2020-06-03 05:38:54] [INFO ] Deduced a trap composed of 11 places in 2981 ms
[2020-06-03 05:38:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:38:55] [INFO ] Deduced a trap composed of 6 places in 489 ms
[2020-06-03 05:38:55] [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 s231) 0)") while checking expression at index 3
[2020-06-03 05:38:55] [INFO ] [Real]Absence check using 55 positive place invariants in 236 ms returned sat
[2020-06-03 05:38:55] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 7 ms returned unsat
[2020-06-03 05:38:56] [INFO ] [Real]Absence check using 55 positive place invariants in 70 ms returned sat
[2020-06-03 05:38:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 40 ms returned sat
[2020-06-03 05:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:58] [INFO ] [Real]Absence check using state equation in 1853 ms returned sat
[2020-06-03 05:38:58] [INFO ] Deduced a trap composed of 18 places in 543 ms
[2020-06-03 05:38:59] [INFO ] Deduced a trap composed of 19 places in 1220 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 14 places in 4401 ms
[2020-06-03 05:39: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 s2 s3 s4 s5 s6 s7 s8 s9 s200 s269 s270 s271) 0)") while checking expression at index 5
[2020-06-03 05:39:04] [INFO ] [Real]Absence check using 55 positive place invariants in 157 ms returned sat
[2020-06-03 05:39:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 92 ms returned sat
[2020-06-03 05:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:06] [INFO ] [Real]Absence check using state equation in 2105 ms returned unsat
[2020-06-03 05:39:07] [INFO ] [Real]Absence check using 55 positive place invariants in 180 ms returned unsat
[2020-06-03 05:39:07] [INFO ] [Real]Absence check using 55 positive place invariants in 55 ms returned sat
[2020-06-03 05:39:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 308 ms returned sat
[2020-06-03 05:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:11] [INFO ] [Real]Absence check using state equation in 3885 ms returned unsat
[2020-06-03 05:39:11] [INFO ] [Real]Absence check using 55 positive place invariants in 104 ms returned sat
[2020-06-03 05:39:11] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned unsat
[2020-06-03 05:39:12] [INFO ] [Real]Absence check using 55 positive place invariants in 213 ms returned sat
[2020-06-03 05:39:12] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 79 ms returned sat
[2020-06-03 05:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:15] [INFO ] [Real]Absence check using state equation in 3514 ms returned sat
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 17 places in 2571 ms
[2020-06-03 05:39: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 s10 s11 s12 s174 s368 s369 s370) 0)") while checking expression at index 10
[2020-06-03 05:39:18] [INFO ] [Real]Absence check using 55 positive place invariants in 251 ms returned sat
[2020-06-03 05:39:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 63 ms returned sat
[2020-06-03 05:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:20] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2020-06-03 05:39:26] [INFO ] Deduced a trap composed of 11 places in 6567 ms
[2020-06-03 05:39:26] [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 s236 s239 s403 s404 s405 s409 s539 s540) 0)") while checking expression at index 11
[2020-06-03 05:39:27] [INFO ] [Real]Absence check using 55 positive place invariants in 77 ms returned sat
[2020-06-03 05:39:27] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 55 ms returned sat
[2020-06-03 05:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:28] [INFO ] [Real]Absence check using state equation in 1453 ms returned sat
[2020-06-03 05:39:28] [INFO ] Deduced a trap composed of 11 places in 370 ms
[2020-06-03 05:39:30] [INFO ] Deduced a trap composed of 16 places in 1275 ms
[2020-06-03 05:39:31] [INFO ] Deduced a trap composed of 19 places in 1236 ms
[2020-06-03 05:39:37] [INFO ] Deduced a trap composed of 21 places in 5887 ms
[2020-06-03 05:39: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 s5 s223 s224 s225 s378 s379 s380 s393 s394 s395 s399 s404 s525 s526 s539 s540) 0)") while checking expression at index 12
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 20 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 578 transition count 431
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 489 transition count 431
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 179 place count 489 transition count 305
Deduced a syphon composed of 126 places in 15 ms
Ensure Unique test removed 17 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 448 place count 346 transition count 305
Symmetric choice reduction at 2 with 72 rule applications. Total rules 520 place count 346 transition count 305
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 72 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 274 transition count 233
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 664 place count 274 transition count 229
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 673 place count 269 transition count 229
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 838 place count 185 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 839 place count 185 transition count 147
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 3 with 2 rules applied. Total rules applied 841 place count 184 transition count 151
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 846 place count 184 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 847 place count 183 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 182 transition count 150
Applied a total of 848 rules in 252 ms. Remains 182 /582 variables (removed 400) and now considering 150/521 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/582 places, 150/521 transitions.
Incomplete random walk after 1000000 steps, including 70069 resets, run finished after 2513 ms. (steps per millisecond=397 ) properties seen :[1, 0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 15258 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15293 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties seen :[0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 15355 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 16103 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15282 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 150 rows 182 cols
[2020-06-03 05:39:44] [INFO ] Computed 73 place invariants in 8 ms
[2020-06-03 05:39:45] [INFO ] [Real]Absence check using 52 positive place invariants in 120 ms returned sat
[2020-06-03 05:39:45] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 99 ms returned sat
[2020-06-03 05:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:45] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2020-06-03 05:39:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 05:39:45] [INFO ] [Real]Added 5 Read/Feed constraints in 28 ms returned sat
[2020-06-03 05:39:48] [INFO ] Deduced a trap composed of 43 places in 2443 ms
[2020-06-03 05:39:49] [INFO ] Deduced a trap composed of 41 places in 1128 ms
[2020-06-03 05:39:49] [INFO ] Deduced a trap composed of 21 places in 14 ms
[2020-06-03 05:39:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3665 ms
[2020-06-03 05:39:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:49] [INFO ] [Nat]Absence check using 52 positive place invariants in 199 ms returned sat
[2020-06-03 05:39:49] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 74 ms returned sat
[2020-06-03 05:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:50] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2020-06-03 05:39:50] [INFO ] [Nat]Added 5 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 42 places in 144 ms
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 42 places in 116 ms
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 45 places in 68 ms
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 44 places in 93 ms
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 43 places in 345 ms
[2020-06-03 05:39:51] [INFO ] Deduced a trap composed of 21 places in 22 ms
[2020-06-03 05:39:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 933 ms
[2020-06-03 05:39:51] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 17 ms.
[2020-06-03 05:39:52] [INFO ] Added : 59 causal constraints over 12 iterations in 341 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 52 positive place invariants in 32 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 10 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:39:52] [INFO ] Deduced a trap composed of 16 places in 28 ms
[2020-06-03 05:39:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 52 positive place invariants in 29 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 44 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:39:53] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 05:39:53] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 05:39:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2020-06-03 05:39:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 29 ms returned sat
[2020-06-03 05:39:53] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 7 ms returned sat
[2020-06-03 05:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:53] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2020-06-03 05:39:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:39:53] [INFO ] Deduced a trap composed of 40 places in 46 ms
[2020-06-03 05:39:54] [INFO ] Deduced a trap composed of 45 places in 1343 ms
[2020-06-03 05:39:56] [INFO ] Deduced a trap composed of 41 places in 1218 ms
[2020-06-03 05:39:58] [INFO ] Deduced a trap composed of 40 places in 1916 ms
[2020-06-03 05:39:58] [INFO ] Deduced a trap composed of 40 places in 902 ms
[2020-06-03 05:39:59] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-06-03 05:39:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5619 ms
[2020-06-03 05:39:59] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 20 ms.
[2020-06-03 05:39:59] [INFO ] Added : 61 causal constraints over 13 iterations in 476 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 05:39:59] [INFO ] [Real]Absence check using 52 positive place invariants in 134 ms returned sat
[2020-06-03 05:39:59] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 35 ms returned sat
[2020-06-03 05:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:40:00] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2020-06-03 05:40:00] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:40:01] [INFO ] Deduced a trap composed of 42 places in 619 ms
[2020-06-03 05:40:01] [INFO ] Deduced a trap composed of 41 places in 92 ms
[2020-06-03 05:40:01] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2020-06-03 05:40:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 815 ms
[2020-06-03 05:40:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:40:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 268 ms returned sat
[2020-06-03 05:40:01] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 144 ms returned sat
[2020-06-03 05:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:40:01] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2020-06-03 05:40:02] [INFO ] [Nat]Added 5 Read/Feed constraints in 24 ms returned sat
[2020-06-03 05:40:02] [INFO ] Deduced a trap composed of 41 places in 128 ms
[2020-06-03 05:40:02] [INFO ] Deduced a trap composed of 21 places in 38 ms
[2020-06-03 05:40:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2020-06-03 05:40:02] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 6 ms.
[2020-06-03 05:40:02] [INFO ] Added : 57 causal constraints over 12 iterations in 355 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8100 steps, including 377 resets, run finished after 22 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8300 steps, including 347 resets, run finished after 18 ms. (steps per millisecond=461 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 341 resets, run finished after 33 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 182/182 places, 150/150 transitions.
Graph (trivial) has 9 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 181 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 180 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 180 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 177 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 172 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 172 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 170 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 169 transition count 137
Applied a total of 25 rules in 35 ms. Remains 169 /182 variables (removed 13) and now considering 137/150 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/182 places, 137/150 transitions.
Finished random walk after 897 steps, including 24 resets, run visited all 3 properties in 3 ms. (steps per millisecond=299 )
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 TRUE 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-12"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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