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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.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.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.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 141K 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591162064545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:27:48] [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:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:27:48] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-06-03 05:27:48] [INFO ] Transformed 567 places.
[2020-06-03 05:27:48] [INFO ] Transformed 508 transitions.
[2020-06-03 05:27:48] [INFO ] Found NUPN structural information;
[2020-06-03 05:27:48] [INFO ] Parsed PT model containing 567 places and 508 transitions in 242 ms.
Deduced a syphon composed of 7 places in 14 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 90 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) 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 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[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, 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]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 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 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-06-03 05:27:49] [INFO ] Computed 95 place invariants in 39 ms
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 53 positive place invariants in 118 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 61 ms returned unsat
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 53 positive place invariants in 60 ms returned unsat
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 53 positive place invariants in 83 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 33 ms returned sat
[2020-06-03 05:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:27:54] [INFO ] [Real]Absence check using state equation in 3654 ms returned sat
[2020-06-03 05:27:55] [INFO ] Deduced a trap composed of 12 places in 501 ms
[2020-06-03 05:28:03] [INFO ] Deduced a trap composed of 29 places in 8410 ms
[2020-06-03 05:28:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s157 s158 s159 s168 s169 s170 s174 s183 s184 s185 s192 s334 s335 s336 s345 s355 s360 s499 s500) 0)") while checking expression at index 2
[2020-06-03 05:28:03] [INFO ] [Real]Absence check using 53 positive place invariants in 230 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 289 ms returned sat
[2020-06-03 05:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:07] [INFO ] [Real]Absence check using state equation in 3141 ms returned sat
[2020-06-03 05:28:10] [INFO ] Deduced a trap composed of 15 places in 3520 ms
[2020-06-03 05:28:10] [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 s210 s213 s214 s215 s216 s378 s379 s380) 0)") while checking expression at index 3
[2020-06-03 05:28:11] [INFO ] [Real]Absence check using 53 positive place invariants in 261 ms returned sat
[2020-06-03 05:28:11] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 86 ms returned sat
[2020-06-03 05:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:13] [INFO ] [Real]Absence check using state equation in 2206 ms returned unsat
[2020-06-03 05:28:13] [INFO ] [Real]Absence check using 53 positive place invariants in 212 ms returned sat
[2020-06-03 05:28:14] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 85 ms returned sat
[2020-06-03 05:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:16] [INFO ] [Real]Absence check using state equation in 2199 ms returned sat
[2020-06-03 05:28:16] [INFO ] Deduced a trap composed of 15 places in 345 ms
[2020-06-03 05:28:20] [INFO ] Deduced a trap composed of 13 places in 3786 ms
[2020-06-03 05:28:20] [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 s220 s221 s222 s232 s388 s389 s390 s392 s394 s395 s396) 0)") while checking expression at index 5
[2020-06-03 05:28:21] [INFO ] [Real]Absence check using 53 positive place invariants in 360 ms returned sat
[2020-06-03 05:28:21] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 57 ms returned sat
[2020-06-03 05:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:25] [INFO ] [Real]Absence check using state equation in 4254 ms returned sat
[2020-06-03 05:28:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:25] [INFO ] [Nat]Absence check using 53 positive place invariants in 359 ms returned sat
[2020-06-03 05:28:26] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 308 ms returned sat
[2020-06-03 05:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:30] [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: Broken pipe (= s524 (- t97 t6))") while checking expression at index 6
[2020-06-03 05:28:30] [INFO ] [Real]Absence check using 53 positive place invariants in 160 ms returned sat
[2020-06-03 05:28:30] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 28 ms returned sat
[2020-06-03 05:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:31] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2020-06-03 05:28:35] [INFO ] Deduced a trap composed of 12 places in 4245 ms
[2020-06-03 05:28:35] [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 s232 s388 s389 s390 s392 s394 s395 s396 s517 s518) 0)") while checking expression at index 7
[2020-06-03 05:28:36] [INFO ] [Real]Absence check using 53 positive place invariants in 192 ms returned sat
[2020-06-03 05:28:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 180 ms returned sat
[2020-06-03 05:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:38] [INFO ] [Real]Absence check using state equation in 2605 ms returned sat
[2020-06-03 05:28:43] [INFO ] Deduced a trap composed of 12 places in 4492 ms
[2020-06-03 05:28:43] [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 s204 s378 s379 s380) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 34 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.49 ms
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 555 transition count 428
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 483 transition count 428
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 118 Pre rules applied. Total rules applied 145 place count 483 transition count 310
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 396 place count 350 transition count 310
Symmetric choice reduction at 2 with 63 rule applications. Total rules 459 place count 350 transition count 310
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 585 place count 287 transition count 247
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 585 place count 287 transition count 245
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 589 place count 285 transition count 245
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 3 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 169 rules applied. Total rules applied 758 place count 199 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 759 place count 199 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 760 place count 198 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 761 place count 198 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 762 place count 197 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 763 place count 196 transition count 160
Applied a total of 763 rules in 271 ms. Remains 196 /560 variables (removed 364) and now considering 160/501 (removed 341) transitions.
Finished structural reductions, in 1 iterations. Remains : 196/560 places, 160/501 transitions.
Incomplete random walk after 1000000 steps, including 41598 resets, run finished after 2526 ms. (steps per millisecond=395 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7637 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7839 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7963 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8733 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7948 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7907 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 160 rows 196 cols
[2020-06-03 05:28:51] [INFO ] Computed 72 place invariants in 7 ms
[2020-06-03 05:28:51] [INFO ] [Real]Absence check using 50 positive place invariants in 84 ms returned sat
[2020-06-03 05:28:51] [INFO ] [Real]Absence check using 50 positive and 22 generalized place invariants in 8 ms returned sat
[2020-06-03 05:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:52] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-03 05:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 05:28:52] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 45 places in 586 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 3 places in 148 ms
[2020-06-03 05:28:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 773 ms
[2020-06-03 05:28:52] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2020-06-03 05:28:52] [INFO ] [Real]Absence check using 50 positive and 22 generalized place invariants in 7 ms returned sat
[2020-06-03 05:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:53] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-03 05:28:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 45 places in 288 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 45 places in 79 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 3 places in 65 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 9 places in 1509 ms
[2020-06-03 05:28:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2035 ms
[2020-06-03 05:28:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2020-06-03 05:28:55] [INFO ] [Nat]Absence check using 50 positive and 22 generalized place invariants in 7 ms returned sat
[2020-06-03 05:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:55] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2020-06-03 05:28:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 44 places in 299 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 45 places in 599 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 3 places in 57 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-06-03 05:28:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1083 ms
[2020-06-03 05:28:56] [INFO ] Computed and/alt/rep : 152/862/152 causal constraints in 24 ms.
[2020-06-03 05:28:57] [INFO ] Added : 66 causal constraints over 14 iterations in 548 ms. Result :sat
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 05:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 05:28:57] [INFO ] [Real]Absence check using 50 positive place invariants in 97 ms returned sat
[2020-06-03 05:28:57] [INFO ] [Real]Absence check using 50 positive and 22 generalized place invariants in 31 ms returned sat
[2020-06-03 05:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:58] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-06-03 05:28:58] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 3 places in 1030 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 9 places in 724 ms
[2020-06-03 05:28:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1791 ms
[2020-06-03 05:28:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:29:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 182 ms returned sat
[2020-06-03 05:29:00] [INFO ] [Nat]Absence check using 50 positive and 22 generalized place invariants in 63 ms returned sat
[2020-06-03 05:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:00] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2020-06-03 05:29:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:29:03] [INFO ] Deduced a trap composed of 3 places in 2653 ms
[2020-06-03 05:29:05] [INFO ] Deduced a trap composed of 45 places in 1542 ms
[2020-06-03 05:29:06] [INFO ] Deduced a trap composed of 46 places in 1509 ms
[2020-06-03 05:29:07] [INFO ] Deduced a trap composed of 45 places in 950 ms
[2020-06-03 05:29:09] [INFO ] Deduced a trap composed of 45 places in 1526 ms
[2020-06-03 05:29:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8267 ms
[2020-06-03 05:29:09] [INFO ] Computed and/alt/rep : 152/862/152 causal constraints in 14 ms.
[2020-06-03 05:29:09] [INFO ] Added : 69 causal constraints over 15 iterations in 508 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-03 05:29:09] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2020-06-03 05:29:09] [INFO ] [Real]Absence check using 50 positive and 22 generalized place invariants in 50 ms returned sat
[2020-06-03 05:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:10] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2020-06-03 05:29:10] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:29:12] [INFO ] Deduced a trap composed of 3 places in 1665 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 42 places in 1471 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 42 places in 1455 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 18 places in 843 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 43 places in 1880 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 16 places in 864 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 16 places in 1470 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 7 places in 1113 ms
[2020-06-03 05:29:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10910 ms
[2020-06-03 05:29:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:29:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 137 ms returned sat
[2020-06-03 05:29:21] [INFO ] [Nat]Absence check using 50 positive and 22 generalized place invariants in 25 ms returned sat
[2020-06-03 05:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:22] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2020-06-03 05:29:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 3 places in 330 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 7 places in 191 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-06-03 05:29:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 637 ms
[2020-06-03 05:29:23] [INFO ] Computed and/alt/rep : 152/862/152 causal constraints in 15 ms.
[2020-06-03 05:29:23] [INFO ] Added : 75 causal constraints over 16 iterations in 841 ms. Result :sat
[2020-06-03 05:29:25] [INFO ] Deduced a trap composed of 46 places in 1092 ms
[2020-06-03 05:29:26] [INFO ] Deduced a trap composed of 46 places in 1648 ms
[2020-06-03 05:29:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2877 ms
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-06-03 05:29:27] [INFO ] [Real]Absence check using 50 positive place invariants in 224 ms returned sat
[2020-06-03 05:29:27] [INFO ] [Real]Absence check using 50 positive and 22 generalized place invariants in 60 ms returned sat
[2020-06-03 05:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:28] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2020-06-03 05:29:28] [INFO ] [Real]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:29:28] [INFO ] Deduced a trap composed of 3 places in 186 ms
[2020-06-03 05:29:31] [INFO ] Deduced a trap composed of 46 places in 2891 ms
[2020-06-03 05:29:33] [INFO ] Deduced a trap composed of 44 places in 2204 ms
[2020-06-03 05:29:34] [INFO ] Deduced a trap composed of 13 places in 1385 ms
[2020-06-03 05:29:36] [INFO ] Deduced a trap composed of 20 places in 1627 ms
[2020-06-03 05:29:37] [INFO ] Deduced a trap composed of 7 places in 1433 ms
[2020-06-03 05:29:39] [INFO ] Deduced a trap composed of 8 places in 1312 ms
[2020-06-03 05:29:39] [INFO ] Deduced a trap composed of 45 places in 128 ms
[2020-06-03 05:29:39] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-06-03 05:29:39] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-06-03 05:29:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 11450 ms
[2020-06-03 05:29:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:29:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 34 ms returned sat
[2020-06-03 05:29:39] [INFO ] [Nat]Absence check using 50 positive and 22 generalized place invariants in 10 ms returned sat
[2020-06-03 05:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:39] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-03 05:29:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:29:40] [INFO ] Deduced a trap composed of 3 places in 511 ms
[2020-06-03 05:29:43] [INFO ] Deduced a trap composed of 50 places in 2776 ms
[2020-06-03 05:29:43] [INFO ] Deduced a trap composed of 45 places in 185 ms
[2020-06-03 05:29:43] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2020-06-03 05:29:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3625 ms
[2020-06-03 05:29:43] [INFO ] Computed and/alt/rep : 152/862/152 causal constraints in 11 ms.
[2020-06-03 05:29:44] [INFO ] Added : 82 causal constraints over 17 iterations in 937 ms. Result :sat
[2020-06-03 05:29:45] [INFO ] Deduced a trap composed of 43 places in 1171 ms
[2020-06-03 05:29:47] [INFO ] Deduced a trap composed of 43 places in 2037 ms
[2020-06-03 05:29:49] [INFO ] Deduced a trap composed of 46 places in 1502 ms
[2020-06-03 05:29:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4829 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 12800 steps, including 724 resets, run finished after 55 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9800 steps, including 504 resets, run finished after 35 ms. (steps per millisecond=280 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 602 resets, run finished after 34 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7900 steps, including 495 resets, run finished after 20 ms. (steps per millisecond=395 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 160/160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 195 transition count 159
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 195 transition count 153
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 187 transition count 153
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 187 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 186 transition count 152
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 182 transition count 148
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 182 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 181 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 180 transition count 146
Applied a total of 32 rules in 75 ms. Remains 180 /196 variables (removed 16) and now considering 146/160 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 180/196 places, 146/160 transitions.
Incomplete random walk after 1000000 steps, including 53480 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 13719 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16149 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13646 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13737 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 41325 steps, run visited all 4 properties in 86 ms. (steps per millisecond=480 )
Probabilistic random walk after 41325 steps, saw 10000 distinct states, run finished after 87 ms. (steps per millisecond=475 ) properties seen :[1, 1, 1, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-11"
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-11, 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-158987914000535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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