Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500407.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 30 00:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 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 1654200631792

Running Version 202205111006
[2022-06-02 20:10:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:10:33] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-06-02 20:10:33] [INFO ] Transformed 567 places.
[2022-06-02 20:10:33] [INFO ] Transformed 508 transitions.
[2022-06-02 20:10:33] [INFO ] Found NUPN structural information;
[2022-06-02 20:10:33] [INFO ] Parsed PT model containing 567 places and 508 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 501 rows 560 cols
[2022-06-02 20:10:34] [INFO ] Computed 95 place invariants in 41 ms
[2022-06-02 20:10:35] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-06-02 20:10:35] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 15 ms returned sat
[2022-06-02 20:10:35] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:10
[2022-06-02 20:10:35] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 8 ms to minimize.
[2022-06-02 20:10:35] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:35] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:10:36] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:10:37] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:10:37] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:10:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1733 ms
[2022-06-02 20:10:37] [INFO ] After 1964ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:11
[2022-06-02 20:10:37] [INFO ] After 2418ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2022-06-02 20:10:37] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-06-02 20:10:37] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2022-06-02 20:10:38] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2022-06-02 20:10:38] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2022-06-02 20:10:38] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:10:38] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:10:38] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2022-06-02 20:10:38] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1106 ms
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:10:39] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 4 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:10:40] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:10:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1376 ms
[2022-06-02 20:10:41] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2022-06-02 20:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-02 20:10:41] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:10:41] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:41] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:42] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:10:42] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:42] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:42] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:10:42] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:10:43] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:44] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:44] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:10:44] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2022-06-02 20:10:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3088 ms
[2022-06-02 20:10:44] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:10:45] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2022-06-02 20:10:45] [INFO ] After 7550ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 834 ms.
[2022-06-02 20:10:45] [INFO ] After 8764ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 2640 ms.
Support contains 57 out of 560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 560/560 places, 501/501 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.8 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 555 transition count 439
Reduce places removed 61 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 66 rules applied. Total rules applied 128 place count 494 transition count 434
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 133 place count 489 transition count 434
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 133 place count 489 transition count 316
Deduced a syphon composed of 118 places in 3 ms
Ensure Unique test removed 14 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 383 place count 357 transition count 316
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 446 place count 294 transition count 253
Iterating global reduction 3 with 63 rules applied. Total rules applied 509 place count 294 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 509 place count 294 transition count 252
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 511 place count 293 transition count 252
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 646 place count 224 transition count 186
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 648 place count 224 transition count 186
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 654 place count 224 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 655 place count 223 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 656 place count 222 transition count 185
Applied a total of 656 rules in 141 ms. Remains 222 /560 variables (removed 338) and now considering 185/501 (removed 316) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/560 places, 185/501 transitions.
Incomplete random walk after 1000000 steps, including 39096 resets, run finished after 18920 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 8506 resets, run finished after 4754 ms. (steps per millisecond=210 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8499 resets, run finished after 4815 ms. (steps per millisecond=207 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9005 resets, run finished after 4296 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 981577 steps, including 8477 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
Running SMT prover for 3 properties.
// Phase 1: matrix 185 rows 222 cols
[2022-06-02 20:11:26] [INFO ] Computed 73 place invariants in 15 ms
[2022-06-02 20:11:26] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 20:11:26] [INFO ] [Nat]Absence check using 48 positive place invariants in 8 ms returned sat
[2022-06-02 20:11:26] [INFO ] [Nat]Absence check using 48 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-02 20:11:26] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 20:11:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2022-06-02 20:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-02 20:11:27] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2022-06-02 20:11:27] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:11:27] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-06-02 20:11:27] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:11:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2022-06-02 20:11:27] [INFO ] After 711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-02 20:11:27] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 478 ms.
Support contains 52 out of 222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 222/222 places, 185/185 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 221 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 221 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 220 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 8 place count 218 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 217 transition count 185
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 217 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 216 transition count 184
Applied a total of 12 rules in 52 ms. Remains 216 /222 variables (removed 6) and now considering 184/185 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 216/222 places, 184/185 transitions.
Incomplete random walk after 1000000 steps, including 43277 resets, run finished after 13586 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9725 resets, run finished after 3817 ms. (steps per millisecond=261 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9791 resets, run finished after 3839 ms. (steps per millisecond=260 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 987569 steps, including 9364 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen 0
Finished probabilistic random walk after 11857 steps, run visited all 3 properties in 72 ms. (steps per millisecond=164 )
Probabilistic random walk after 11857 steps, saw 2870 distinct states, run finished after 72 ms. (steps per millisecond=164 ) properties seen :3
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 81424 ms.

BK_STOP 1654200714445

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r024-tall-165251918500407"
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 ;