Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694800553.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-14, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 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-14-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678645172552

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:19:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:19:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:19:34] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-12 18:19:34] [INFO ] Transformed 624 places.
[2023-03-12 18:19:34] [INFO ] Transformed 564 transitions.
[2023-03-12 18:19:34] [INFO ] Found NUPN structural information;
[2023-03-12 18:19:34] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Support contains 117 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 614 transition count 556
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 547 transition count 489
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 547 transition count 489
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 168 place count 515 transition count 457
Iterating global reduction 1 with 32 rules applied. Total rules applied 200 place count 515 transition count 457
Applied a total of 200 rules in 94 ms. Remains 515 /616 variables (removed 101) and now considering 457/556 (removed 99) transitions.
// Phase 1: matrix 457 rows 515 cols
[2023-03-12 18:19:34] [INFO ] Computed 97 place invariants in 30 ms
[2023-03-12 18:19:34] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-12 18:19:34] [INFO ] Invariant cache hit.
[2023-03-12 18:19:35] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-12 18:19:35] [INFO ] Invariant cache hit.
[2023-03-12 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 515/616 places, 457/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1348 ms. Remains : 515/616 places, 457/556 transitions.
Support contains 117 out of 515 places after structural reductions.
[2023-03-12 18:19:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 18:19:35] [INFO ] Flatten gal took : 72 ms
FORMULA BusinessProcesses-PT-14-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:19:35] [INFO ] Flatten gal took : 35 ms
[2023-03-12 18:19:36] [INFO ] Input system was already deterministic with 457 transitions.
Support contains 112 out of 515 places (down from 117) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 77) seen :26
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Running SMT prover for 51 properties.
[2023-03-12 18:19:36] [INFO ] Invariant cache hit.
[2023-03-12 18:19:37] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-12 18:19:37] [INFO ] [Real]Absence check using 58 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-12 18:19:37] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:51
[2023-03-12 18:19:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2023-03-12 18:19:37] [INFO ] [Nat]Absence check using 58 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-12 18:19:39] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :50
[2023-03-12 18:19:39] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 7 ms to minimize.
[2023-03-12 18:19:39] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:19:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-12 18:19:39] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:19:39] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 0 ms to minimize.
[2023-03-12 18:19:40] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 0 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 0 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2109 ms
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 0 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 1 ms to minimize.
[2023-03-12 18:19:41] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 4 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 1 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:19:42] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 1 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 0 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 4 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:19:43] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2023-03-12 18:19:44] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3832 ms
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2023-03-12 18:19:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2023-03-12 18:19:45] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2023-03-12 18:19:46] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 0 ms to minimize.
[2023-03-12 18:19:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-03-12 18:19:46] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2023-03-12 18:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-12 18:19:46] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-12 18:19:46] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 0 ms to minimize.
[2023-03-12 18:19:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 1 ms to minimize.
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:19:47] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1190 ms
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:19:48] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 0 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1490 ms
[2023-03-12 18:19:49] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2023-03-12 18:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 1 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 0 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 578 ms
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 148 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:19:50] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 146 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 114 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 0 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 1 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:19:51] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:19:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2145 ms
[2023-03-12 18:19:53] [INFO ] After 15119ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :50
Attempting to minimize the solution found.
Minimization took 1443 ms.
[2023-03-12 18:19:54] [INFO ] After 17305ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :50
Fused 51 Parikh solutions to 50 different solutions.
Parikh walk visited 16 properties in 527 ms.
Support contains 45 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 215 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1130 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 506 transition count 395
Reduce places removed 54 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 452 transition count 388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 445 transition count 388
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 124 place count 445 transition count 309
Deduced a syphon composed of 79 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 292 place count 356 transition count 309
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 310 place count 338 transition count 291
Iterating global reduction 3 with 18 rules applied. Total rules applied 328 place count 338 transition count 291
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 328 place count 338 transition count 287
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 337 place count 333 transition count 287
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 555 place count 222 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 221 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 559 place count 221 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 561 place count 219 transition count 182
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 563 place count 219 transition count 182
Applied a total of 563 rules in 99 ms. Remains 219 /515 variables (removed 296) and now considering 182/457 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 219/515 places, 182/457 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 34) seen :30
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 182 rows 219 cols
[2023-03-12 18:19:55] [INFO ] Computed 79 place invariants in 11 ms
[2023-03-12 18:19:55] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:19:56] [INFO ] [Nat]Absence check using 55 positive place invariants in 7 ms returned sat
[2023-03-12 18:19:56] [INFO ] [Nat]Absence check using 55 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-12 18:19:56] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 18:19:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 18:19:56] [INFO ] After 37ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 18:19:56] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:19:56] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2023-03-12 18:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-12 18:19:56] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 18:19:56] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 182/182 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 219 transition count 172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 209 transition count 172
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 20 place count 209 transition count 157
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 57 place count 187 transition count 157
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 181 transition count 151
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 181 transition count 151
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 97 place count 167 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 166 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 166 transition count 148
Applied a total of 100 rules in 31 ms. Remains 166 /219 variables (removed 53) and now considering 148/182 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 166/219 places, 148/182 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 203 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 211 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Finished probabilistic random walk after 6092 steps, run visited all 3 properties in 47 ms. (steps per millisecond=129 )
Probabilistic random walk after 6092 steps, saw 2035 distinct states, run finished after 48 ms. (steps per millisecond=126 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-12 18:19:56] [INFO ] Flatten gal took : 22 ms
[2023-03-12 18:19:56] [INFO ] Flatten gal took : 32 ms
[2023-03-12 18:19:56] [INFO ] Input system was already deterministic with 457 transitions.
Computed a total of 142 stabilizing places and 132 stable transitions
Graph (complete) has 1137 edges and 515 vertex of which 511 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.21 ms
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 457
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 485 transition count 429
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 485 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 66 place count 477 transition count 421
Iterating global reduction 1 with 8 rules applied. Total rules applied 74 place count 477 transition count 421
Applied a total of 74 rules in 50 ms. Remains 477 /515 variables (removed 38) and now considering 421/457 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 477/515 places, 421/457 transitions.
[2023-03-12 18:19:56] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:19:56] [INFO ] Flatten gal took : 18 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 253 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1131 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 505 transition count 379
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 435 transition count 379
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 142 place count 435 transition count 284
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 349 place count 323 transition count 284
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 380 place count 292 transition count 253
Iterating global reduction 2 with 31 rules applied. Total rules applied 411 place count 292 transition count 253
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 411 place count 292 transition count 248
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 422 place count 286 transition count 248
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 650 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 652 place count 169 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 653 place count 168 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 167 transition count 134
Applied a total of 654 rules in 64 ms. Remains 167 /515 variables (removed 348) and now considering 134/457 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 167/515 places, 134/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 9 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 9 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 483 transition count 428
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 483 transition count 428
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 476 transition count 421
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 476 transition count 421
Applied a total of 75 rules in 22 ms. Remains 476 /515 variables (removed 39) and now considering 421/457 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 476/515 places, 421/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 477 transition count 422
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 466 transition count 411
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 466 transition count 411
Applied a total of 95 rules in 22 ms. Remains 466 /515 variables (removed 49) and now considering 411/457 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 466/515 places, 411/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 34 place count 481 transition count 426
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 481 transition count 426
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 470 transition count 415
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 470 transition count 415
Applied a total of 87 rules in 21 ms. Remains 470 /515 variables (removed 45) and now considering 415/457 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 470/515 places, 415/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 483 transition count 428
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 483 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 474 transition count 419
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 474 transition count 419
Applied a total of 79 rules in 28 ms. Remains 474 /515 variables (removed 41) and now considering 419/457 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 474/515 places, 419/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 477 transition count 422
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 466 transition count 411
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 466 transition count 411
Applied a total of 95 rules in 25 ms. Remains 466 /515 variables (removed 49) and now considering 411/457 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 466/515 places, 411/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 13 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 482 transition count 427
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 482 transition count 427
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 473 transition count 418
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 473 transition count 418
Applied a total of 81 rules in 21 ms. Remains 473 /515 variables (removed 42) and now considering 418/457 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 473/515 places, 418/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 457
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 36 place count 479 transition count 423
Iterating global reduction 1 with 34 rules applied. Total rules applied 70 place count 479 transition count 423
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 80 place count 469 transition count 413
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 469 transition count 413
Applied a total of 90 rules in 20 ms. Remains 469 /515 variables (removed 46) and now considering 413/457 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 469/515 places, 413/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 13 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 477 transition count 422
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 466 transition count 411
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 466 transition count 411
Applied a total of 95 rules in 21 ms. Remains 466 /515 variables (removed 49) and now considering 411/457 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 466/515 places, 411/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 254 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1131 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 505 transition count 379
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 435 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 434 transition count 378
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 144 place count 434 transition count 283
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 350 place count 323 transition count 283
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 381 place count 292 transition count 252
Iterating global reduction 3 with 31 rules applied. Total rules applied 412 place count 292 transition count 252
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 412 place count 292 transition count 247
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 423 place count 286 transition count 247
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 645 place count 173 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 647 place count 172 transition count 137
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 653 place count 172 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 654 place count 171 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 655 place count 170 transition count 136
Applied a total of 655 rules in 51 ms. Remains 170 /515 variables (removed 345) and now considering 136/457 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 170/515 places, 136/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 512 transition count 457
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 35 place count 480 transition count 425
Iterating global reduction 1 with 32 rules applied. Total rules applied 67 place count 480 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 469 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 469 transition count 414
Applied a total of 89 rules in 24 ms. Remains 469 /515 variables (removed 46) and now considering 414/457 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 469/515 places, 414/457 transitions.
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:19:57] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:19:57] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 255 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1131 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 505 transition count 377
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 433 transition count 377
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 146 place count 433 transition count 282
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 352 place count 322 transition count 282
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 382 place count 292 transition count 252
Iterating global reduction 2 with 30 rules applied. Total rules applied 412 place count 292 transition count 252
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 412 place count 292 transition count 247
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 423 place count 286 transition count 247
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 651 place count 170 transition count 135
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 2 with 2 rules applied. Total rules applied 653 place count 169 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 654 place count 168 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 655 place count 167 transition count 133
Applied a total of 655 rules in 38 ms. Remains 167 /515 variables (removed 348) and now considering 133/457 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 167/515 places, 133/457 transitions.
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:19:58] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 246 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1131 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 505 transition count 383
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 439 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 437 transition count 381
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 138 place count 437 transition count 284
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 349 place count 323 transition count 284
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 376 place count 296 transition count 257
Iterating global reduction 3 with 27 rules applied. Total rules applied 403 place count 296 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 403 place count 296 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 408 place count 293 transition count 255
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 634 place count 179 transition count 143
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 636 place count 178 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 177 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 176 transition count 141
Applied a total of 638 rules in 40 ms. Remains 176 /515 variables (removed 339) and now considering 141/457 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 176/515 places, 141/457 transitions.
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:19:58] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 457/457 transitions.
Graph (trivial) has 255 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1131 edges and 510 vertex of which 506 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 505 transition count 379
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 435 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 434 transition count 378
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 144 place count 434 transition count 281
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 355 place count 320 transition count 281
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 385 place count 290 transition count 251
Iterating global reduction 3 with 30 rules applied. Total rules applied 415 place count 290 transition count 251
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 415 place count 290 transition count 246
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 426 place count 284 transition count 246
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 652 place count 169 transition count 135
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 654 place count 168 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 655 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 656 place count 166 transition count 133
Applied a total of 656 rules in 47 ms. Remains 166 /515 variables (removed 349) and now considering 133/457 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 166/515 places, 133/457 transitions.
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:19:58] [INFO ] Input system was already deterministic with 133 transitions.
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:19:58] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:19:58] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-12 18:19:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 457 transitions and 1441 arcs took 5 ms.
Total runtime 24121 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/785/ctl_0_ --ctl=/tmp/785/ctl_1_ --ctl=/tmp/785/ctl_2_ --ctl=/tmp/785/ctl_3_ --ctl=/tmp/785/ctl_4_ --ctl=/tmp/785/ctl_5_ --ctl=/tmp/785/ctl_6_ --ctl=/tmp/785/ctl_7_ --ctl=/tmp/785/ctl_8_ --ctl=/tmp/785/ctl_9_ --ctl=/tmp/785/ctl_10_ --ctl=/tmp/785/ctl_11_ --ctl=/tmp/785/ctl_12_ --ctl=/tmp/785/ctl_13_ --ctl=/tmp/785/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 13993968 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098148 kB
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-15

