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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 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 104K 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678641553933

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:19:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:19:15] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-12 17:19:15] [INFO ] Transformed 403 places.
[2023-03-12 17:19:15] [INFO ] Transformed 374 transitions.
[2023-03-12 17:19:15] [INFO ] Found NUPN structural information;
[2023-03-12 17:19:15] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 137 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 367 transition count 339
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 367 transition count 339
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 354 transition count 326
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 354 transition count 326
Applied a total of 97 rules in 63 ms. Remains 354 /403 variables (removed 49) and now considering 326/374 (removed 48) transitions.
// Phase 1: matrix 326 rows 354 cols
[2023-03-12 17:19:15] [INFO ] Computed 64 place invariants in 25 ms
[2023-03-12 17:19:16] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 17:19:16] [INFO ] Invariant cache hit.
[2023-03-12 17:19:16] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-12 17:19:16] [INFO ] Invariant cache hit.
[2023-03-12 17:19:25] [INFO ] Dead Transitions using invariants and state equation in 8786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/403 places, 326/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9523 ms. Remains : 354/403 places, 326/374 transitions.
Support contains 137 out of 354 places after structural reductions.
[2023-03-12 17:19:25] [INFO ] Flatten gal took : 130 ms
[2023-03-12 17:19:25] [INFO ] Flatten gal took : 59 ms
[2023-03-12 17:19:25] [INFO ] Input system was already deterministic with 326 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 92) seen :49
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Running SMT prover for 43 properties.
[2023-03-12 17:19:26] [INFO ] Invariant cache hit.
[2023-03-12 17:19:27] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2023-03-12 17:19:27] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 18 ms returned sat
[2023-03-12 17:19:27] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:38
[2023-03-12 17:19:27] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 6 ms to minimize.
[2023-03-12 17:19:28] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2023-03-12 17:19:28] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:19:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2023-03-12 17:19:28] [INFO ] After 879ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:43
[2023-03-12 17:19:28] [INFO ] After 1445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2023-03-12 17:19:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 221 ms returned sat
[2023-03-12 17:19:29] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 209 ms returned sat
[2023-03-12 17:19:30] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :32
[2023-03-12 17:19:30] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2023-03-12 17:19:30] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2023-03-12 17:19:30] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:19:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 320 ms
[2023-03-12 17:19:31] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-12 17:19:31] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:19:31] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:19:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2023-03-12 17:19:31] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-12 17:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-12 17:19:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-12 17:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
[2023-03-12 17:19:32] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 0 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 1 ms to minimize.
[2023-03-12 17:19:33] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 0 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 1 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2464 ms
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2023-03-12 17:19:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 1 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 1 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 0 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2023-03-12 17:19:35] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 0 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 3 ms to minimize.
[2023-03-12 17:19:36] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 1 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 0 ms to minimize.
[2023-03-12 17:19:37] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 0 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3564 ms
[2023-03-12 17:19:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-12 17:19:38] [INFO ] After 8978ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :31
Attempting to minimize the solution found.
Minimization took 535 ms.
[2023-03-12 17:19:39] [INFO ] After 11134ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :31
Fused 43 Parikh solutions to 31 different solutions.
Parikh walk visited 18 properties in 399 ms.
Support contains 19 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 7 / 354 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 348 transition count 276
Reduce places removed 42 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 306 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 303 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 91 place count 303 transition count 215
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 216 place count 236 transition count 215
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 233 place count 219 transition count 198
Iterating global reduction 3 with 17 rules applied. Total rules applied 250 place count 219 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 250 place count 219 transition count 196
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 217 transition count 196
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 395 place count 145 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 397 place count 144 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 398 place count 144 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 143 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 143 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 142 transition count 128
Applied a total of 401 rules in 90 ms. Remains 142 /354 variables (removed 212) and now considering 128/326 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 142/354 places, 128/326 transitions.
Incomplete random walk after 10000 steps, including 1244 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 342 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 333 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 142 cols
[2023-03-12 17:19:40] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-12 17:19:40] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-12 17:19:40] [INFO ] [Real]Absence check using 35 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-12 17:19:40] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:19:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:19:40] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:40] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-12 17:19:40] [INFO ] [Nat]Absence check using 35 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-12 17:19:40] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:40] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-12 17:19:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-12 17:19:40] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 17:19:40] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 128/128 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 142 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 138 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 138 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 21 place count 131 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 130 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 130 transition count 117
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 40 place count 121 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 121 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 120 transition count 108
Applied a total of 42 rules in 22 ms. Remains 120 /142 variables (removed 22) and now considering 108/128 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 120/142 places, 108/128 transitions.
Incomplete random walk after 10000 steps, including 565 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1658641 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :{}
Probabilistic random walk after 1658641 steps, saw 426855 distinct states, run finished after 3007 ms. (steps per millisecond=551 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 120 cols
[2023-03-12 17:19:43] [INFO ] Computed 50 place invariants in 13 ms
[2023-03-12 17:19:43] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-12 17:19:43] [INFO ] [Real]Absence check using 32 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 17:19:43] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:19:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:43] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:43] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-12 17:19:43] [INFO ] [Nat]Absence check using 32 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-12 17:19:43] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:43] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:43] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-12 17:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-12 17:19:44] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 17:19:44] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 108/108 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 120/120 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 108/108 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-12 17:19:44] [INFO ] Invariant cache hit.
[2023-03-12 17:19:44] [INFO ] Implicit Places using invariants in 130 ms returned [10, 11, 37, 38, 42, 43, 44]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 133 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/120 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 148 ms. Remains : 113/120 places, 108/108 transitions.
Incomplete random walk after 10000 steps, including 545 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1860320 steps, run timeout after 3001 ms. (steps per millisecond=619 ) properties seen :{}
Probabilistic random walk after 1860320 steps, saw 458431 distinct states, run finished after 3001 ms. (steps per millisecond=619 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 113 cols
[2023-03-12 17:19:47] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-12 17:19:47] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-12 17:19:47] [INFO ] [Real]Absence check using 27 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-12 17:19:47] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:19:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:47] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:47] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-12 17:19:47] [INFO ] [Nat]Absence check using 27 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-12 17:19:47] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:47] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:47] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-12 17:19:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-12 17:19:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-12 17:19:47] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 17:19:47] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 113/113 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-12 17:19:47] [INFO ] Invariant cache hit.
[2023-03-12 17:19:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 17:19:47] [INFO ] Invariant cache hit.
[2023-03-12 17:19:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [44, 64, 66, 72, 74]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 222 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/113 places, 108/108 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 106 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 106 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 105 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 105 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 103 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 103 transition count 102
Applied a total of 11 rules in 33 ms. Remains 103 /108 variables (removed 5) and now considering 102/108 (removed 6) transitions.
// Phase 1: matrix 102 rows 103 cols
[2023-03-12 17:19:47] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-12 17:19:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 17:19:47] [INFO ] Invariant cache hit.
[2023-03-12 17:19:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:48] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/113 places, 102/108 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 491 ms. Remains : 103/113 places, 102/108 transitions.
Incomplete random walk after 10000 steps, including 644 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1977911 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :{}
Probabilistic random walk after 1977911 steps, saw 481473 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:19:51] [INFO ] Invariant cache hit.
[2023-03-12 17:19:51] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-12 17:19:51] [INFO ] [Real]Absence check using 21 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 17:19:51] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:19:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:51] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:51] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-12 17:19:51] [INFO ] [Nat]Absence check using 21 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 17:19:51] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:51] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:51] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 17:19:51] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-12 17:19:51] [INFO ] Invariant cache hit.
[2023-03-12 17:19:51] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 17:19:51] [INFO ] Invariant cache hit.
[2023-03-12 17:19:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:19:51] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-12 17:19:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 17:19:51] [INFO ] Invariant cache hit.
[2023-03-12 17:19:51] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 103/103 places, 102/102 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 103 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 102 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 94 transition count 96
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 1 with 2 rules applied. Total rules applied 17 place count 93 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 93 transition count 95
Graph (complete) has 361 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 92 transition count 95
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 92 transition count 94
Applied a total of 21 rules in 17 ms. Remains 92 /103 variables (removed 11) and now considering 94/102 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 92 cols
[2023-03-12 17:19:51] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 17:19:51] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-12 17:19:51] [INFO ] [Real]Absence check using 19 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-12 17:19:51] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 17:19:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:19:51] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 17:19:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-12 17:19:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 296 ms
[2023-03-12 17:19:52] [INFO ] After 307ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:52] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:19:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-12 17:19:52] [INFO ] [Nat]Absence check using 19 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-12 17:19:52] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:52] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:19:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2023-03-12 17:19:52] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 17:19:52] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 23 ms
[2023-03-12 17:19:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-09-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 23 ms
[2023-03-12 17:19:52] [INFO ] Input system was already deterministic with 326 transitions.
Support contains 97 out of 354 places (down from 110) after GAL structural reductions.
Computed a total of 212 stabilizing places and 214 stable transitions
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 173 edges and 354 vertex of which 4 / 354 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 790 edges and 351 vertex of which 350 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 removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 349 transition count 271
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 299 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 298 transition count 270
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 104 place count 298 transition count 204
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 245 place count 223 transition count 204
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 267 place count 201 transition count 182
Iterating global reduction 3 with 22 rules applied. Total rules applied 289 place count 201 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 289 place count 201 transition count 180
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 199 transition count 180
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 430 place count 129 transition count 113
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 432 place count 128 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 433 place count 127 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 126 transition count 111
Applied a total of 434 rules in 58 ms. Remains 126 /354 variables (removed 228) and now considering 111/326 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 126/354 places, 111/326 transitions.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:52] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 7 / 354 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 786 edges and 348 vertex of which 347 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 removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 346 transition count 266
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 295 transition count 266
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 104 place count 295 transition count 200
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 246 place count 219 transition count 200
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 196 transition count 177
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 196 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 292 place count 196 transition count 175
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 194 transition count 175
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 433 place count 124 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 123 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 435 place count 122 transition count 107
Applied a total of 435 rules in 39 ms. Remains 122 /354 variables (removed 232) and now considering 107/326 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 122/354 places, 107/326 transitions.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:19:52] [INFO ] Input system was already deterministic with 107 transitions.
Finished random walk after 817 steps, including 130 resets, run visited all 1 properties in 4 ms. (steps per millisecond=204 )
FORMULA BusinessProcesses-PT-09-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 352 transition count 285
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 313 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 311 transition count 283
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 83 place count 311 transition count 207
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 245 place count 225 transition count 207
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 269 place count 201 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 293 place count 201 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 293 place count 201 transition count 181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 199 transition count 181
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 434 place count 129 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 129 transition count 114
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 129 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 437 place count 128 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 438 place count 127 transition count 112
Applied a total of 438 rules in 41 ms. Remains 127 /354 variables (removed 227) and now considering 112/326 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 127/354 places, 112/326 transitions.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:19:52] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 26 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:19:52] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 319 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 319 transition count 291
Applied a total of 70 rules in 37 ms. Remains 319 /354 variables (removed 35) and now considering 291/326 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 319/354 places, 291/326 transitions.
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:19:52] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 327 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 317 transition count 289
Applied a total of 74 rules in 29 ms. Remains 317 /354 variables (removed 37) and now considering 289/326 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 317/354 places, 289/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 26 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 352 transition count 284
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 312 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 310 transition count 282
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 85 place count 310 transition count 207
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 245 place count 225 transition count 207
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 268 place count 202 transition count 184
Iterating global reduction 3 with 23 rules applied. Total rules applied 291 place count 202 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 291 place count 202 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 295 place count 200 transition count 182
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 434 place count 129 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 129 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 128 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 127 transition count 113
Applied a total of 437 rules in 36 ms. Remains 127 /354 variables (removed 227) and now considering 113/326 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 127/354 places, 113/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 333 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 333 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 326 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 326 transition count 298
Applied a total of 56 rules in 26 ms. Remains 326 /354 variables (removed 28) and now considering 298/326 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 326/354 places, 298/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 330 transition count 302
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 330 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 323 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 323 transition count 295
Applied a total of 62 rules in 44 ms. Remains 323 /354 variables (removed 31) and now considering 295/326 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 323/354 places, 295/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 174 edges and 354 vertex of which 7 / 354 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 786 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 346 transition count 269
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 298 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 296 transition count 267
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 102 place count 296 transition count 202
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 241 place count 222 transition count 202
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 264 place count 199 transition count 179
Iterating global reduction 3 with 23 rules applied. Total rules applied 287 place count 199 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 287 place count 199 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 197 transition count 177
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 430 place count 126 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 431 place count 125 transition count 108
Applied a total of 431 rules in 33 ms. Remains 125 /354 variables (removed 229) and now considering 108/326 (removed 218) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 125/354 places, 108/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 327 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 317 transition count 289
Applied a total of 74 rules in 24 ms. Remains 317 /354 variables (removed 37) and now considering 289/326 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 317/354 places, 289/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 23 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 24 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 328 transition count 300
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 328 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 319 transition count 291
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 319 transition count 291
Applied a total of 70 rules in 21 ms. Remains 319 /354 variables (removed 35) and now considering 291/326 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 319/354 places, 291/326 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:19:53] [INFO ] Input system was already deterministic with 291 transitions.
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:19:53] [INFO ] Flatten gal took : 13 ms
[2023-03-12 17:19:53] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 17:19:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 354 places, 326 transitions and 1051 arcs took 2 ms.
Total runtime 38289 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/771/ctl_0_ --ctl=/tmp/771/ctl_1_ --ctl=/tmp/771/ctl_2_ --ctl=/tmp/771/ctl_3_ --ctl=/tmp/771/ctl_4_ --ctl=/tmp/771/ctl_5_ --ctl=/tmp/771/ctl_6_ --ctl=/tmp/771/ctl_7_ --ctl=/tmp/771/ctl_8_ --ctl=/tmp/771/ctl_9_ --ctl=/tmp/771/ctl_10_ --ctl=/tmp/771/ctl_11_ --ctl=/tmp/771/ctl_12_ --ctl=/tmp/771/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12340608 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098324 kB

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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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-09"
export BK_EXAMINATION="CTLFireability"
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-09, 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 r041-tajo-167813694800514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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