About the Execution of ITS-Tools for BusinessProcesses-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 435.212 | 42202.00 | 71690.00 | 83.60 | FTFTFFTTFTTFFTFF | 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/mcc2024-input.r048-tajo-171620399700547.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700547
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716335651615
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:54:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:54:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:54:13] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-21 23:54:13] [INFO ] Transformed 593 places.
[2024-05-21 23:54:13] [INFO ] Transformed 536 transitions.
[2024-05-21 23:54:13] [INFO ] Found NUPN structural information;
[2024-05-21 23:54:13] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 91 place count 494 transition count 442
Iterating global reduction 1 with 86 rules applied. Total rules applied 177 place count 494 transition count 442
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 223 place count 448 transition count 396
Iterating global reduction 1 with 46 rules applied. Total rules applied 269 place count 448 transition count 396
Applied a total of 269 rules in 281 ms. Remains 448 /585 variables (removed 137) and now considering 396/528 (removed 132) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-21 23:54:14] [INFO ] Computed 90 invariants in 46 ms
[2024-05-21 23:54:14] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-21 23:54:14] [INFO ] Invariant cache hit.
[2024-05-21 23:54:14] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:54:23] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 20 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 84 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:54:24] [INFO ] Deduced a trap composed of 84 places in 289 ms of which 12 ms to minimize.
[2024-05-21 23:54:25] [INFO ] Deduced a trap composed of 88 places in 952 ms of which 9 ms to minimize.
[2024-05-21 23:54:25] [INFO ] Deduced a trap composed of 93 places in 518 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:26] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:27] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 4 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 21 solved, 374 unsolved
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:54:28] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:29] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 4 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:54:30] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:54:31] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 26 solved, 369 unsolved
[2024-05-21 23:54:31] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:31] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:54:31] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:31] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:54:32] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:33] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:34] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 26 solved, 369 unsolved
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/170 constraints. Problems are: Problem set: 28 solved, 367 unsolved
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
SMT process timed out in 30239ms, After SMT, problems are : Problem set: 28 solved, 367 unsolved
Search for dead transitions found 28 dead transitions in 30260ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/585 places, 368/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31672 ms. Remains : 448/585 places, 368/528 transitions.
Support contains 10 out of 448 places after structural reductions.
[2024-05-21 23:54:45] [INFO ] Flatten gal took : 116 ms
[2024-05-21 23:54:45] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:54:45] [INFO ] Input system was already deterministic with 368 transitions.
RANDOM walk for 40000 steps (280 resets) in 1442 ms. (27 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (50 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
// Phase 1: matrix 368 rows 448 cols
[2024-05-21 23:54:46] [INFO ] Computed 91 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/323 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/434 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/438 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 361/799 variables, 438/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/799 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/810 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/810 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/816 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/816 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/816 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 539 constraints, problems are : Problem set: 0 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/323 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 8 places in 689 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 111/434 variables, 37/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/438 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 361/799 variables, 438/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/799 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/799 variables, 5/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/799 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/810 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/810 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/816 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/816 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/816 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3442 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 3831ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 16843 steps, including 110 resets, run visited all 2 properties in 48 ms. (steps per millisecond=350 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 66 ms.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 967 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1))&&G(p2))))'
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 368/368 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-21 23:54:50] [INFO ] Invariant cache hit.
[2024-05-21 23:54:50] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 23:54:50] [INFO ] Invariant cache hit.
[2024-05-21 23:54:51] [INFO ] Implicit Places using invariants and state equation in 578 ms returned [142, 144, 401]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 794 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/448 places, 368/368 transitions.
Applied a total of 0 rules in 8 ms. Remains 445 /445 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 818 ms. Remains : 445/448 places, 368/368 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-00 finished in 1254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 368/368 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 366
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 366
Applied a total of 4 rules in 14 ms. Remains 446 /448 variables (removed 2) and now considering 366/368 (removed 2) transitions.
// Phase 1: matrix 366 rows 446 cols
[2024-05-21 23:54:51] [INFO ] Computed 91 invariants in 7 ms
[2024-05-21 23:54:52] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 23:54:52] [INFO ] Invariant cache hit.
[2024-05-21 23:54:52] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [142, 144, 399]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 677 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/448 places, 366/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 443 /443 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 697 ms. Remains : 443/448 places, 366/368 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-02
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-02 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 368/368 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 961 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 441 transition count 313
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 394 transition count 313
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 96 place count 394 transition count 218
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 302 place count 283 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 281 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 281 transition count 216
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 237 rules applied. Total rules applied 543 place count 160 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 545 place count 159 transition count 104
Applied a total of 545 rules in 137 ms. Remains 159 /448 variables (removed 289) and now considering 104/368 (removed 264) transitions.
// Phase 1: matrix 104 rows 159 cols
[2024-05-21 23:54:52] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 23:54:52] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 47, 48, 49, 50, 51, 131]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 98 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/448 places, 104/368 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 103
Applied a total of 2 rules in 9 ms. Remains 138 /139 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 138 cols
[2024-05-21 23:54:52] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 23:54:52] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 23:54:53] [INFO ] Invariant cache hit.
[2024-05-21 23:54:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 23:54:53] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [1, 3, 7, 10, 11, 13, 28, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89, 109, 120, 124, 126, 128, 130, 132, 136]
Discarding 41 places :
Implicit Place search using SMT with State Equation took 285 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/448 places, 103/368 transitions.
Graph (complete) has 247 edges and 97 vertex of which 86 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 86 transition count 89
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 77 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 73 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 73 transition count 83
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 73 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 70 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 70 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 50 place count 61 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 60 transition count 71
Applied a total of 52 rules in 30 ms. Remains 60 /97 variables (removed 37) and now considering 71/103 (removed 32) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 23:54:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 23:54:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 23:54:53] [INFO ] Invariant cache hit.
[2024-05-21 23:54:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:54:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 60/448 places, 71/368 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 664 ms. Remains : 60/448 places, 71/368 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-04 finished in 740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 368/368 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 961 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 441 transition count 313
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 394 transition count 313
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 96 place count 394 transition count 218
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 303 place count 282 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 280 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 280 transition count 216
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 239 rules applied. Total rules applied 546 place count 158 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 157 transition count 103
Applied a total of 548 rules in 39 ms. Remains 157 /448 variables (removed 291) and now considering 103/368 (removed 265) transitions.
// Phase 1: matrix 103 rows 157 cols
[2024-05-21 23:54:53] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 23:54:53] [INFO ] Implicit Places using invariants in 299 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 45, 46, 47, 48, 49]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 301 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/448 places, 103/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 138/448 places, 103/368 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-11 finished in 415 ms.
All properties solved by simple procedures.
Total runtime 40706 ms.
BK_STOP 1716335693817
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-13"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-13, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399700547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;