BK_STOP 1678648769894

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-14-CTLCardinality-00
ctl formula formula --ctl=/tmp/785/ctl_0_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-01
ctl formula formula --ctl=/tmp/785/ctl_1_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-02
ctl formula formula --ctl=/tmp/785/ctl_2_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-03
ctl formula formula --ctl=/tmp/785/ctl_3_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-04
ctl formula formula --ctl=/tmp/785/ctl_4_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-05
ctl formula formula --ctl=/tmp/785/ctl_5_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-06
ctl formula formula --ctl=/tmp/785/ctl_6_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-07
ctl formula formula --ctl=/tmp/785/ctl_7_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-08
ctl formula formula --ctl=/tmp/785/ctl_8_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-09
ctl formula formula --ctl=/tmp/785/ctl_9_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-10
ctl formula formula --ctl=/tmp/785/ctl_10_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-11
ctl formula formula --ctl=/tmp/785/ctl_11_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-12
ctl formula formula --ctl=/tmp/785/ctl_12_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-13
ctl formula formula --ctl=/tmp/785/ctl_13_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-15
ctl formula formula --ctl=/tmp/785/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 515 places, 457 transitions and 1441 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 457->456 groups
pnml2lts-sym: Regrouping took 0.160 real 0.150 user 0.000 sys
pnml2lts-sym: state vector length is 515; there are 456 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 791
Killing (9) : 791

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-14"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-14, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694800553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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