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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 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 85K 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-06-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716333873457

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:24:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:24:35] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-21 23:24:35] [INFO ] Transformed 376 places.
[2024-05-21 23:24:35] [INFO ] Transformed 297 transitions.
[2024-05-21 23:24:35] [INFO ] Found NUPN structural information;
[2024-05-21 23:24:35] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 335 transition count 258
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 335 transition count 258
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 317 transition count 240
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 317 transition count 240
Applied a total of 114 rules in 166 ms. Remains 317 /375 variables (removed 58) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 317 cols
[2024-05-21 23:24:36] [INFO ] Computed 79 invariants in 23 ms
[2024-05-21 23:24:36] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-21 23:24:36] [INFO ] Invariant cache hit.
[2024-05-21 23:24:37] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-21 23:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 29 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 9 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 20 places in 1862 ms of which 27 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 4 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 5 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 3 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 3 ms to minimize.
(s120 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/557 variables, and 158 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 240/557 variables, 317/486 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 239/725 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 3 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 745 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 110/110 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 317/375 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61704 ms. Remains : 317/375 places, 240/296 transitions.
Support contains 20 out of 317 places after structural reductions.
[2024-05-21 23:25:37] [INFO ] Flatten gal took : 61 ms
[2024-05-21 23:25:37] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:25:38] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 22141 steps (220 resets) in 643 ms. (34 steps per ms) remains 0/12 properties
FORMULA BusinessProcesses-PT-06-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 309 stabilizing places and 230 stable transitions
Graph (complete) has 627 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 49 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:25:38] [INFO ] Computed 79 invariants in 6 ms
[2024-05-21 23:25:39] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 23:25:39] [INFO ] Invariant cache hit.
[2024-05-21 23:25:39] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:25:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 6 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 5 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 3 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 4 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 11/164 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (OVERLAPS) 233/543 variables, 310/474 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 479 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 90/169 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/479 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/711 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 723 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 102/102 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 310/317 places, 233/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLCardinality-02 finished in 61756 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 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 29 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:26:40] [INFO ] Computed 79 invariants in 8 ms
[2024-05-21 23:26:40] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-21 23:26:40] [INFO ] Invariant cache hit.
[2024-05-21 23:26:41] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 5 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:49] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 8 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 4 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 3 ms to minimize.
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:58] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 3 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 4 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 717 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 98/98 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 232/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61016 ms. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-03 finished in 61223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 40 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:27:41] [INFO ] Computed 79 invariants in 3 ms
[2024-05-21 23:27:44] [INFO ] Implicit Places using invariants in 2869 ms returned []
[2024-05-21 23:27:44] [INFO ] Invariant cache hit.
[2024-05-21 23:27:44] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:27:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 3 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 3 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 14/157 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/543 variables, and 172 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 93/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 233/543 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 232/716 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 18/734 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 738 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 117/117 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 310/317 places, 233/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63379 ms. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 646 steps with 41 reset in 3 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-05 finished in 63512 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(p1)))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 15 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:28:45] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:28:45] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 23:28:45] [INFO ] Invariant cache hit.
[2024-05-21 23:28:45] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:01] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:02] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:29:02] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:02] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 18 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 29026 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 22 places in 677 ms of which 9 ms to minimize.
SMT process timed out in 59436ms, After SMT, problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 59442ms
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 232/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59988 ms. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-06
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-06 finished in 60174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 139 edges and 317 vertex of which 7 / 317 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 309 transition count 201
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 279 transition count 201
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 62 place count 279 transition count 135
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 204 place count 203 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 198 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 198 transition count 130
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 388 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 105 transition count 46
Applied a total of 390 rules in 109 ms. Remains 105 /317 variables (removed 212) and now considering 46/240 (removed 194) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-21 23:29:45] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:29:51] [INFO ] Implicit Places using invariants in 5588 ms returned []
[2024-05-21 23:29:51] [INFO ] Invariant cache hit.
[2024-05-21 23:29:51] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 5842 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/317 places, 46/240 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
Applied a total of 44 rules in 5 ms. Remains 33 /66 variables (removed 33) and now considering 27/46 (removed 19) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-21 23:29:51] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 23:29:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 23:29:51] [INFO ] Invariant cache hit.
[2024-05-21 23:29:51] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/317 places, 27/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6088 ms. Remains : 33/317 places, 27/240 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-09 finished in 6226 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' '!(((!p0&&G(p1)) U (p2 U X(p2))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 313 transition count 236
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 313 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 312 transition count 235
Applied a total of 10 rules in 10 ms. Remains 312 /317 variables (removed 5) and now considering 235/240 (removed 5) transitions.
// Phase 1: matrix 235 rows 312 cols
[2024-05-21 23:29:51] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:29:51] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:29:51] [INFO ] Invariant cache hit.
[2024-05-21 23:29:52] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-21 23:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 4 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 6 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 4 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 11/145 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 235/547 variables, 312/459 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 18 places in 892 ms of which 28 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 480 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 89/168 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 235/547 variables, 312/487 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 234/721 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:29] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:30:29] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:30:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 7/728 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:41] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:30:42] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 730 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 105/105 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 312/317 places, 235/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 312/317 places, 235/240 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-11 finished in 60882 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&&G(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 137 edges and 317 vertex of which 7 / 317 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 309 transition count 201
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 279 transition count 201
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 62 place count 279 transition count 137
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 199 place count 206 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 201 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 201 transition count 132
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 383 place count 110 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 109 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 385 place count 108 transition count 48
Applied a total of 385 rules in 36 ms. Remains 108 /317 variables (removed 209) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 108 cols
[2024-05-21 23:30:52] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:30:52] [INFO ] Implicit Places using invariants in 134 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/317 places, 48/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 107/317 places, 48/240 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLCardinality-14 finished in 290 ms.
All properties solved by simple procedures.
Total runtime 377400 ms.

BK_STOP 1716334252795

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 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 ;