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-171620398400522.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 131K 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-10-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716304778555

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:19:40] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-21 15:19:40] [INFO ] Transformed 518 places.
[2024-05-21 15:19:40] [INFO ] Transformed 471 transitions.
[2024-05-21 15:19:40] [INFO ] Found NUPN structural information;
[2024-05-21 15:19:40] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 125 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 467 transition count 421
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 467 transition count 421
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 445 transition count 399
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 445 transition count 399
Applied a total of 145 rules in 205 ms. Remains 445 /518 variables (removed 73) and now considering 399/471 (removed 72) transitions.
// Phase 1: matrix 399 rows 445 cols
[2024-05-21 15:19:41] [INFO ] Computed 84 invariants in 39 ms
[2024-05-21 15:19:41] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-21 15:19:41] [INFO ] Invariant cache hit.
[2024-05-21 15:19:42] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-21 15:19:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 22 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:19:51] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:19:52] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:19:53] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:19:54] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 4 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:19:55] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:19:56] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:19:57] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:19:58] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:19:59] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:19:59] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:19:59] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:02] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:20:02] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:20:02] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:20:02] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:20:03] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:20:04] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:20:05] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:05] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:20:05] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:20:05] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:20:05] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:20:06] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 5 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:20:07] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:20:08] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:20:08] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:08] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:20:08] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:20:08] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 4 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:20:09] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:20:10] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:20:11] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:20:11] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/844 variables, and 204 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/445 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:20:16] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:20:17] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:20:17] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 4 ms to minimize.
[2024-05-21 15:20:17] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:20:17] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:20:17] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:20:18] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:20:19] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:19] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:20:19] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:20:19] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:20:20] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:20:21] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:20:22] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:20:22] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:23] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:20:23] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:20:23] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:20:23] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:20:24] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:20:25] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:20:26] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:20:27] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:28] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:20:29] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:20:29] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:20:29] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:20:29] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:20:29] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:20:30] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:20:31] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:20:32] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:20:33] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:20:33] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 4 ms to minimize.
[2024-05-21 15:20:33] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:20:33] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:20:33] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:35] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:20:35] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:20:35] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:20:36] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 4 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 15 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 99 places in 220 ms of which 5 ms to minimize.
[2024-05-21 15:20:37] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:20:38] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 4 ms to minimize.
[2024-05-21 15:20:38] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:20:38] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:20:38] [INFO ] Deduced a trap composed of 96 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:20:38] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:20:40] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:20:41] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:20:42] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:20:42] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:20:42] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:20:42] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 60292ms, After SMT, problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 445/518 places, 399/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61662 ms. Remains : 445/518 places, 399/471 transitions.
Support contains 125 out of 445 places after structural reductions.
[2024-05-21 15:20:42] [INFO ] Flatten gal took : 76 ms
[2024-05-21 15:20:43] [INFO ] Flatten gal took : 42 ms
[2024-05-21 15:20:43] [INFO ] Input system was already deterministic with 399 transitions.
Support contains 122 out of 445 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (325 resets) in 2108 ms. (18 steps per ms) remains 35/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
[2024-05-21 15:20:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 242/309 variables, 37/37 constraints. Problems are: Problem set: 2 solved, 33 unsolved
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:20:44] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 12/49 constraints. Problems are: Problem set: 2 solved, 33 unsolved
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:20:45] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:20:46] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/69 constraints. Problems are: Problem set: 2 solved, 33 unsolved
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:20:47] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 12/81 constraints. Problems are: Problem set: 2 solved, 33 unsolved
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:20:48] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:20:49] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:20:49] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 5061ms, After SMT, problems are : Problem set: 2 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (complete) has 991 edges and 445 vertex of which 444 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 444 transition count 363
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 409 transition count 360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 406 transition count 360
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 77 place count 406 transition count 283
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 240 place count 320 transition count 283
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 258 place count 302 transition count 265
Iterating global reduction 3 with 18 rules applied. Total rules applied 276 place count 302 transition count 265
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 445 place count 216 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 446 place count 216 transition count 181
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 453 place count 216 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 454 place count 215 transition count 180
Applied a total of 454 rules in 121 ms. Remains 215 /445 variables (removed 230) and now considering 180/399 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 215/445 places, 180/399 transitions.
RANDOM walk for 40000 steps (1976 resets) in 761 ms. (52 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (44 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (41 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (46 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (40 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (42 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (42 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (45 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 447330 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :20 out of 33
Probabilistic random walk after 447330 steps, saw 66511 distinct states, run finished after 3005 ms. (steps per millisecond=148 ) properties seen :20
// Phase 1: matrix 180 rows 215 cols
[2024-05-21 15:20:52] [INFO ] Computed 72 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 108/143 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 5 (OVERLAPS) 46/212 variables, 27/71 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
Problem AtomicPropp19 is UNSAT
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
Problem AtomicPropp25 is UNSAT
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:20:53] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:20:54] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 4 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/91 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/91 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 180/392 variables, 212/303 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/303 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 10 (OVERLAPS) 3/395 variables, 3/306 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 1/307 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/307 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/395 variables, 0/307 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 307 constraints, problems are : Problem set: 10 solved, 3 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/75 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/98 variables, 12/21 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 61/159 variables, 24/45 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 3/48 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/167 variables, 6/54 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/55 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/55 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 37/204 variables, 16/71 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 8/79 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/79 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/208 variables, 3/82 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 2/84 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 178/386 variables, 208/292 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/386 variables, 2/294 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/386 variables, 0/294 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/392 variables, 5/299 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 1/300 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 1/301 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/392 variables, 6/307 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-05-21 15:20:55] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:20:55] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:20:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/392 variables, 3/310 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/392 variables, 0/310 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/394 variables, 1/311 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/394 variables, 0/311 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/395 variables, 2/313 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/395 variables, 0/313 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/395 variables, 0/313 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 313 constraints, problems are : Problem set: 10 solved, 3 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 3/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 2738ms problems are : Problem set: 10 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1577 ms.
Support contains 8 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 174
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 209 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 208 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 14 place count 208 transition count 154
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 56 place count 185 transition count 154
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 180 transition count 149
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 180 transition count 149
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 103 place count 161 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 105 place count 160 transition count 148
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 160 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 159 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 159 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 158 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 158 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 156 transition count 144
Applied a total of 112 rules in 47 ms. Remains 156 /215 variables (removed 59) and now considering 144/180 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 156/215 places, 144/180 transitions.
RANDOM walk for 40000 steps (4148 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1192 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1364 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1282 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 39063 steps, run visited all 3 properties in 169 ms. (steps per millisecond=231 )
Probabilistic random walk after 39063 steps, saw 10367 distinct states, run finished after 174 ms. (steps per millisecond=224 ) properties seen :3
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:20:57] [INFO ] Input system was already deterministic with 399 transitions.
Support contains 78 out of 445 places (down from 81) after GAL structural reductions.
Computed a total of 223 stabilizing places and 228 stable transitions
Graph (complete) has 991 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 355
Applied a total of 88 rules in 30 ms. Remains 401 /445 variables (removed 44) and now considering 355/399 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 401/445 places, 355/399 transitions.
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:20:57] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 417 transition count 371
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 417 transition count 371
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 409 transition count 363
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 409 transition count 363
Applied a total of 72 rules in 22 ms. Remains 409 /445 variables (removed 36) and now considering 363/399 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 409/445 places, 363/399 transitions.
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:20:57] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 39 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 400/445 places, 354/399 transitions.
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:20:57] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 368
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 403 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 403 transition count 357
Applied a total of 84 rules in 24 ms. Remains 403 /445 variables (removed 42) and now considering 357/399 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 403/445 places, 357/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 7 / 445 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 984 edges and 439 vertex of which 438 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 438 transition count 332
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 379 transition count 332
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 120 place count 379 transition count 249
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 299 place count 283 transition count 249
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 325 place count 257 transition count 223
Iterating global reduction 2 with 26 rules applied. Total rules applied 351 place count 257 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 351 place count 257 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 253 transition count 220
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 550 place count 155 transition count 126
Applied a total of 550 rules in 50 ms. Remains 155 /445 variables (removed 290) and now considering 126/399 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 155/445 places, 126/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (complete) has 991 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 443 transition count 348
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 394 transition count 345
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 391 transition count 345
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 105 place count 391 transition count 255
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 297 place count 289 transition count 255
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 327 place count 259 transition count 225
Iterating global reduction 3 with 30 rules applied. Total rules applied 357 place count 259 transition count 225
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 259 transition count 222
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 364 place count 255 transition count 222
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 534 place count 168 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 167 transition count 138
Applied a total of 535 rules in 48 ms. Remains 167 /445 variables (removed 278) and now considering 138/399 (removed 261) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 167/445 places, 138/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 420 transition count 374
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 420 transition count 374
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 411 transition count 365
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 411 transition count 365
Applied a total of 68 rules in 71 ms. Remains 411 /445 variables (removed 34) and now considering 365/399 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 411/445 places, 365/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 29 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 400/445 places, 354/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 414 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 414 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 402 transition count 356
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 402 transition count 356
Applied a total of 86 rules in 27 ms. Remains 402 /445 variables (removed 43) and now considering 356/399 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 402/445 places, 356/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 401 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 401 transition count 355
Applied a total of 88 rules in 26 ms. Remains 401 /445 variables (removed 44) and now considering 355/399 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 401/445 places, 355/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Graph (trivial) has 218 edges and 445 vertex of which 4 / 445 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 988 edges and 442 vertex of which 441 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 440 transition count 334
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 380 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 378 transition count 332
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 126 place count 378 transition count 250
Deduced a syphon composed of 82 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 303 place count 283 transition count 250
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 330 place count 256 transition count 223
Iterating global reduction 3 with 27 rules applied. Total rules applied 357 place count 256 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 357 place count 256 transition count 220
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 364 place count 252 transition count 220
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 550 place count 157 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 552 place count 156 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 553 place count 156 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 155 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 555 place count 154 transition count 127
Applied a total of 555 rules in 53 ms. Remains 154 /445 variables (removed 291) and now considering 127/399 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 154/445 places, 127/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 413 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 413 transition count 367
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 402 transition count 356
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 402 transition count 356
Applied a total of 86 rules in 30 ms. Remains 402 /445 variables (removed 43) and now considering 356/399 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 402/445 places, 356/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 412 transition count 366
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 400 transition count 354
Applied a total of 90 rules in 24 ms. Remains 400 /445 variables (removed 45) and now considering 354/399 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 400/445 places, 354/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 399/399 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 416 transition count 370
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 416 transition count 370
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 407 transition count 361
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 407 transition count 361
Applied a total of 76 rules in 24 ms. Remains 407 /445 variables (removed 38) and now considering 361/399 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 407/445 places, 361/399 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:20:58] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-21 15:20:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:20:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:20:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 15:20:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 445 places, 399 transitions and 1270 arcs took 3 ms.
Total runtime 78591 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 445
TRANSITIONS: 399
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1610
MODEL NAME: /home/mcc/execution/421/model
445 places, 399 transitions.

No place bound informations found.
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
export BK_EXAMINATION="CTLFireability"
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-10, examination is CTLFireability"
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-171620398400522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;