Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900598.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678649273491

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:27:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:27:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:27:55] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-12 19:27:55] [INFO ] Transformed 772 places.
[2023-03-12 19:27:55] [INFO ] Transformed 685 transitions.
[2023-03-12 19:27:55] [INFO ] Found NUPN structural information;
[2023-03-12 19:27:55] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-12 19:27:56] [INFO ] Computed 125 place invariants in 27 ms
[2023-03-12 19:27:57] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 19:27:57] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2023-03-12 19:27:57] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-12 19:27:58] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 19:27:58] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 7 ms to minimize.
[2023-03-12 19:27:58] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 545 ms
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 10 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-12 19:27:59] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2023-03-12 19:28:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1820 ms
[2023-03-12 19:28:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-12 19:28:01] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:28:01] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2023-03-12 19:28:01] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 0 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:28:02] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 161 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 151 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 173 places in 135 ms of which 1 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3373 ms
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 2 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 252 ms
[2023-03-12 19:28:05] [INFO ] After 7774ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-12 19:28:05] [INFO ] After 8616ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 62 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 371 edges and 757 vertex of which 4 / 757 are part of one of the 1 SCC in 16 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1516 edges and 754 vertex of which 747 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 747 transition count 526
Reduce places removed 139 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 155 rules applied. Total rules applied 296 place count 608 transition count 510
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 312 place count 592 transition count 510
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 312 place count 592 transition count 415
Deduced a syphon composed of 95 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 515 place count 484 transition count 415
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 591 place count 408 transition count 339
Iterating global reduction 3 with 76 rules applied. Total rules applied 667 place count 408 transition count 339
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 667 place count 408 transition count 333
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 680 place count 401 transition count 333
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 906 place count 287 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 908 place count 286 transition count 223
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 910 place count 286 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 912 place count 284 transition count 221
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 916 place count 284 transition count 221
Applied a total of 916 rules in 202 ms. Remains 284 /757 variables (removed 473) and now considering 221/670 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 284/757 places, 221/670 transitions.
Incomplete random walk after 10000 steps, including 351 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 221 rows 284 cols
[2023-03-12 19:28:06] [INFO ] Computed 103 place invariants in 6 ms
[2023-03-12 19:28:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:28:06] [INFO ] [Nat]Absence check using 72 positive place invariants in 10 ms returned sat
[2023-03-12 19:28:06] [INFO ] [Nat]Absence check using 72 positive and 31 generalized place invariants in 9 ms returned sat
[2023-03-12 19:28:06] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:28:06] [INFO ] After 84ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 617 ms
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-12 19:28:07] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-12 19:28:07] [INFO ] After 1295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 38 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 221/221 transitions.
Graph (complete) has 951 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 283 transition count 216
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 278 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 276 transition count 214
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 15 place count 276 transition count 206
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 34 place count 265 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 262 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 262 transition count 203
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 69 place count 247 transition count 189
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 247 transition count 189
Applied a total of 70 rules in 55 ms. Remains 247 /284 variables (removed 37) and now considering 189/221 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 247/284 places, 189/221 transitions.
Incomplete random walk after 10000 steps, including 520 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 722231 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{2=1}
Probabilistic random walk after 722231 steps, saw 157311 distinct states, run finished after 3006 ms. (steps per millisecond=240 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 189 rows 247 cols
[2023-03-12 19:28:11] [INFO ] Computed 98 place invariants in 6 ms
[2023-03-12 19:28:11] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:28:11] [INFO ] [Nat]Absence check using 71 positive place invariants in 10 ms returned sat
[2023-03-12 19:28:11] [INFO ] [Nat]Absence check using 71 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-12 19:28:11] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:28:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 19:28:11] [INFO ] After 49ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 19:28:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-12 19:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-12 19:28:11] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-12 19:28:11] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 189/189 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 247 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 246 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 246 transition count 180
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 234 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 232 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 232 transition count 178
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 224 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 44 place count 223 transition count 170
Applied a total of 44 rules in 28 ms. Remains 223 /247 variables (removed 24) and now considering 170/189 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 223/247 places, 170/189 transitions.
Incomplete random walk after 10000 steps, including 795 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 691715 steps, run visited all 2 properties in 2143 ms. (steps per millisecond=322 )
Probabilistic random walk after 691715 steps, saw 206326 distinct states, run finished after 2146 ms. (steps per millisecond=322 ) properties seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 19115 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/639/inv_0_ --invariant=/tmp/639/inv_1_ --invariant=/tmp/639/inv_2_ --invariant=/tmp/639/inv_3_ --invariant=/tmp/639/inv_4_ --invariant=/tmp/639/inv_5_ --invariant=/tmp/639/inv_6_ --invariant=/tmp/639/inv_7_ --invariant=/tmp/639/inv_8_ --invariant=/tmp/639/inv_9_ --invariant=/tmp/639/inv_10_ --invariant=/tmp/639/inv_11_ --invariant=/tmp/639/inv_12_ --invariant=/tmp/639/inv_13_ --invariant=/tmp/639/inv_14_ --invariant=/tmp/639/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 12916304 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16098688 kB
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-19-ReachabilityCardinality-15

BK_STOP 1678652865754

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_0_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_1_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_2_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_3_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_4_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_5_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_6_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_7_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_8_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_9_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_10_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_11_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_12_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_13_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/639/inv_14_
rfs formula name BusinessProcesses-PT-19-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/639/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 772 places, 685 transitions and 1981 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-19 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 685->685 groups
pnml2lts-sym: Regrouping took 0.240 real 0.230 user 0.000 sys
pnml2lts-sym: state vector length is 772; there are 685 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 645
Killing (9) : 645

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-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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