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.r047-tajo-171620398500571.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 greatspnxred
Input is BusinessProcesses-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716307448680

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:04:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:04:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:04:10] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-21 16:04:10] [INFO ] Transformed 638 places.
[2024-05-21 16:04:10] [INFO ] Transformed 578 transitions.
[2024-05-21 16:04:10] [INFO ] Found NUPN structural information;
[2024-05-21 16:04:10] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 98 place count 532 transition count 477
Iterating global reduction 1 with 93 rules applied. Total rules applied 191 place count 532 transition count 477
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 237 place count 486 transition count 431
Iterating global reduction 1 with 46 rules applied. Total rules applied 283 place count 486 transition count 431
Applied a total of 283 rules in 168 ms. Remains 486 /630 variables (removed 144) and now considering 431/570 (removed 139) transitions.
// Phase 1: matrix 431 rows 486 cols
[2024-05-21 16:04:11] [INFO ] Computed 95 invariants in 55 ms
[2024-05-21 16:04:11] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-21 16:04:11] [INFO ] Invariant cache hit.
[2024-05-21 16:04:12] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-21 16:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 29 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:04:22] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:04:23] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:04:24] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:04:25] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:04:26] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 7 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-21 16:04:27] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 15 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:04:28] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:04:29] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 6 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:30] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 2 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/155 constraints. Problems are: Problem set: 8 solved, 422 unsolved
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:04:34] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/175 constraints. Problems are: Problem set: 8 solved, 422 unsolved
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/195 constraints. Problems are: Problem set: 15 solved, 415 unsolved
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 91 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/917 variables, and 208 constraints, problems are : Problem set: 15 solved, 415 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 15 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 37/37 constraints. Problems are: Problem set: 15 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/37 constraints. Problems are: Problem set: 15 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 56/93 constraints. Problems are: Problem set: 15 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/95 constraints. Problems are: Problem set: 15 solved, 415 unsolved
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 113/208 constraints. Problems are: Problem set: 19 solved, 411 unsolved
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 4 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/228 constraints. Problems are: Problem set: 19 solved, 411 unsolved
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/248 constraints. Problems are: Problem set: 19 solved, 411 unsolved
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:04:55] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:04:55] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/268 constraints. Problems are: Problem set: 19 solved, 411 unsolved
[2024-05-21 16:04:55] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:55] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:55] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:56] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:04:57] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:04:58] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:58] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/288 constraints. Problems are: Problem set: 19 solved, 411 unsolved
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 20/308 constraints. Problems are: Problem set: 24 solved, 406 unsolved
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 20/328 constraints. Problems are: Problem set: 24 solved, 406 unsolved
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 9 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 20/348 constraints. Problems are: Problem set: 30 solved, 400 unsolved
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 5 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 20/368 constraints. Problems are: Problem set: 30 solved, 400 unsolved
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 60231ms, After SMT, problems are : Problem set: 30 solved, 400 unsolved
Search for dead transitions found 30 dead transitions in 60247ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/630 places, 401/570 transitions.
Applied a total of 0 rules in 20 ms. Remains 486 /486 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61619 ms. Remains : 486/630 places, 401/570 transitions.
Support contains 29 out of 486 places after structural reductions.
[2024-05-21 16:05:12] [INFO ] Flatten gal took : 70 ms
[2024-05-21 16:05:13] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:05:13] [INFO ] Input system was already deterministic with 401 transitions.
RANDOM walk for 40000 steps (262 resets) in 1822 ms. (21 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (52 resets) in 447 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (42 resets) in 214 ms. (186 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (43 resets) in 90 ms. (439 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (42 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (45 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (52 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
// Phase 1: matrix 401 rows 486 cols
[2024-05-21 16:05:14] [INFO ] Computed 99 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 193/209 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 151/360 variables, 36/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 116/476 variables, 42/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/477 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 395/872 variables, 477/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 13/885 variables, 7/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/887 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/887 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 887/887 variables, and 585 constraints, problems are : Problem set: 0 solved, 9 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 193/209 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 151/360 variables, 36/68 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:05:17] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:05:18] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 15/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 116/476 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 16:05:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:05:20] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/477 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 395/872 variables, 477/625 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/872 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/887 variables, and 633 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 477/486 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 49/49 constraints]
After SMT, in 5964ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (complete) has 1046 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 485 transition count 353
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 98 place count 438 transition count 350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 435 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 101 place count 435 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 305 place count 325 transition count 256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 310 place count 320 transition count 251
Iterating global reduction 3 with 5 rules applied. Total rules applied 315 place count 320 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 315 place count 320 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 319 transition count 250
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 576 place count 186 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 186 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 579 place count 185 transition count 127
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 585 place count 185 transition count 127
Applied a total of 585 rules in 79 ms. Remains 185 /486 variables (removed 301) and now considering 127/401 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 185/486 places, 127/401 transitions.
RANDOM walk for 40000 steps (3241 resets) in 757 ms. (52 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (976 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (896 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (923 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1065 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (816 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (911 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1063 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
// Phase 1: matrix 127 rows 185 cols
[2024-05-21 16:05:21] [INFO ] Computed 76 invariants in 14 ms
[2024-05-21 16:05:21] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 56/148 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 34/182 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 127/309 variables, 182/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 3/312 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/312 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 267 constraints, problems are : Problem set: 0 solved, 7 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 185/185 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 56/148 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 34/182 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 127/309 variables, 182/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 7 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 13/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/312 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:24] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 16:05:24] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/312 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/312 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 295 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 185/185 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 21/21 constraints]
After SMT, in 4094ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 7 properties in 503 ms.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1046 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 479 transition count 339
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 425 transition count 339
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 110 place count 425 transition count 239
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 327 place count 308 transition count 239
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 336 place count 299 transition count 230
Iterating global reduction 2 with 9 rules applied. Total rules applied 345 place count 299 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 345 place count 299 transition count 229
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 347 place count 298 transition count 229
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 604 place count 165 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 606 place count 164 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 607 place count 163 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 608 place count 162 transition count 108
Applied a total of 608 rules in 75 ms. Remains 162 /486 variables (removed 324) and now considering 108/401 (removed 293) transitions.
// Phase 1: matrix 108 rows 162 cols
[2024-05-21 16:05:26] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 16:05:26] [INFO ] Implicit Places using invariants in 127 ms returned [20, 21, 22, 23, 24, 25, 44, 45, 46, 47]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 130 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/486 places, 108/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 152/486 places, 108/401 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-00
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-00 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 226 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 479 transition count 341
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 427 transition count 341
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 427 transition count 242
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 320 place count 312 transition count 242
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 304 transition count 234
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 304 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 336 place count 304 transition count 233
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 303 transition count 233
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 595 place count 170 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 597 place count 169 transition count 113
Applied a total of 597 rules in 127 ms. Remains 169 /486 variables (removed 317) and now considering 113/401 (removed 288) transitions.
// Phase 1: matrix 113 rows 169 cols
[2024-05-21 16:05:26] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 16:05:27] [INFO ] Implicit Places using invariants in 438 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 24, 25, 26, 27, 46, 47, 48, 49, 50, 134]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 440 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/486 places, 113/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 148/486 places, 113/401 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-01
Product exploration explored 100000 steps with 15202 reset in 287 ms.
Product exploration explored 100000 steps with 15118 reset in 251 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (6665 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2472 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2372 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2496 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2326 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Probably explored full state space saw : 15771 states, properties seen :3
Probabilistic random walk after 56032 steps, saw 15771 distinct states, run finished after 157 ms. (steps per millisecond=356 ) properties seen :3
Explored full state space saw : 15771 states, properties seen :0
Exhaustive walk after 56032 steps, saw 15771 distinct states, run finished after 92 ms. (steps per millisecond=609 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 28 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-01 finished in 1956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 479 transition count 340
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 426 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 425 transition count 339
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 240
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 324 place count 310 transition count 240
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 300 transition count 230
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 300 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 344 place count 300 transition count 229
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 299 transition count 229
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 603 place count 166 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 605 place count 165 transition count 109
Applied a total of 605 rules in 70 ms. Remains 165 /486 variables (removed 321) and now considering 109/401 (removed 292) transitions.
// Phase 1: matrix 109 rows 165 cols
[2024-05-21 16:05:28] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 16:05:28] [INFO ] Implicit Places using invariants in 194 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 45, 46, 47, 48, 49, 134]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 197 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/486 places, 109/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 144/486 places, 109/401 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-03 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 390
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 386
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 386
Applied a total of 30 rules in 28 ms. Remains 471 /486 variables (removed 15) and now considering 386/401 (removed 15) transitions.
// Phase 1: matrix 386 rows 471 cols
[2024-05-21 16:05:28] [INFO ] Computed 99 invariants in 7 ms
[2024-05-21 16:05:29] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-21 16:05:29] [INFO ] Invariant cache hit.
[2024-05-21 16:05:29] [INFO ] Implicit Places using invariants and state equation in 429 ms returned [150, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 765 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 469/486 places, 386/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 469 /469 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 799 ms. Remains : 469/486 places, 386/401 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-05 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 229 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 479 transition count 340
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 426 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 425 transition count 339
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 240
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 325 place count 309 transition count 240
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 300 transition count 231
Iterating global reduction 3 with 9 rules applied. Total rules applied 343 place count 300 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 299 transition count 230
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 606 place count 164 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 608 place count 163 transition count 108
Applied a total of 608 rules in 47 ms. Remains 163 /486 variables (removed 323) and now considering 108/401 (removed 293) transitions.
// Phase 1: matrix 108 rows 163 cols
[2024-05-21 16:05:29] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 16:05:29] [INFO ] Implicit Places using invariants in 171 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 43, 44, 47, 48]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 172 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/486 places, 108/401 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 144/486 places, 108/401 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-06
Stuttering criterion allowed to conclude after 77 steps with 14 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-06 finished in 298 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 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 391
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 391
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 472 transition count 387
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 472 transition count 387
Applied a total of 28 rules in 17 ms. Remains 472 /486 variables (removed 14) and now considering 387/401 (removed 14) transitions.
// Phase 1: matrix 387 rows 472 cols
[2024-05-21 16:05:30] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 16:05:30] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 16:05:30] [INFO ] Invariant cache hit.
[2024-05-21 16:05:30] [INFO ] Implicit Places using invariants and state equation in 484 ms returned [150, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 685 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/486 places, 387/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 470 /470 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 470/486 places, 387/401 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-07 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 390
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 386
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 386
Applied a total of 30 rules in 21 ms. Remains 471 /486 variables (removed 15) and now considering 386/401 (removed 15) transitions.
// Phase 1: matrix 386 rows 471 cols
[2024-05-21 16:05:30] [INFO ] Computed 99 invariants in 2 ms
[2024-05-21 16:05:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 16:05:30] [INFO ] Invariant cache hit.
[2024-05-21 16:05:31] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [150, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 602 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 469/486 places, 386/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 469 /469 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 469/486 places, 386/401 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-08 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 229 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 479 transition count 340
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 426 transition count 340
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 108 place count 426 transition count 240
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 325 place count 309 transition count 240
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 300 transition count 231
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 300 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 230
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 299 transition count 230
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 606 place count 164 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 163 transition count 108
Applied a total of 608 rules in 43 ms. Remains 163 /486 variables (removed 323) and now considering 108/401 (removed 293) transitions.
// Phase 1: matrix 108 rows 163 cols
[2024-05-21 16:05:31] [INFO ] Computed 73 invariants in 0 ms
[2024-05-21 16:05:32] [INFO ] Implicit Places using invariants in 608 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 43, 44, 45, 46, 47]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 609 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/486 places, 108/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 656 ms. Remains : 143/486 places, 108/401 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-09 finished in 721 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 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 392
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 475 transition count 390
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 475 transition count 390
Applied a total of 22 rules in 32 ms. Remains 475 /486 variables (removed 11) and now considering 390/401 (removed 11) transitions.
// Phase 1: matrix 390 rows 475 cols
[2024-05-21 16:05:32] [INFO ] Computed 99 invariants in 4 ms
[2024-05-21 16:05:32] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-21 16:05:32] [INFO ] Invariant cache hit.
[2024-05-21 16:05:33] [INFO ] Implicit Places using invariants and state equation in 449 ms returned [152, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 718 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 390/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 473 /473 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 758 ms. Remains : 473/486 places, 390/401 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1019 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 35 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-16-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-10 finished in 1277 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((G(p1)&&p0))||X(p2))))'
Support contains 7 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 473 transition count 388
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 473 transition count 388
Applied a total of 26 rules in 35 ms. Remains 473 /486 variables (removed 13) and now considering 388/401 (removed 13) transitions.
// Phase 1: matrix 388 rows 473 cols
[2024-05-21 16:05:33] [INFO ] Computed 99 invariants in 5 ms
[2024-05-21 16:05:33] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 16:05:33] [INFO ] Invariant cache hit.
[2024-05-21 16:05:34] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [151, 152]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 712 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 388/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 471 /471 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 471/486 places, 388/401 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-12
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-12 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 481 vertex of which 480 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 479 transition count 339
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 425 transition count 339
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 240
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 325 place count 309 transition count 240
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 300 transition count 231
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 300 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 299 transition count 230
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 608 place count 163 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 162 transition count 107
Applied a total of 610 rules in 50 ms. Remains 162 /486 variables (removed 324) and now considering 107/401 (removed 294) transitions.
// Phase 1: matrix 107 rows 162 cols
[2024-05-21 16:05:34] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 16:05:34] [INFO ] Implicit Places using invariants in 115 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 44, 45, 46, 47, 48]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 119 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/486 places, 107/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 142/486 places, 107/401 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-14
Product exploration explored 100000 steps with 21920 reset in 166 ms.
Stuttering criterion allowed to conclude after 22264 steps with 4943 reset in 41 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-14 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 401/401 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 390
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 386
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 386
Applied a total of 30 rules in 21 ms. Remains 471 /486 variables (removed 15) and now considering 386/401 (removed 15) transitions.
// Phase 1: matrix 386 rows 471 cols
[2024-05-21 16:05:35] [INFO ] Computed 99 invariants in 8 ms
[2024-05-21 16:05:35] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-21 16:05:35] [INFO ] Invariant cache hit.
[2024-05-21 16:05:35] [INFO ] Implicit Places using invariants and state equation in 403 ms returned [150, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 640 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 469/486 places, 386/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 469 /469 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 668 ms. Remains : 469/486 places, 386/401 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1011 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-15 finished in 1200 ms.
All properties solved by simple procedures.
Total runtime 85842 ms.
ITS solved all properties within timeout

BK_STOP 1716307536319

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-16, 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 r047-tajo-171620398500571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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