About the Execution of LTSMin+red for BusinessProcesses-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
392.147 | 19928.00 | 40547.00 | 60.90 | FFTTFFFTFTTFFTFT | normal |
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-167813694800526.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800526
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678642525621
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-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:35:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:35:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:35:27] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-12 17:35:27] [INFO ] Transformed 518 places.
[2023-03-12 17:35:27] [INFO ] Transformed 471 transitions.
[2023-03-12 17:35:27] [INFO ] Found NUPN structural information;
[2023-03-12 17:35:27] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 11) seen :5
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-12 17:35:28] [INFO ] Computed 85 place invariants in 31 ms
[2023-03-12 17:35:28] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:35:28] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-12 17:35:28] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-12 17:35:29] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 7 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:35:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 781 ms
[2023-03-12 17:35:30] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:35:30] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-03-12 17:35:30] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:35:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-12 17:35:30] [INFO ] After 1575ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-12 17:35:30] [INFO ] After 1979ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 85 ms.
Support contains 9 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 291 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 510 transition count 354
Reduce places removed 108 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 111 rules applied. Total rules applied 221 place count 402 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 224 place count 399 transition count 351
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 224 place count 399 transition count 273
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 392 place count 309 transition count 273
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 456 place count 245 transition count 209
Iterating global reduction 3 with 64 rules applied. Total rules applied 520 place count 245 transition count 209
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 520 place count 245 transition count 203
Deduced a syphon composed of 6 places in 1 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 533 place count 238 transition count 203
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 686 place count 160 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 688 place count 159 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 690 place count 159 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 692 place count 157 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 157 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 694 place count 156 transition count 128
Applied a total of 694 rules in 113 ms. Remains 156 /518 variables (removed 362) and now considering 128/471 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 156/518 places, 128/471 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 156 cols
[2023-03-12 17:35:30] [INFO ] Computed 68 place invariants in 7 ms
[2023-03-12 17:35:30] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:30] [INFO ] [Nat]Absence check using 47 positive place invariants in 10 ms returned sat
[2023-03-12 17:35:30] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-12 17:35:30] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:35:30] [INFO ] After 28ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-12 17:35:31] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 17:35:31] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 128/128 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 156 transition count 127
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 127
Applied a total of 3 rules in 12 ms. Remains 154 /156 variables (removed 2) and now considering 127/128 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 154/156 places, 127/128 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1227719 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :{}
Probabilistic random walk after 1227719 steps, saw 311610 distinct states, run finished after 3004 ms. (steps per millisecond=408 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 154 cols
[2023-03-12 17:35:34] [INFO ] Computed 67 place invariants in 12 ms
[2023-03-12 17:35:34] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-12 17:35:34] [INFO ] [Nat]Absence check using 44 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-12 17:35:34] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:35:34] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-12 17:35:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-12 17:35:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-12 17:35:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-12 17:35:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2023-03-12 17:35:34] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 17:35:34] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-12 17:35:34] [INFO ] Invariant cache hit.
[2023-03-12 17:35:34] [INFO ] Implicit Places using invariants in 101 ms returned [12, 20, 21, 22]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/154 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 116 ms. Remains : 150/154 places, 127/127 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1569030 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :{}
Probabilistic random walk after 1569030 steps, saw 343717 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 150 cols
[2023-03-12 17:35:37] [INFO ] Computed 63 place invariants in 8 ms
[2023-03-12 17:35:37] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-12 17:35:37] [INFO ] [Nat]Absence check using 45 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 17:35:37] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:35:38] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:38] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2023-03-12 17:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-12 17:35:38] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 17:35:38] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 150/150 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-12 17:35:38] [INFO ] Invariant cache hit.
[2023-03-12 17:35:38] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 17:35:38] [INFO ] Invariant cache hit.
[2023-03-12 17:35:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:35:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [90, 96, 102, 104]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 297 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 146/150 places, 127/127 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 125
Applied a total of 4 rules in 8 ms. Remains 144 /146 variables (removed 2) and now considering 125/127 (removed 2) transitions.
// Phase 1: matrix 125 rows 144 cols
[2023-03-12 17:35:38] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-12 17:35:38] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 17:35:38] [INFO ] Invariant cache hit.
[2023-03-12 17:35:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 17:35:38] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 144/150 places, 125/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 582 ms. Remains : 144/150 places, 125/127 transitions.
Incomplete random walk after 10000 steps, including 342 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1618390 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :{}
Probabilistic random walk after 1618390 steps, saw 344122 distinct states, run finished after 3002 ms. (steps per millisecond=539 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:35:41] [INFO ] Invariant cache hit.
[2023-03-12 17:35:41] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2023-03-12 17:35:41] [INFO ] [Nat]Absence check using 41 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-12 17:35:41] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 17:35:41] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-12 17:35:41] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 17:35:41] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 144/144 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-12 17:35:42] [INFO ] Invariant cache hit.
[2023-03-12 17:35:42] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 17:35:42] [INFO ] Invariant cache hit.
[2023-03-12 17:35:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 17:35:42] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-12 17:35:42] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 17:35:42] [INFO ] Invariant cache hit.
[2023-03-12 17:35:42] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 144/144 places, 125/125 transitions.
Graph (complete) has 551 edges and 144 vertex of which 141 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 141 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 140 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 137 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 137 transition count 120
Applied a total of 11 rules in 18 ms. Remains 137 /144 variables (removed 7) and now considering 120/125 (removed 5) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 137 cols
[2023-03-12 17:35:42] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-12 17:35:42] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:35:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-12 17:35:42] [INFO ] [Nat]Absence check using 36 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-12 17:35:42] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-12 17:35:42] [INFO ] After 15ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:42] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 17:35:42] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:35:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-12 17:35:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 125 transitions and 701 arcs took 2 ms.
[2023-03-12 17:35:42] [INFO ] Flatten gal took : 48 ms
Total runtime 15683 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/597/inv_0_ --inv-par
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678642545549
--------------------
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-10-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/597/inv_0_
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 144 places, 125 transitions and 701 arcs
pnml2lts-sym: Petri net BusinessProcesses_PT_10 analyzed
pnml2lts-sym: There are no 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: 125->120 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 144; there are 120 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:
pnml2lts-sym: Invariant violation (/tmp/597/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 2.280 real 9.110 user 0.020 sys
pnml2lts-sym: max token count: 1
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-10"
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-10, 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-167813694800526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 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 '
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 ;