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-171620399800563.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-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716336428925

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:07:10] [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-22 00:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:07:10] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-22 00:07:10] [INFO ] Transformed 630 places.
[2024-05-22 00:07:10] [INFO ] Transformed 566 transitions.
[2024-05-22 00:07:10] [INFO ] Found NUPN structural information;
[2024-05-22 00:07:10] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 535 transition count 474
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 535 transition count 474
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 221 place count 493 transition count 432
Iterating global reduction 1 with 42 rules applied. Total rules applied 263 place count 493 transition count 432
Applied a total of 263 rules in 120 ms. Remains 493 /626 variables (removed 133) and now considering 432/562 (removed 130) transitions.
// Phase 1: matrix 432 rows 493 cols
[2024-05-22 00:07:10] [INFO ] Computed 99 invariants in 28 ms
[2024-05-22 00:07:11] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-22 00:07:11] [INFO ] Invariant cache hit.
[2024-05-22 00:07:11] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-22 00:07:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/493 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 22 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 5 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:21] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 94 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:07:22] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:07:23] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 3 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 20/119 constraints. Problems are: Problem set: 8 solved, 423 unsolved
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:07:24] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 5 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:07:25] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 20/139 constraints. Problems are: Problem set: 11 solved, 420 unsolved
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:07:26] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:07:27] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 8 ms to minimize.
[2024-05-22 00:07:28] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:07:29] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:07:29] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:07:29] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/159 constraints. Problems are: Problem set: 13 solved, 418 unsolved
[2024-05-22 00:07:32] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:07:32] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 4 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:07:33] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:07:34] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:07:35] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 20/179 constraints. Problems are: Problem set: 25 solved, 406 unsolved
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 89 places in 195 ms of which 5 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 406 unsolved
[2024-05-22 00:07:39] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 6 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
SMT process timed out in 30283ms, After SMT, problems are : Problem set: 25 solved, 406 unsolved
Search for dead transitions found 25 dead transitions in 30302ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 493/626 places, 407/562 transitions.
Applied a total of 0 rules in 18 ms. Remains 493 /493 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31598 ms. Remains : 493/626 places, 407/562 transitions.
Support contains 23 out of 493 places after structural reductions.
[2024-05-22 00:07:42] [INFO ] Flatten gal took : 71 ms
[2024-05-22 00:07:42] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:07:42] [INFO ] Input system was already deterministic with 407 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (265 resets) in 2052 ms. (19 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40002 steps (47 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (50 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (50 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 61 ms. (645 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (40 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
// Phase 1: matrix 407 rows 493 cols
[2024-05-22 00:07:43] [INFO ] Computed 99 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 119/483 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 5044ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 219 edges and 493 vertex of which 6 / 493 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1059 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 487 transition count 350
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 438 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 437 transition count 349
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 102 place count 437 transition count 251
Deduced a syphon composed of 98 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 316 place count 321 transition count 251
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 318 place count 319 transition count 249
Iterating global reduction 3 with 2 rules applied. Total rules applied 320 place count 319 transition count 249
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 585 place count 185 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 587 place count 184 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 184 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 591 place count 182 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 592 place count 182 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 181 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 594 place count 180 transition count 119
Applied a total of 594 rules in 233 ms. Remains 180 /493 variables (removed 313) and now considering 119/407 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 180/493 places, 119/407 transitions.
RANDOM walk for 40000 steps (980 resets) in 937 ms. (42 steps per ms) remains 1/5 properties
BEST_FIRST walk for 338 steps (6 resets) in 7 ms. (42 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 208 stabilizing places and 180 stable transitions
Graph (complete) has 1066 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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(G(p0)))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 488 transition count 402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 488 transition count 402
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 484 transition count 398
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 484 transition count 398
Applied a total of 18 rules in 66 ms. Remains 484 /493 variables (removed 9) and now considering 398/407 (removed 9) transitions.
// Phase 1: matrix 398 rows 484 cols
[2024-05-22 00:07:49] [INFO ] Computed 99 invariants in 6 ms
[2024-05-22 00:07:49] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 00:07:49] [INFO ] Invariant cache hit.
[2024-05-22 00:07:49] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 652 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/493 places, 398/407 transitions.
Applied a total of 0 rules in 23 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 742 ms. Remains : 481/493 places, 398/407 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-00 finished in 1030 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)&&X(G(p1)))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 490 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 490 transition count 404
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 488 transition count 402
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 488 transition count 402
Applied a total of 10 rules in 30 ms. Remains 488 /493 variables (removed 5) and now considering 402/407 (removed 5) transitions.
// Phase 1: matrix 402 rows 488 cols
[2024-05-22 00:07:50] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:07:50] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 00:07:50] [INFO ] Invariant cache hit.
[2024-05-22 00:07:50] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [87, 88, 89]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 567 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 485/493 places, 402/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 485 /485 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 485/493 places, 402/407 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-02 finished in 831 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' '!(F(G(p0)))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 230 edges and 493 vertex of which 6 / 493 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 1060 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 486 transition count 347
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 434 transition count 345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 432 transition count 345
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 242
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 335 place count 310 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 340 place count 305 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 345 place count 305 transition count 237
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 607 place count 172 transition count 108
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 3 with 2 rules applied. Total rules applied 609 place count 171 transition count 112
Applied a total of 609 rules in 66 ms. Remains 171 /493 variables (removed 322) and now considering 112/407 (removed 295) transitions.
// Phase 1: matrix 112 rows 171 cols
[2024-05-22 00:07:51] [INFO ] Computed 76 invariants in 1 ms
[2024-05-22 00:07:51] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 3, 4, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 54, 55, 56, 145]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 109 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/493 places, 112/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 149/493 places, 112/407 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-03 finished in 232 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&&G(p1))||(p0&&X(p2))))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 400
Applied a total of 14 rules in 25 ms. Remains 486 /493 variables (removed 7) and now considering 400/407 (removed 7) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-05-22 00:07:51] [INFO ] Computed 99 invariants in 7 ms
[2024-05-22 00:07:51] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 00:07:51] [INFO ] Invariant cache hit.
[2024-05-22 00:07:52] [INFO ] Implicit Places using invariants and state equation in 612 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 816 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/493 places, 400/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 848 ms. Remains : 483/493 places, 400/407 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-04
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-04 finished in 1188 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(X(X(G(p0)))))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 485 transition count 399
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 485 transition count 399
Applied a total of 16 rules in 24 ms. Remains 485 /493 variables (removed 8) and now considering 399/407 (removed 8) transitions.
// Phase 1: matrix 399 rows 485 cols
[2024-05-22 00:07:52] [INFO ] Computed 99 invariants in 3 ms
[2024-05-22 00:07:52] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 00:07:52] [INFO ] Invariant cache hit.
[2024-05-22 00:07:53] [INFO ] Implicit Places using invariants and state equation in 501 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 706 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/493 places, 399/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 482 /482 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 482/493 places, 399/407 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-08
Product exploration explored 100000 steps with 675 reset in 315 ms.
Entered a terminal (fully accepting) state of product in 98964 steps with 663 reset in 302 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-08 finished in 1533 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' '!(F(p0))'
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 231 edges and 493 vertex of which 6 / 493 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1060 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 486 transition count 345
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 432 transition count 345
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 242
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 336 place count 309 transition count 242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 304 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 304 transition count 237
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 610 place count 170 transition count 107
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 612 place count 169 transition count 111
Applied a total of 612 rules in 42 ms. Remains 169 /493 variables (removed 324) and now considering 111/407 (removed 296) transitions.
// Phase 1: matrix 111 rows 169 cols
[2024-05-22 00:07:54] [INFO ] Computed 75 invariants in 1 ms
[2024-05-22 00:07:54] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 134 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/493 places, 111/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 147/493 places, 111/407 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-13 finished in 241 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(p0)||X(F(p1))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 400
Applied a total of 14 rules in 23 ms. Remains 486 /493 variables (removed 7) and now considering 400/407 (removed 7) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-05-22 00:07:54] [INFO ] Computed 99 invariants in 3 ms
[2024-05-22 00:07:54] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 00:07:54] [INFO ] Invariant cache hit.
[2024-05-22 00:07:55] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 729 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/493 places, 400/407 transitions.
Applied a total of 0 rules in 9 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 761 ms. Remains : 483/493 places, 400/407 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-14
Product exploration explored 100000 steps with 677 reset in 326 ms.
Product exploration explored 100000 steps with 675 reset in 277 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1041 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/483 stabilizing places and 178/400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (267 resets) in 562 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 446 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (41 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 710030 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :3 out of 6
Probabilistic random walk after 710030 steps, saw 114165 distinct states, run finished after 3009 ms. (steps per millisecond=235 ) properties seen :3
// Phase 1: matrix 400 rows 483 cols
[2024-05-22 00:07:59] [INFO ] Computed 96 invariants in 8 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, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 127/131 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/354 variables, 52/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 112/466 variables, 34/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/477 variables, 4/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 396/873 variables, 477/580 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/873 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 9/882 variables, 5/585 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/882 variables, 20/605 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 8/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/882 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/883 variables, 1/614 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/883 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 883/883 variables, and 614 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4951 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/131 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/354 variables, 52/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 13/71 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 6/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 112/466 variables, 34/131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 18/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/477 variables, 4/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 396/873 variables, 477/632 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/873 variables, 2/634 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 4/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/882 variables, 5/643 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/882 variables, 2/645 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:08:09] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/882 variables, 6/651 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/882 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/883 variables, 1/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/883 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/883 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 883/883 variables, and 652 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 71/71 constraints]
After SMT, in 9519ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8164 steps, including 67 resets, run visited all 2 properties in 91 ms. (steps per millisecond=89 )
Parikh walk visited 2 properties in 96 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 434 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 219 edges and 483 vertex of which 6 / 483 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 1035 edges and 478 vertex of which 477 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 476 transition count 343
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 427 transition count 343
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 427 transition count 242
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 307 transition count 242
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 584 place count 174 transition count 112
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 586 place count 173 transition count 116
Applied a total of 586 rules in 40 ms. Remains 173 /483 variables (removed 310) and now considering 116/400 (removed 284) transitions.
// Phase 1: matrix 116 rows 173 cols
[2024-05-22 00:08:10] [INFO ] Computed 74 invariants in 3 ms
[2024-05-22 00:08:10] [INFO ] Implicit Places using invariants in 139 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 30, 31, 32, 33, 34, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 140 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 116/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 149/483 places, 116/400 transitions.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/149 stabilizing places and 26/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 183 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (7983 resets) in 1028 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2554 resets) in 59 ms. (666 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (2509 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2464 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2562 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 149 cols
[2024-05-22 00:08:11] [INFO ] Computed 50 invariants in 8 ms
[2024-05-22 00:08:11] [INFO ] State equation strengthened by 5 read => feed constraints.
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, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 45/49 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/115 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/140 variables, 10/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/147 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/262 variables, 147/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 5/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/264 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 204 constraints, problems are : Problem set: 1 solved, 2 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/115 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/140 variables, 10/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/147 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/262 variables, 147/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 5/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/264 variables, 2/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/264 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 206 constraints, problems are : Problem set: 1 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 116/116 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 149 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 147 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 147 transition count 113
Applied a total of 6 rules in 11 ms. Remains 147 /149 variables (removed 2) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 147/149 places, 113/116 transitions.
RANDOM walk for 187 steps (1 resets) in 4 ms. (37 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 15 factoid took 313 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 17770 reset in 283 ms.
Product exploration explored 100000 steps with 17762 reset in 240 ms.
Built C files in :
/tmp/ltsmin16179694536048472033
[2024-05-22 00:08:13] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-22 00:08:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:13] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-22 00:08:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:13] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-22 00:08:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:08:13] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16179694536048472033
Running compilation step : cd /tmp/ltsmin16179694536048472033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin16179694536048472033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16179694536048472033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased847267002605733085.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLCardinality-14 finished in 19973 ms.
All properties solved by simple procedures.
Total runtime 64006 ms.

BK_STOP 1716336494279

--------------------
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-15"
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-15, 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-171620399800563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;